Geometries and material constants for eddy current problems. More...

Namespaces
namespace	gfem
Classes
class	_HashedSMatrix_iterator
	STL like iterator for hashed sparse matrices. More...
class	_Matrix_iterator
	STL iterator for matrices. More...
class	_Matrix_iterator_base
	Base class for STL like iterator for matrices. More...
class	_SubMatrix_iterator
	STL like iterator for sub matrices. More...
class	Absolute
	The absolute value of a element function. More...
class	AbsoluteComp
	The component wise absolute value of a element function. More...
class	AdaptiveAdjust
	Class to describe adjustments to elements in an adaptive space. More...
class	AdaptiveAdjustP
	Class to describe adjustments to elements in an adaptive space. More...
struct	AdaptiveControl
	Class to describe control structures of an adaptive space. More...
struct	AdaptiveControlP
	Describe control structures of a high order adaptive space. More...
struct	AdaptiveControlTag
	Tag information which is used in AdaptiveControl. More...
class	AdaptiveModel
class	AdaptiveSpace
	Abstract base class for an adaptive space. More...
class	Adaptivity
	Abstract base class for an adaptive classes, a.o.t. More...
class	AfterIteration
	Solver with after iterations. More...
class	AnasaziES
class	AnasaziMV
class	AnasaziOp
class	Array
	An array of objects. More...
class	ArrayCoord
	Array with coordinates of a cell. More...
class	ArrayCoord< 1 >
	Array with coordinates in 2D. More...
class	ArrayCoord< 2 >
	Array with coordinates in 2D. More...
class	ArrayDeterminant
	Class, which calculates the determinant for each element of the array. More...
class	ArrayGramMatrix
	Class, which calculates the Gram matrix M * M^T for each matrix of the array. More...
class	ArrayJacobian
	Array of jacobian matrices on quadrature points. More...
class	ArrayJacobian< 1, 1 >
	Array of jacobian determinants. More...
class	ArrayJacobian< 2, 2 >
	Array of jacobian matrices in 2D on 2D elements. More...
class	ArrayLocalCoord
	Array of local coordinates, e.g., inside a quad, but only along an edge. More...
class	ArrayMatrixInverse
	Class, which calculates the inverse matrix for each element of the array. More...
class	ArrayMatrixTranspose
	Class, which calculates the transpose matrix for each element of the array. More...
class	ArrayReciprocal
	Class, which calculates the reciprocal for each element of the array. More...
class	ArrayScan
	Scanner for an Array. More...
class	Assertion
	Exception class for assertions. More...
class	Attribute
	Attributes for elements of the topology. More...
class	AttributeBool
	A function class to query attributes. More...
class	AttributesFile
class	BaseSequence
	Sequence with operations and output operator. More...
class	BaseSet
	Set with operations and output operator. More...
class	BernoulliPol
class	BesselJ
	Class for evaluating the Bessel function of first kind. More...
class	BesselY
	Class for evaluating the Bessel function of second kind. More...
class	BiCGStab
	Solves a symmetric system of linear equations with BiConjugate Gradient Stabilized (BICGSTAB). More...
class	BiCGStabFabric
	Fabric class for conjugate gradients: `BiCGStab`. More...
class	BilinearForm
	Abstract function class to evaluate a bilinear form. More...
class	BilinearFormLiCo
	A linear combination of bilinear forms. More...
class	BlendingQuad2d
	A 2D element map for a curved quadrilateral. More...
class	Boundary
	Class to describe an element of the boundary. More...
class	BoundaryConditions
	Boundary conditions. More...
class	BuildTColumnsBase
	Base class for classes for building T columns for elements in a space with help of space pre builder. More...
class	Cell
	A cell in a mesh consist of topological information (neighbours, connectivity, orientation) and geometrical information (coordinates). More...
class	Cell1
	One dimensional cell. More...
class	Cell2
	Two dimensional cell. More...
class	Cell3
	Three dimensional cell. More...
class	CellCondition
class	CellConditions
class	CellData
	Stores additional information on a cell, namely its father. More...
class	CellEdgeIntegral
	Integral over a edge, evaluated on a cell. More...
class	CellFaceIntegral
	Integral over a face, evaluated on a cell. More...
class	CellIntegral
	Integral, evaluated on a cell. More...
class	CellPostprocess
	Abstract class for per cell postprocessing. More...
class	CellToCellMapping
class	CG
	Solves a symmetric system of linear equations with conjugate gradients (CG). More...
class	CGFabric
	Fabric class for conjugate gradients: `CG`. More...
class	Circle
	Mesh for a circle. More...
class	CircleBoundary
class	CircleMappingEdge2d
	2D element map for an circular arc. More...
class	Cloneable
	Cloneable interface. More...
class	CmplxPart
	Abstract class for a function, which is one part of an complex function. More...
struct	Cmplxtype
	Taking for a real type the appropiate real type and for a real type itself. More...
struct	Cmplxtype< std::complex< F > >
class	CoeffIterator< F, F >
	Iterator for an array of scalar coefficients. More...
class	CoeffIterator< F, Mapping< F, dim > >
	Iterator for an array of matrix coefficients. More...
class	CoeffIterator< F, Point< F, dim > >
	Iterator for an array of vector coefficients. More...
struct	Combtype
	Combined type. More...
struct	Combtype< F, std::complex< F > >
	Combined type Real * Cmplx = Cmplx. More...
struct	Combtype< std::complex< F >, F >
	Combined type Cmplx * Real = Cmplx. More...
class	ComplexFunction
	Complex function based on a real function (casting). More...
class	Compose
	Computes the product of two operators. More...
class	ComposeFormulaMatVec
	Computes the Matrix-vector product A * vf, where A is a matrix valued formula and vf a vector valued formula. More...
class	ComposeFormulaVecEntry
class	Connector
	An abstract class for elements of the topology. More...
class	Connector0
	A 0D element of the topology. More...
class	Connector1
	A 1D element of the topology. More...
class	Connector2
	A 2D element of the topology. More...
class	Connector3
	A 3D element of the topology. More...
class	ConnectorData
	Generalization of the class which store additional information for topological entities. More...
class	ConnectTwoMeshes
	Connected mesh of two given meshes where edges on both outer boundaries are connected. More...
class	ConstFormula
	Class for a constant formula. More...
class	Constrained
	Solves a linear system of equations subject to linear constraints. More...
class	ConvertMeshQuads
	Mesh converter. More...
class	CRSConvertable
	Base class for operators which can be converted to Sparse Row Storage (CRS) or Sparse Column Storage (CCS) More...
class	CurlHField_CircularCoil
class	CurvatureElementFormula
	Formula for the curvature or their derivatives on edges in 2D. More...
struct	Datatype
	Type of the data inside a container. More...
struct	Datatype< Mapping< F, dim > >
struct	Datatype< Point< F, dim > >
class	DDSolver
	Domain Decomposition Solver. More...
class	DDSpace
class	DefFile
class	DenseIWrapper
	Input wrapper for Concepts::DenseMatrices. More...
class	DenseMatrix
	Dense matrix. More...
class	DenseOWrapper
	Wrapper for a concepts::DenseMatrix<T>. More...
class	DiagonalMatrix
	Diagonal matrix. More...
class	DiagonalSolver
	A solver for diagonal matrices. More...
class	DiagonalSolverFabric
	Fabric class for `DiagonalSolver`. More...
class	DiffReactAsympCollDelta_0
class	DiffReactAsympCollDelta_1
class	DiffReactAsympCollFormula
class	DiffReactAsympCollGamma_0
class	DiffReactAsympCollGamma_1
class	DiffReactAsympCollModel
class	DiffReactAsympCollModel< F, 0, 0, G >
class	DiffReactAsympCollModel< F, 0, 1, G >
class	DiffReactAsympCollModel< F, 0, 2, G >
class	DiffReactAsympCollModel< F, 1, 0, G >
class	DiffReactAsympCollModel< F, 1, 1, G >
class	DiffReactAsympCollModel< F, 1, 2, G >
class	DiffReactAsympCollModel< F, 2, 1, G >
class	DiffReactAsympCollModel< F, 3, 1, G >
class	DiffReactAsympCollModel_Alpha0_Order0and1
class	DiffReactAsympCollModel_Alpha1_Order0and1
class	DiffReactAsympCollModel_Alpha1_Order2plus
class	DiffReactAsympCollModel_Alpha2_Order0
class	DiffReactAsympCollModel_Alpha2_Order1plus
class	DiffReactAsympCollModel_grad_U_alpha0and1
	The (t,S)-gradient of the asymptotic expansion solution $\tilde{U}^{\varepsilon,N}_\mathrm{int}(t,S)$ in the interior of the sheet for asymptotics alpha = 0 and alpha = 1. More...
class	DiffReactAsympCollModel_grad_U_alpha2
	The (t,S)-gradient of the asymptotic expansion solution $\tilde{U}^{\varepsilon,N}_\mathrm{int}(t,S)$ in the interior of the sheet for asymptotics alpha = 2. More...
class	DiffReactAsympCollModelgrad_U
class	DiffReactAsympCollModelgrad_U< order, 0, F >
class	DiffReactAsympCollModelgrad_U< order, 1, F >
class	DiffReactAsympCollModelgrad_U< order, 2, F >
class	DiffReactAsympCollModelSol_Cont
	Class for the solution of the asymptotic expansion of Diffusion-Reaction equation (collectively) for formulation which is continuous over the interface (only order 0 and 1). More...
class	DiffReactAsympCollModelSol_Discont
	Class for the solution of the asymptotic expansion of Diffusion-Reaction equation (collectively) for formulation which is continuous over the interface (only order 1). More...
class	DiffReactAsympCollModelSolBase
	Class for the solution of the asymptotic expansion of Diffusion-Reaction equation (collectively). More...
class	DiffReactAsympCollModelU
class	DiffReactAsympCollModelU< order, 0, F >
class	DiffReactAsympCollModelU< order, 1, F >
class	DiffReactAsympCollModelU< order, 2, F >
class	DiffReactAsympCollModelU_alpha0and1
	The asymptotic expansion solution $\tilde{U}^{\varepsilon,N}_\mathrm{int}(t,S)$ in the interior of the sheet for asymptotics alpha = 0 and alpha = 1. More...
class	DiffReactAsympCollModelU_alpha2
	The asymptotic expansion solution $\tilde{U}^{\varepsilon,N}_\mathrm{int}(t,S)$ in the interior of the sheet for asymptotics alpha = 2. More...
class	DiffReactAsympModelBase
	Base class for asymptotic expansion models of Diffusion-Reaction equation. More...
class	DiffReactAsympModelgrad_UBase
	Base class for the (t,S)-gradient of the asymptotic expansion solution in the interior of the sheet. More...
class	DiffReactAsympModelKraehenbuehl
class	DiffReactAsympModelOffset
	Offset function of the asymptotic expansion of Diffusion-Reaction equation as formula over the elements of the 2D space. More...
class	DiffReactAsympModelSimpleVector
	Vector of right hand side of the asymptotic expansion of Diffusion-Reaction equation as formula over the elements of the 2D space. More...
class	DiffReactAsympModelSol
	Class for the solution of the asymptotic expansion of Diffusion-Reaction equation (iterativly). More...
class	DiffReactAsympModelSolBase
	Base class for solutions of the asymptotic expansion of Diffusion-Reaction equation. More...
class	DiffReactAsympModelU
	The asymptotic expansion solution $U^i_\mathrm{int}(t,S)$ in the interior of the sheet. More...
class	DiffReactAsympModelUBase
	Base class for asymptotic expansion solution in the interior of the sheet. More...
class	DiffReactAsympModeluepsN
	The asymptotic expansion solution $u^{\varepsilon,N}_\mathrm{int}(x)$ , evaluated on a FE mesh with elements in the sheet. More...
class	DiffReactAsympModelUepsN
	The asymptotic expansion solution $U^{\varepsilon,N}_\mathrm{int}(t,s)$ in the interior of the sheet. More...
class	DiffReactAsympModeluepsN_grad
	The gradient of the asymptotic expansion solution $u^{\varepsilon,N}_\mathrm{int}(x)$ , evaluated on a FE mesh with elements in the sheet. More...
class	DiffReactAsympModelVector
	Vector of right hand side of the asymptotic expansion of Diffusion-Reaction equation as formula over the elements of the 2D space. More...
class	DimensionMismatch
	Exception class to express dimensions not matching. More...
class	Dirichlet
	Class for calculating and holding local coefficients per element which represent the dirichlet boundary condition. More...
class	DirichletElementFormula
	Dirichlet Data as element formula. More...
class	DivGradHField_CircularCoil
class	DomainDecomp
	Domain decomposition space. More...
class	DummySpace
	Space for a given dimension but without more functionality. More...
class	DynArray
	Container class: a dynamic array. More...
class	DynArrayBase
	Base class for DynArray for the non-template part. More...
class	DynArrayPage
	A page of a dynamic array. More...
class	EddyGeometry2D
	Abstract class for holding geometry and material for eddy current problems. More...
class	EddyGeometry2DRectImport
	Rectangular geometry, source current. More...
class	EddyGeometry2DRotateImport
	Geometry with rotational symmetric coil. More...
class	EddyGeometry2DRotational
	Rotational symmetric geometry, conductivity and source current. More...
class	EdgCorrFile
class	Edge
	An edge in the topology. More...
class	Edge1d
	A 1D cell: edge. More...
class	Edge2d
	A 1D cell: edge in 2D. More...
class	EdgeData
	Stores additional information on an edge, namely its cells and faces. More...
class	EdgeMesh
	Base class for edge meshes. More...
class	EdgeNd
	A 1D cell in any dimension: edge. More...
class	EdgesOfVertices
	Build a mapping from vertices (over their key) in a cell to the edges their belong to. More...
class	EdgRadiaFile
class	Element
	An abstract class for an element of a space. More...
class	ElementAndFacette
	Container for an element and one facette (edge or face). More...
class	ElementFormula
	Interface for a formula defined element by element. More...
class	ElementFormulaBoundary
	Element formula, which gives formula on the boundary. More...
class	ElementFormulaCompose
class	ElementFormulaContainer
class	ElementFormulaLiCo
class	ElementFormulaRotate2D
	Rotated element formula of a 2D vector (90° to right). More...
class	ElementFormulaTimesCurvature
class	ElementFormulaVector
	Vectorial formula created from a FE function. More...
class	ElementFormulaVector< 1, F, G, H >
	Scalar formula created from a FE function. More...
class	ElementFormulaVectorBase
	Base class for Formula created from a FE function. More...
class	ElementFunction
	An abstract class for a function in a FE space. More...
class	ElementGraphics
	Handles graphics output (to a file) of a specific element. More...
class	ElementGraphicsBase
	Base class for graphics output, which holds graphics types. More...
class	ElementMatrix
	Element matrix. More...
class	ElementMatrixBase
	Base class for element matrices. More...
class	ElementNotInDomainOfFormula
	Exception class to express that an inquired element is not in the domain. More...
class	ElementPair
	Gives access to a pair of elements. More...
class	ElementPairList
	Holds a list of `ElementPair` and allows to scan over this list. More...
class	ElementWithCell
	Element with cell. More...
class	EllipseMappingEdge2d
	2D element map for an ellipsoidal arc (not skewed) More...
class	ExceptionBase
	Base class for exceptions. More...
class	Ez4uException
	Exception class to express a problem in a ez4u input file. More...
class	FaceData
	Stores additional information on a face, namely its cells. More...
class	File
	Base class for File type recognition. More...
class	FileOpenError
	Indicates that there were problems in a file open operation. More...
class	FiveQuads
class	Formula
	Interface for a formula. More...
class	FormulaExpImag1D
	Formula for $u \mathrm{exp}(ik(x-x_0))$ . More...
class	FormulaExpImag2D
	Formula for $u \mathrm{exp}(ik(x-x_0))$ . More...
class	FormulaExpImag2DGrad
	Formula for gradient of a plane wave. More...
class	FormulaExpImag2DRadialDer
	Formula for radial derivative of $u \mathrm{exp}(ik(x-x_0))$ . More...
class	FormulaIncPlaneWaveSource
	Formula for $-a \Delta u_{inc} + b k^2 u_{inc}$ . More...
class	FormulaLiCo
	Linear combination of two formulae. More...
class	FormulaNormalOuterSP2D
	Computes the scalar product <n, vf> of the normal n with a vector valued formula vf, the result is a scalar formula in F. More...
class	FormulaPMLBoxRestriction
class	FormulaPMLCart
class	FormulaPMLPowerSigma
class	FormulaPMLPowerSigma2D
class	FormulaPMLPowerSigmaB2D
class	FormulaPMLRadia
	Class for PML in polar coordinates. More...
class	FormulaSyntaxError
	Exception indication that a formula contains a syntax error reported by the parser. More...
class	FortranException
	Exception indicating an error in a FORTRAN routine returning a non-zero `info` flag. More...
class	Frm_Product
	Class for a product of formula. More...
class	Frm_Sum
	Class for a sum of formula. More...
class	FrmE_Inverse
	Inverse of an element formula. More...
class	FrmE_NormalVector
	Element formula on 1D elements based on Edge2d returning the normal vector. More...
class	FrmE_PMLTransformation
class	FrmE_Product
	Product of two element formulas or an element formula and a factor. More...
class	FrmE_ScalarProductNormalEdge2d
	Computes the scalar product <n, vf> of the normal n with a vector valued formula vf, the result is a scalar formula in F. More...
class	FrmE_Sum
	Class for a sum of element formulas. More...
class	FrmE_TangentialVector
	Element formula on 1D elements based on Edge2d returning the tangential vector (left of normal vecotr). More...
class	Function
	Abstract class for a function. More...
struct	GeneralMapping
	Introduction of a mapping type which is Real or Cmplx for dimension 1 and Mapping<Real,dim> or Mapping<Cmplx,dim> for higher dimensions. More...
struct	GeneralMapping< F, 1 >
struct	GeneralPoint
	Introduction of a point type which is Real or Cmplx for dimension 1 and Point<Real,dim> or Point<Cmplx,dim> for higher dimensions. More...
struct	GeneralPoint< F, 1 >
class	GlobalPostprocess
	Global Postprocessing. More...
class	GMRes
	Solves a system of linear equations with general minimal residuals (GMRes). More...
class	GMResFabric
	Fabric class for generalized minimal residual: `GMRes`. More...
class	HashedSparseMatrix
	A matrix in sparse storage using hashes. More...
class	HashMap
class	Hex3dSubdiv2x
	Subdivision strategy for hexahedrons which generates 2 children. More...
class	Hex3dSubdiv2y
	Subdivision strategy for hexahedrons which generates 2 children. More...
class	Hex3dSubdiv2z
	Subdivision strategy for hexahedrons which generates 2 children. More...
class	Hex3dSubdiv4x
	Subdivision strategy for hexahedrons which generates 4 children. More...
class	Hex3dSubdiv4y
	Subdivision strategy for hexahedrons which generates 4 children. More...
class	Hex3dSubdiv4z
	Subdivision strategy for hexahedrons which generates 4 children. More...
class	Hex3dSubdiv8
	Subdivision strategy for hexahedrons which generates 8 children. More...
class	Hex3dSubdivision
	Interface for geometrical subdivision strategies for hexahedrons. More...
class	Hexahedron
	A hexahedron in the topology. More...
class	Hexahedron3d
	A 3D cell: hexahedron. More...
class	HexSubdiv2x
	Subdivision strategy for hexahedrons which generates 2 children perpendicular to the x direction. More...
class	HexSubdiv2y
	Subdivision strategy for hexahedrons which generates 2 children perpendicular the y direction. More...
class	HexSubdiv2z
	Subdivision strategy for hexahedrons which generates 2 children perpendicular to the z direction. More...
class	HexSubdiv4x
	Subdivision strategy for hexahedrons which generates 4 children along the x direction. More...
class	HexSubdiv4y
	Subdivision strategy for hexahedrons which generates 4 children along the y direction. More...
class	HexSubdiv4z
	Subdivision strategy for hexahedrons which generates 4 children along the z direction. More...
class	HexSubdiv8
	Subdivision strategy for hexahedrons which generates 8 children. More...
class	HexSubdivision
	Interface for topological subdivision strategies for hexahedrons. More...
class	HField_CircularCoil
class	HRefinement
	Uniform h refinement. More...
class	ImagPart
	Function as imaginary part of an complex function. More...
class	Import2dMesh
class	Import2dMeshBase
	Imports 2D mesh with triangles and quadrilaterals (possibly mixed). More...
class	Import2dMeshEz4u
	Imports 2D mesh with triangles(currently not supported) and quadrilaterals (possibly mixed) from mesh generator ez4u. More...
class	Import2dMeshGeneral
class	Import3dMesh
	Imports 3D mesh with tetrahedra and hexahedra. More...
class	Import3DTetMesh
	Importer for tetrahedral meshes in notation which was used in [1]. More...
class	ImportMesh
	Base class for reading a mesh from a file. More...
struct	Index
	Stores a number of indices in a ordered fashion. More...
class	IndexNotExisting
	Exception class to express that an index in a dynamic array does not exist. More...
struct	IndexRange
	Class for a range of global indices. More...
class	InfiniteEdge
	An infinite edge in the topology, which possess only one vertex as the other lies in the infinite. More...
class	InfiniteQuad
	A infinite quadrilateral in the topology, which possess one Edge and two InfiniteEdges since one edge lies in the infinite. More...
class	InfiniteQuad2d
	A 2D cell: infinite quadrilateral. More...
class	InfiniteRect2d
	A 2D cell: infinite rectangle. More...
class	InfQuadSubdiv2V
	Subdivision strategy for infinite quadrilaterals which generates two children which are infinite quadrilaterals as well. More...
class	InfQuadSubdivision
	Interface for topological subdivision strategies for infinite quadrilaterals. More...
class	InnerOuterBoundary2d
	Base class for mesh classes in 2D which defines its outer boundary and inner boundaries. More...
class	InOutParameters
	Holds parameters in hashes. More...
class	InputAdaptiveModels
	Helps for reading input parameters for single solving with AdaptiveModels. More...
class	InputDomains
	Helps for reading input parameters for single problem with domains. More...
class	InputEddy2DGeometries
	Helps for reading input parameters for Eddy2D geometries. More...
class	InputFile
	Helps for reading the input parameter of file name. More...
class	InputParameter
	Abstract class for carrying information, which helps for reading input parameters from command line. More...
class	InputParser
	Parses an input file and extracts parameters. More...
class	InputSlot
	Helps for reading input parameters for single problem with slot. More...
class	IntegrationCell
	Cell over which can be integrated. More...
class	InverseMappingEdge2d
	In existant 2D element map for an edge the direction in the edge are inversed.x. More...
class	InverseVertexQuadSector2d
	A 2d inverse mapping from a sector to reference element. More...
class	Joiner
	Joiner class with multiple successors, i.e. More...
class	Karniadakis
	Part of the multidimensional expansion bases for the shape functions of Karniadakis and Sherwin. More...
class	KarniadakisCoeffs
class	Key
	Key class. More...
class	Laguerre
	Laguerre polynomials. More...
class	LaguerreBasis
	Polynomial functions which gives a basis of the semi-infinite intervals after multiplication with factor $exp(-x/2)$ . More...
class	LapackChol
	Linear solver using Lapack subroutine DPOSV. More...
struct	Level
	Level information used for multidimensional hp FEM. More...
class	LiCo
	Linear combination of two operators. More...
class	LiCoI
	Linear combination of an operator with the identity. More...
class	Line
	Mesh for the interval of the real axis. More...
class	LinearForm
	Abstract class for a linear form. More...
class	ListScan
	Scanner for a list. More...
struct	ltidx
struct	ltstr
class	Map1d
	An abstract class for a 1d map. More...
class	Map2d
	An abstract class for a 2d map. More...
class	Map3d
	An abstract class for a 3d map. More...
class	MapEdge1d
	A 1D element map for an edge. More...
class	MapHexahedron3d
	A 3D element map for a hexahedron. More...
class	MapParallelepiped3d
	A 3D element map for a Parallelepiped. More...
class	Mapping
	Basic class for a 2D or 3D map. More...
class	MappingEdge2d
	A 2D element map for an edge. More...
class	MappingParallelEdge2d
	2D element map for an edge parallel to another one. More...
class	MappingQuad2d
	A 2D element map for a quadrilateral. More...
class	MappingQuadEdge2d
	2D element map for an edge as part of an quad. More...
class	MappingStraightEdge2d
	A 2D element map for an edge of a straight line. More...
class	MappingTriangle2d
	A 2D element map for a triangle. More...
class	MapQuad2d
	A 2D element map for a quadrilateral given by a formula. More...
class	MapTetrahedron3d
	A 3D element map for a tetrahedron. More...
class	MapTriangle2d
	A 2D element map for a triangle. More...
class	MapTriangle3d
	A 3D element map for a triangle. More...
class	MatfileInput
class	MatfileOutput
	Matfile memory tool. More...
class	MatlabMatfile
	This class provides a wrapper for the MAT-file Library, which is part of the MATLAB distribution. More...
class	MatlabMatfileError
	Exception class to express dimensions not matching. More...
class	Matrix
	Abstract class for an operator. More...
class	MatrixElementFormula
	Element formula returning a matrix. More...
class	MatrixNotBuilt
	Indicates that a needed matrix wasn't build yet. More...
class	MaxwellBoundary
	Class for holding boundary type of Maxwell's problems. More...
class	MaxwellModel
	Abstract class for Maxwell's problems. More...
class	Mesh
	An abstract class for meshes. More...
class	Mesh1
	An abstract class for 1D meshes. More...
class	Mesh2
	An abstract class for 2D meshes. More...
class	Mesh2withBoundary
	Base class for mesh classes in 2D which defines its outer boundary and inner boundaries. More...
class	Mesh3
	An abstract class for 3D meshes. More...
class	MissingFeature
	Exception class to express a missing feature. More...
class	MissingParameter
	Indicates that a requested parameter is not present. More...
class	Model
	Base class for a model. More...
class	ModelControl
class	ModelControl< hp2D::Eddy2D_E >
class	ModelControl< hp2D::Maxwell2D_E >
class	ModelControl< hp2D::Maxwell2D_H >
class	ModelControl< hp2D::Maxwell2D_H_Base >
class	ModelControl< hp2D::Maxwell2D_H_DD >
class	ModelControlBase
	Base class for controlling a model. More...
class	ModelNotSolved
	Indicates that a model wasn't solved yet. More...
class	MultiArray
	Container typename for multidimensional Array which is based on std::map. More...
class	MultiArray< 1, T >
	Container typename for multidimensional Array which is based on std::map. More...
class	MultiEntrance
class	MultiEntrance< 1, T >
class	MultiIndex
class	Multiple
	Multiple of an operator. More...
class	multiplies
class	MutableMesh1
	Class for holding a general mutable mesh of line elements where cells can be added. More...
class	MutableMesh2
	Class for holding a general mutable mesh of 2D cell where cells and other 2D meshes can be added. More...
class	MutableMeshBase
	Base class for mutable meshes. More...
class	NegativeJacobian
	Exception which indicates that a negative Jacobian was found. More...
class	Neumann
	Abstract class for the Neumann boundary term. More...
class	NoConvergence
	Exception indicating that the solver did not converge up to the desired accuracy in the given number of iterations. More...
class	NotValidDof
	Exception class to express that an inquired dof is not valid. More...
class	NQuads
class	NRLSolver
struct	null_deleter
struct	number
	Name traits for number types. More...
struct	number< double >
	Name traits for the number type `Real`. More...
struct	number< long double >
	Name traits for the number type `Real`. More...
struct	number< Mapping< F, dim > >
struct	number< Point< F, dim > >
struct	number< std::complex< double > >
	Name traits for the number type `Cmplx`. More...
struct	number< std::complex< long double > >
	Name traits for the number type `Cmplx`. More...
class	OpAdd
class	Operation
class	Operator
	Abstract class for an operator. More...
class	OpMult
class	OpRecipr
class	Orders
	Class combining polynomial order and number of quadrature points. More...
class	OrdersBase
	Class containing number of quadrature points. More...
class	OrigamiCube2D
class	OutputMatlab
	Class for output of objects to matlab. More...
class	OutputMatlab< Array< F > >
	Specialisation of class `OutputMatlab<F>` for output of objects to matlab to `Array<F>` More...
class	OutputMatlab< bool >
class	OutputMatlab< char * >
	Class for output of C strings. More...
class	OutputMatlab< F * >
	Class for output of pointers to matlab. More...
class	OutputMatlab< Mapping< F, dim > >
	Class for output of 2D and 3D matrices to matlab. More...
class	OutputMatlab< Point< F, dim > >
	Class for output of 2D and 3D vectors to matlab. More...
class	OutputMatlab< std::map< F, G > >
class	OutputMatlab< std::queue< F > >
class	OutputMatlab< std::set< F > >
class	OutputMatlab< std::string >
	Class for output of C++ strings. More...
class	OutputMatlab< std::vector< F > >
class	OutputMatlab< StiffArray< dim, F > >
	Specialisation of class `OutputMatlab<F>` for output of objects to matlab to `StiffArray<dim,F>` More...
class	OutputOperator
	Class providing an output operator. More...
class	OutputTecplot
	Class for output of objects to tecplot. More...
class	OutputTecplot< Array< F > >
class	OutputTecplot< Point< F, dim > >
	Class for output of 2D and 3D vectors to matlab. More...
class	OutputTecplot< std::complex< F > >
class	ParabelMappingEdge2d
	2D element map for an parabel arc. More...
class	Parallelepiped3d
	A 3D cell: parallelepiped. More...
class	Pardiso
	Sparse direct solver for symmetric and unsymmetric matrices. More...
class	PardisoFabric
	Fabric class for `Pardiso`. More...
class	ParsedFormula
class	ParsedFormula< Cmplx >
class	ParsedFormula< Real >
class	ParsedFormulaBase
	Parses the given string and evaluates it on request. More...
class	ParseInputString
class	ParseObjectFromString
	Class for parsing objects like "Circle(1.0)" or "Edge(1,2)" from a string. More...
class	ParseThinSheetThickness
class	PartMappingEdge2d
	Part of a edge mapping. More...
class	PartMappingQuad2d
	Part of a map of a quadrilateral. More...
class	Permutation
	Permutation operator. More...
class	PETSc
	Interface to the iterative solvers of the PETSc library. More...
class	PETScFabric
	Fabric class for `PETSc` solvers. More...
class	PETScMat
	Interface to the sparse matrices from PETSc. More...
class	PiecewiseConstDynArrayFormula
	Piecewise constant function defined by attributes, base on dynamic array. More...
class	PiecewiseConstFormula
	Piecewise constant function defined by the attribute of a cell. More...
class	PiecewiseConstImportFormula
	Piecewise constant function defined by attributes, imported from a file. More...
class	PiecewiseElementFormula
	Piecewise defined function defined by attributes. More...
class	PiecewiseFormula
	Piecewise defined function defined by attributes. More...
class	PiecewiseFormula0
	Piecewise defined function, which consists of a formula and a default value. More...
class	PiecewiseFormulaBase
	Piecewise defined function on a number of cells. More...
class	PiecewiseFormulaCombine
	Combines two piecewise defined formulas with an operation, e.g. More...
class	PiecewiseFormulaFun
	Piecewise defined function as an analytical function of another piecewiese defined function. More...
class	PiecewiseFormulaVector
class	PiecewiseFormulaVector< 1, F, G, H >
class	PiecewiseFormulaVectorBase
	Base class for piecewise defined formula, which are a function of a FE function. More...
class	PListScan
	Scanner for a list of pointers. More...
class	Point
	Basic class for a Point or a vector. More...
class	PointerToEmptyElementFormula
	Exception class to express that the RCP pointer points to 0. More...
class	PointInCell
	Define a point inside a geometrical cell by its connector and the coordinate in the reference cell. More...
class	PointInCell< 1 >
class	PolyCoeff
class	Pool
	Pool for blockwise memory allocation. More...
class	PrecondSolverFabric
	Abstract fabric class for linear solvers with preconditoner. More...
class	PRefinement
	Uniform p refinement. More...
class	ProcessParameter
	Reads command line. More...
class	PStlVectorScan
	Scanner for a STL container std::vector of pointers. More...
class	QR_Q
	Gives min(N,M) by min(N,M) - Q matrix of QR decomposition of a M by N non sparse matrix A. More...
class	Quad
	A quadrilateral in the topology. More...
class	Quad2d
	A 2D cell: quadrilateral. More...
class	Quad2dSubdiv2H
	Subdivision strategy for quadrilaterals which generates two children. More...
class	Quad2dSubdiv2V
	Subdivision strategy for quadrilaterals which generates two children. More...
class	Quad2dSubdiv4
	Subdivision strategy for quadrilaterals which generates four children. More...
class	Quad2dSubdivision
	Interface for geometrical subdivision strategies for quadrilaterals. More...
class	QuadGrid2D
	Mesh for with a given number of quadrilaterals. More...
class	Quadrature
	Basic class for numerical integration. More...
class	QuadratureRule
	Quadrature rule for numerical integration. More...
class	QuadratureRuleDynamic
	Base class for quadrature rules with dynamically allocated storage for the weights and abscissas. More...
class	QuadratureRuleGaussJacobi
	Gauss Jacobi quadrature rule not including both endpoints. More...
class	QuadratureRuleGaussLobatto
	Gauss Lobatto quadrature rule including both endpoints. More...
class	QuadratureRuleTrapeze
class	QuadRuleFactory
	Class for creation of a quadrature rule. More...
class	QuadSubdiv2H
	Subdivision strategy for quadrilaterals which generates two children. More...
class	QuadSubdiv2V
	Subdivision strategy for quadrilaterals which generates two children. More...
class	QuadSubdiv4
	Subdivision strategy for quadrilaterals which generates four children. More...
class	QuadSubdivision
	Interface for topological subdivision strategies for quadrilaterals. More...
class	RCP
	Reference-counting pointer. More...
class	RCP< const ElementFormula< F, G > >
class	RCP< const Formula< F > >
class	RealPart
	Function as real part of an complex function. More...
struct	Realtype
	Taking for a complex type the appropiate real type and for a real type itself. More...
struct	Realtype< Array< F > >
struct	Realtype< Mapping< F, dim > >
struct	Realtype< Point< F, dim > >
struct	Realtype< std::complex< F > >
class	RelativeCells
	Class which holds information about the mesh hierarchy and how the point in the reference cell changes from level to level. More...
class	ResourceMonitor
	Timer and resource monitor. More...
class	ResultsTable
	Organizes the results in the hashes from InOutParameters in a nice table. More...
class	Scan
	An abstract class for scanning a mesh (a set of cells) or a space (a set of elements). More...
class	Scan< Cell1 >
	A scanner for a 1D mesh. More...
class	Scan< Cell2 >
	A scanner for a 2D mesh. More...
class	Scan< Cell3 >
	A scanner for a 3D mesh. More...
class	Scan< Connector0 >
	A scanner for 0D connectors on the processor intersection (cap) More...
class	Scan< Connector1 >
	A scanner for 1D connectors on the processor intersection (cap) More...
class	Scan< Connector2 >
	A scanner for 2D connectors on the processor intersection (cap) More...
class	Scan< constraints::Element< F > >
class	Scan< ElementWithCell< F > >
class	Scan< hp1D::Element< F > >
	Scanner of hp1D::Element. More...
class	Scan< hp2D::Element< F > >
	Scanner of hp2D::Element. More...
class	Scan< hp3D::Element< Real > >
class	Scan< linDG3D::FvdgElement >
	Scanner over tetrahedral elements in FV/DG-space. More...
class	Scan< linearFEM::Element >
class	Scan< linearFEM::Line >
class	Scan< linearFEM::Quad >
class	Scan< linearFEM::Tetrahedron >
class	Scan< linearFEM::Triangle >
class	Scan< TriangleP2 >
class	Scan< vectorial::Element< F > >
class	SchurCompl
	Schur complement. More...
class	Semantics
	An abstract function class to query attributes. More...
class	Sequence
	Sequence with operations, output operator, and method of the particular element types. More...
class	Sequence< bool >
class	Sequence< Connector0 * >
class	Sequence< Connector1 * >
class	Sequence< Connector2 * >
class	Sequence< const Connector0 * >
class	Sequence< const Connector1 * >
class	Sequence< const Connector2 * >
class	Sequence< const Key * >
class	Set
	Set with operations, output operator, and method of the particular element types. More...
class	Set< Attribute >
class	Set< Connector * >
class	Set< Connector0 * >
class	Set< Connector1 * >
class	Set< Connector2 * >
class	Set< const Connector * >
class	Set< const Connector0 * >
class	Set< const Connector1 * >
class	Set< const Connector2 * >
class	Set< const Key * >
class	Set< IndexRange >
class	ShapeFunction1D
	Abstract class for 1D shape function. More...
class	SharedJacobianAdj
	Shared data for bilinear forms on vectorial spaces, like hp2D::RotRot and hp2D::DivDiv. More...
class	SharedJacobianDet
	Shared data for bilinear forms on vectorial spaces, like Identity. More...
class	SimpleLine
class	SMatrix1D
	One dimensional S matrix. More...
class	SMatrixBase
	An abstract class for an S matrix. More...
class	SMatrixBlock
	S matrix in block form for tensorised shape functions. More...
class	SMatrixCompose
	Composing S matrices. More...
class	SMatrixGeneralTensor
	S matrix for elements in dimensions 2 and 3 with tensorized shape functions, with arbitrary number of shape functions in each direction. More...
class	SMatrixTensor
	S matrix for elements in dimensions 2 and 3 with tensorized shape functions. More...
class	SolverFabric
	Abstract fabric class for linear solvers. More...
class	Space
	Abstract class for a space. More...
class	SpaceDebug
	Class for output of all elements of a class, good for debugging. More...
class	SpaceHelper
	Class which helps to build the T Columns of the elements of a space, with the help of a space pre builder. More...
class	SpaceNotBuilt
	Indicates that the space on which a function was called was not yet correctly built. More...
class	SpaceOnCells
	Abstract class for a space. More...
class	SpacePreBuilder
class	SparseIWrapper
	Input wrapper for matrices. More...
class	SparseMatrix
	Sparse matrix. More...
class	SparseOWrapper
	Wrapper for a concepts::SparseMatrix<T>. More...
class	SphericalFormula
	Formula in spherical polar coordinates. More...
class	Spooles
	Sparse direct solver for symmetric and unsymmetric matrices. More...
class	Square
	Mesh for with one quadrilateral. More...
class	Square2
	Mesh for with two quadrilaterals. More...
class	Squared
	The square of a element function (componentwise) More...
class	SquareOneInfiniteRect
	Mesh consisting of two cells, one Quad2d and one InfiniteRect2d. More...
class	SquareTwoInfiniteRects
	Mesh consisting of three cells, one Quad2d and two InfiniteRect2d. More...
class	Stacktrace
	Dumps a stack trace using gdb. More...
class	StiffArray
	An array of objects of fix length, defined by template parameter `dim`. More...
class	StiffArray< 0, F >
	Stiff Array of zero dimension makes no sense. More...
class	StiffArray< 1, F >
class	StlVectorScan
	Scanner working on std::vector elements. More...
class	StrategyChange
	Exception indicating that changing the subdivision strategy is not allowed (but was tried anyway). More...
class	Subdivision
	Common base class for QuadSubdivision and HexSubdivision. More...
class	SubMatrixN
	Abstract class for an operator, which is a sub matrix of another matrix. More...
class	Subspace
	Class for holding an offset of global indices of space. More...
class	SubspaceHelper
class	SubVector
	A sub vector, defined by another vector and an index set. More...
class	SumOfPowers
class	SuperLU
	Direct sparse solver for unsymmetric matrices. More...
class	SuperLUFabric
	Fabric class for `SuperLU`. More...
class	TColumn
	A column of a T matrix. More...
class	TColumnBlock
	A column of a T matrix. More...
class	TColumnSet
	A set of TColumns and polynomial degrees, sorted by a key, eg. More...
class	TColumnTensor
	A column of a T matrix. More...
class	Tetrahedron
	A tetrahedron in the topology. More...
class	Tetrahedron3d
	A 3D cell: tetrahedron. More...
class	ThinEllipseMeshes2d
class	ThinMeshes2d
	Class holding a mesh with a thin sheet, the respective limit mesh and the relations between these two meshes. More...
class	ThinSheet
	Abstract class for mesh with thin sheet of constant thickness d. More...
class	ThinSheetCell
	Abstract class for cell inside a thin sheet of thickness d. More...
class	ThinSheetCell< 2 >
	Abstract class for 2D cell inside a thin sheet of thickness d. More...
class	ThinSheetDiffussionFunction
	Abstract class for functions in thin sheet with PDE $-\Delta u + cu = 0$ . More...
class	ThinSheetDiffussionFunction0
	Class for functions in thin sheet with PDE $-\Delta u + cu = 0$ . More...
class	ThinSheetEdges
class	ThinSheetEllipse
	Mesh of a ellipsoidal thin sheet inside a circle. More...
class	ThinSheetEllipse2
	Mesh of a ellipsoidal thin sheet inside a circle. More...
class	ThinSheetFunction
	Abstract class for functions in a thin sheet. More...
class	ThinSheetParabel
	Mesh of a parabular thin sheet inside a circle. More...
class	ThinSheetQuad2d
	A 2D cell: quadrilateral in thin sheet of constant thickness. More...
class	ThinSheetRule
class	ThinSheetRuleCoord
	The rule for the top of a sheet, which is in the direction of one of the coordinate axes. More...
class	ThinStraightMeshes2d
class	ThreeQuads
	Mesh for with three quadrilaterals. More...
class	ThreeQuadsdym
class	TIndex
	T matrix for linear and regular elements. More...
class	TMatrix
	A T matrix in sparse notation. More...
class	TMatrixBase
	An abstract class for a T matrix. More...
class	Transpose
	The transpose of another matrix. More...
class	Triangle
	A triangle in the topology. More...
class	Triangle2d
	A 2D cell: triangle. More...
class	Triangle3d
	A 3D cell: triangle. More...
class	TrivExtendRestrict
	Trivial extension and restriction operator. More...
class	Umfpack
	Sparse direct solver for unsymmetric matrices. More...
class	UmfpackFabric
	Fabric class for `Umfpack`. More...
class	UniformlyRefinedMesh2
	Wrapper class refining an existing 2d mesh uniformly. More...
class	UnitNd
	A vector of dimension dim and length 1. More...
class	VecOperator
	Abstract class for an operator acting on vectors only, not arbitrary functions. More...
class	Vector
	A vector. More...
class	VectorElementFormula
class	VectorElementFormula< F, 2, G >
class	VectorElementFormula< F, 3, G >
class	VectorElementFormulaBase
	Element formula returning a vector. More...
class	VectorFormula
	Element formula returning a vector. More...
class	Vertex
	A vertex in the topology. More...
class	VertexData
	Stores additional information on a vertex, namely its cells and edges. More...
class	VertexQuad2d
	A 2D element map for a quadrilateral given by a the four vertices. More...
class	VertexTriangle2d
	A 2D element map for a triangle. More...
class	WrongRelations
	Exception class to express an illegal relation within topological lists. More...
class	Z2
	Binary group (algebraic): only the values 0 and 1 are represented. More...
class	Z3
	Algebraic group with three elements: 0, 1 and 2. More...
class	Z4
	Algebraic group with four elements: 0, 1, 2 and 3. More...
class	ZylindricalFormula
	Formula in zylindrical coordinates. More...
Typedefs
typedef std::complex< Real >	Cmplx
	Type for a complex number. It also depends on the setting of Real.
typedef Point< Cmplx, 2 >	Cmplx2d
typedef Point< Cmplx, 3 >	Cmplx3d
typedef Mapping< Cmplx, 2 >	MapCmplx2d
typedef Mapping< Cmplx, 3 >	MapCmplx3d
typedef Mapping< Real, 2 >	MapReal2d
typedef Mapping< Real, 3 >	MapReal3d
typedef double	Real
	Type normally used for a floating point number.
typedef Point< Real, 2 >	Real2d
typedef Point< Real, 3 >	Real3d
typedef Scan< Cell1 >	Scan1
	A scanner for a 1D mesh.
typedef Scan< Cell2 >	Scan2
	A scanner for a 2D mesh.
typedef Scan< Cell3 >	Scan3
	A scanner for a 3D mesh.
typedef Scan< Connector0 >	ScanCntr0
typedef Scan< Connector1 >	ScanCntr1
typedef Scan< Connector2 >	ScanCntr2
typedef signed int	sint
	Abbreviation for signed int.
typedef unsigned char	uchar
	Abbreviation for unsigned char.
typedef UnitNd< 2 >	Unit2d
typedef UnitNd< 3 >	Unit3d
typedef unsigned short	ushort
	Abbreviation for unsigned short.
Enumerations
enum	intRule { GAUSS_LOBATTO = 0, GAUSS_JACOBI = 4, TRAPEZE = 5 }
	Types of integration rules to choose from. More...
Functions
template<class F , int dim>
Mapping< F, dim > &	adjugate (Mapping< F, dim > &m)
template<class F , int dim>
Mapping< F, dim >	adjugate (const Mapping< F, dim > &m)
template<class F , class G >
Sequence< G * >	allConnectors (const F &cntr, G (F::fun)(uint) const)
	Return all connectors of a particular type of another connector, e.g.
template<class F , class G >
void	allConnectors (const F &cntr, G (F::fun)(uint) const, Set< G * > &set)
	Return all connectors of a particular type of another connector, e.g.
template<class F , class H , class I >
void	apply (Operator< F > &op, const Matrix< H > &mX, Matrix< I > &mY)
	Multiplication with a matrix.
Real	besselJ0 (const Real x)
Real	besselJ1 (const Real x)
Real	besselJn (const Real x, const int n)
Real	besselY0 (const Real x)
Real	besselY1 (const Real x)
Real	besselYn (const Real x, const int n)
void	buildEdgeMesh (Scan2 *sc, const concepts::Set< uint > attrib, MutableMeshBase &emsh)
	Construct a mesh of edges of a 2D mesh w.r.t.
void	chebychevPoints (concepts::Array< Real > &p)
	Zeros of Chebychev polynomials in [-1,1].
template<class F >
void	convertCCS_rowSorting (F &m, typename F::type a, int asub, int *xa)
	Method converts a matrix of type `F` to Sparse Column Storage (CRS) format.
template<class F >
void	convertCRS_rowSorting (F &m, typename F::value_type a, int asub, int *xa)
	Method converts a matrix of type `F` to Sparse Row Storage (CRS) format.
template<class F , int dim>
F	determinant (const Mapping< F, dim > &m)
template<class F >
Real	diffReactAsympModelPowerLoss (Real c0, Space< Real > *spc, DiffReactAsympModelUepsN< F > &UepsN)
	Computes the power loss from the asymptotic expansion solution `u_int` of order `order` for a thin sheet of thickness `d`.
template<class F >
Real	diffReactAsympModelPowerLoss (Real c0, hp1D::Element< Real > &elm, DiffReactAsympModelUepsN< F > &UepsN)
	Computes the power loss from the asymptotic expansion solution `u_int` of order `order` for a thin element of thickness `d`.
std::string	ensureEnding (const std::string &filename, const std::string ending)
	Returns a string with particular ending.
template<class exc >
exc	exception_set_fields (exc e, const std::string &file, const unsigned int line, const std::string &function, const std::string &excName)
	Sets fields on exception and throws it.
template<class exc >
void	exception_throw_assert (const std::string &file, int line, const std::string &function, const std::string &exc_name, const std::string &cond, exc e)
	Sets the fields of an assertion and throws it.
void	GaussJacobiAbscWght (double x, double w, const uint p)
	Computes and returns the integration weights and abscissas for the Gauss Jacobi integration.
void	GaussLobattoAbscWght (double x, double w, const uint p, const uint j=0)
	Computes and returns the integration weights and abscissas for the Gauss (Jacobi) Lobatto integration.
void	GaussRadauAbscWght (double x, double w, const uint p, const uint j=0)
	Computes and returns the integration weights and abscissas for the Gauss Radau Jacobi integration.
std::pair< ThinMeshes2d , PiecewiseFormulaBase< Real > >	generateThinMeshes2dFromInput (const InOutParameters input, bool verbose=false)
	Generates thin meshes from a given parameter list, i.e.
std::string	getDirectory (const std::string str)
	Returns the directory of a given full filename.
std::string	getFilename (const std::string str)
	Returns the filename (with ending) of a given full filename.
std::string	getFilenamePrefix (const std::string str)
	Returns the prefix of a given full filename, e.g.
Import2dMeshGeneral *	import2dMeshGeneralFromInput (const InOutParameters input, bool verbose=false)
	Loads a mesh from a paramater list.
template<typename G >
Real	integrate (const Element< G > &elm)
	Returns the area of the cell belonging to the element `elm`.
template<typename F , typename G >
F	integrate (const ElementWithCell< G > &elm, const ElementFormula< F, G > &frm, const Real t=0.0, IntegrationCell::intFormType form=IntegrationCell::ZERO)
	Returns the integral of the element formula `frm` over the cell belonging to the element `elm`.
template<class F , typename G >
F	integrate (SpaceOnCells< G > &spc, const ElementFormula< F, G > &frm, const Real t=0.0, IntegrationCell::intFormType form=IntegrationCell::ZERO)
	Returns the integral over space `spc` of the formula or element formula `frm` at time `t`.
template<class F , int dim>
Mapping< F, dim >	inverse (const Mapping< F, dim > &m)
template<class F >
F &	inverse (F &f)
template<class F >
F	inverse (const F &f)
template<class F , int dim>
Mapping< F, dim > &	inverse (Mapping< F, dim > &m)
void	JacobiDerivatives (const double alf, const double bet, const int maxn, const double x, const int m, const double p, double *q)
	Computes the values of the derivatives of the Jacobi polynomials.
void	JacobiPol (const double alf, const double bet, const int maxn, const double x, const int m, double p)
	Computes the values of the Jacobi polynomials.
void	JacobiZeros (double *x, int p, double alf, double bet)
	Computes the zeros of the Jacobi polynomials $P_{p}^{(\alpha,\beta)}(x)$ .
template<typename F , typename G >
Real	L2product (const ElementWithCell< G > &elm, const ElementFormula< F, G > &u, const ElementFormula< Real > *c=0, const Real t=0.0, IntegrationCell::intFormType form=IntegrationCell::ZERO)
	Returns the L2 product or with `c` weighted L2 product of an element formula `u` over the cell belonging to the element `elm`.
template<class F , typename G >
Real	L2product (SpaceOnCells< F > &spc, const G &u, const ElementFormula< Real > *c=0, const Real t=0.0, IntegrationCell::intFormType form=IntegrationCell::ZERO)
	Returns the L2 product or with `c` weighted L2 product over space `spc` of the formula or element formula `u` at time `t`.
void	LinearConvolution (const Real X, const Real Y, Real *Z, int lenx, int leny)
	Routine peforms linear convolution by straight forward calculation.
template<class F >
Array< F >	makeArray (uint n, const F &first,...)
	Creates an array of length from a comma separated list of values.
template<class F , class G >
void	makeArray (const F &cell, const Array< Real > &p, G(F::*fun)(Real) const, Array< G > &array)
	Creates an array `array` by applying an function `fun` of a cell `cell` for each value `p`.
template<class F , class G >
void	makeArray (const F &cell, const Array< Real > &pX, const Array< Real > &pY, G(F::*fun)(Real, Real) const, Array< G > &array)
	Creates an array `array` by applying an function `fun` of a cell `cell` for each combination of the values `pX` and `pY`.
template<class T >
RCP< const T >	makecRCP_weak (T *x)
template<class T >
RCP< T >	makeRCP (T *x)
	Function to create a RCP which deletes the object when no RCP points on it anymore.
template<class T >
RCP< T >	makeRCP_weak (T *x)
	Function to create a RCP without deleting the object in the destructor.
template<class F >
Sequence< F >	makeSequence (uint n, const F &first,...)
	Creates an sequence of length from a comma separated list of values.
template<class F >
Set< F >	makeSet (uint n, const F &first,...)
	Creates an array of length from a comma separated list of values.
int	match (const Connector1 &edg, const Connector0 &vtx, int &idx)
	Checks, if a edge has a vertex.
int	match (const Connector1 &edg0, const Connector1 &edg1, int idx[])
	Checks, if two edges has a common vertex.
template<class F , class G , class H >
void	matrixMultiplyRowSorting (const F &factL, const G &factR, Matrix< H > &dest)
	Multiplies two matrices, which deliver at least a row sorted iterator, and adds (!) the result to a third matrix.
template<typename F , typename G >
void	memorycpy (F dest, const G src, size_t n)
	Copies `n` entries from `src` to `dest` (faster than `std::memcpy`)
template<class F >
F *	newField (uint nr)
	Reserve memory for a field of type `F` and returns the pointer to first entrance.
template<class _Tp , class _RefL , class _PtrL , class _RefR , class _PtrR >
bool	operator!= (const _Matrix_iterator_base< _Tp, _RefL, _PtrL > &__x, const _Matrix_iterator_base< _Tp, _RefR, _PtrR > &__y)
template<class _Tp , class _Ref , class _Ptr >
bool	operator!= (const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &__x, const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &__y)
ElementFormulaContainer< Cmplx >	operator* (const ElementFormulaContainer< Cmplx > frm1, const ElementFormulaContainer< Cmplx > frm2)
ElementFormulaContainer< Real2d >	operator* (const ElementFormulaContainer< Real2d > frm1, const ElementFormulaContainer< Real > frm2)
ElementFormulaContainer< Cmplx2d >	operator* (const ElementFormulaContainer< Real2d > frm1, const ElementFormulaContainer< Cmplx > frm2)
ElementFormulaContainer< Real2d >	operator* (const ElementFormulaContainer< Real > frm1, const ElementFormulaContainer< Real2d > frm2)
ElementFormulaContainer< Cmplx2d >	operator* (const ElementFormulaContainer< Cmplx > frm1, const ElementFormulaContainer< Real2d > frm2)
ElementFormulaContainer< Real >	operator* (const ElementFormulaContainer< Real2d > frm1, const ElementFormulaContainer< Real2d > frm2)
ElementFormulaContainer < MapReal2d >	operator* (const ElementFormulaContainer< MapReal2d > frm1, const ElementFormulaContainer< Real > frm2)
ElementFormulaContainer < MapCmplx2d >	operator* (const ElementFormulaContainer< MapCmplx2d > frm1, const ElementFormulaContainer< Cmplx > frm2)
ElementFormulaContainer < MapReal2d >	operator* (const ElementFormulaContainer< Real > frm1, const ElementFormulaContainer< MapReal2d > frm2)
ElementFormulaContainer < MapCmplx2d >	operator* (const ElementFormulaContainer< Cmplx > frm1, const ElementFormulaContainer< MapCmplx2d > frm2)
template<class F , int dim>
Point< typename Combtype< F, Real >::type, dim >	operator* (const Real x, const Point< F, dim > &y)
ElementFormulaContainer< Real2d >	operator* (const ElementFormulaContainer< MapReal2d > frm1, const ElementFormulaContainer< Real2d > frm2)
template<class F , int dim>
Point< typename Combtype< F, Cmplx >::type, dim >	operator* (const Cmplx x, const Point< F, dim > &y)
template<int dim>
Cmplx	operator* (const Point< Cmplx, dim > &a, const Point< Real, dim > &b)
template<class F , class G >
concepts::Array< typename Combtype< F, G >::type >	operator* (const concepts::Array< F > &array, const G &val)
	Multiplication operator.
template<class F , class G >
Array< typename Combtype< F, G > ::type >	operator* (const G &val, const Array< F > &array)
	Multiplication operator.
template<int dim>
Cmplx	operator* (const Point< Real, dim > &a, const Point< Cmplx, dim > &b)
ElementFormulaContainer< Real >	operator* (const ElementFormulaContainer< Real > frm, const Real a)
	Simple multiplying of a element formulas by a constant via *-operator.
ElementFormulaContainer< Cmplx >	operator* (const ElementFormulaContainer< Cmplx > frm, const Real a)
ElementFormulaContainer< Cmplx >	operator* (const ElementFormulaContainer< Cmplx > frm, const Cmplx a)
ElementFormulaContainer< Cmplx >	operator* (const ElementFormulaContainer< Real > frm, const Cmplx a)
ElementFormulaContainer< Real2d >	operator* (const ElementFormulaContainer< Real2d > frm, const Real a)
ElementFormulaContainer< Cmplx2d >	operator* (const ElementFormulaContainer< Cmplx2d > frm, const Cmplx a)
ElementFormulaContainer< Cmplx2d >	operator* (const ElementFormulaContainer< Cmplx > frm, const Real2d a)
ElementFormulaContainer< Real2d >	operator* (const ElementFormulaContainer< Real > frm, const Real2d a)
ElementFormulaContainer < MapReal2d >	operator* (const ElementFormulaContainer< MapReal2d > frm, const Real a)
ElementFormulaContainer < MapCmplx2d >	operator* (const ElementFormulaContainer< MapCmplx2d > frm, const Cmplx a)
ElementFormulaContainer < MapReal2d >	operator* (const Real a, const ElementFormulaContainer< MapReal2d > frm)
ElementFormulaContainer < MapCmplx2d >	operator* (const Cmplx a, const ElementFormulaContainer< MapCmplx2d > frm)
ElementFormulaContainer< Real2d >	operator* (const ElementFormulaContainer< MapReal2d > frm, const Real2d a)
ElementFormulaContainer< Real >	operator* (const ElementFormulaContainer< Real > frm1, const ElementFormulaContainer< Real > frm2)
	Simple multiplying of two element formulas by *-operator.
ElementFormulaContainer< Cmplx >	operator* (const ElementFormulaContainer< Cmplx > frm1, const ElementFormulaContainer< Real > frm2)
ElementFormulaContainer< Cmplx >	operator* (const ElementFormulaContainer< Real > frm1, const ElementFormulaContainer< Cmplx > frm2)
template<class _Tp , class _Ref , class _Ptr >
_Matrix_iterator_base< _Tp, _Ref, _Ptr >	operator+ (ptrdiff_t __n, const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &__x)
ElementFormulaContainer< Real >	operator+ (const ElementFormulaContainer< Real > frm, const Real a)
	Simple adding of a element formulas and a constant via +-operator.
ElementFormulaContainer< Cmplx >	operator+ (const ElementFormulaContainer< Cmplx > frm, const Cmplx a)
ElementFormulaContainer< Cmplx >	operator+ (const ElementFormulaContainer< Cmplx > frm, const Real a)
ElementFormulaContainer< Real >	operator+ (const ElementFormulaContainer< Real > frm1, const ElementFormulaContainer< Real > frm2)
	Simple adding two element formulas by +-operator.
ElementFormulaContainer< Cmplx >	operator+ (const ElementFormulaContainer< Cmplx > frm1, const ElementFormulaContainer< Real > frm2)
ElementFormulaContainer< Cmplx >	operator+ (const ElementFormulaContainer< Cmplx > frm1, const ElementFormulaContainer< Cmplx > frm2)
ElementFormulaContainer< Real2d >	operator+ (const ElementFormulaContainer< Real2d > frm, const Real2d a)
ElementFormulaContainer< Cmplx >	operator+ (const ElementFormulaContainer< Real > frm1, const ElementFormulaContainer< Cmplx > frm2)
ElementFormulaContainer< Cmplx >	operator+ (const ElementFormulaContainer< Real > frm, const Cmplx a)
ElementFormulaContainer< Real2d >	operator+ (const ElementFormulaContainer< Real2d > frm1, const ElementFormulaContainer< Real2d > frm2)
template<typename _Tp , typename _RefL , typename _PtrL , typename _RefR , typename _PtrR >
_Matrix_iterator_base< _Tp, _RefL, _PtrL > ::difference_type	operator- (const _Matrix_iterator_base< _Tp, _RefL, _PtrL > &__x, const _Matrix_iterator_base< _Tp, _RefR, _PtrR > &__y)
ElementFormulaContainer< Real >	operator- (const ElementFormulaContainer< Real > frm, const Real a)
	Simple subtracting of a element formulas and a constant via --operator.
ElementFormulaContainer< Cmplx >	operator- (const ElementFormulaContainer< Cmplx > frm1, const ElementFormulaContainer< Real > frm2)
ElementFormulaContainer< Cmplx >	operator- (const ElementFormulaContainer< Cmplx > frm, const Cmplx a)
ElementFormulaContainer< Cmplx >	operator- (const ElementFormulaContainer< Cmplx > frm, const Real a)
ElementFormulaContainer< Cmplx >	operator- (const ElementFormulaContainer< Real > frm, const Cmplx a)
ElementFormulaContainer< Real >	operator- (const ElementFormulaContainer< Real > frm1, const ElementFormulaContainer< Real > frm2)
	Simple subtracting two element formulas by "-"-operator.
ElementFormulaContainer< Real2d >	operator- (const ElementFormulaContainer< Real2d > frm, const Real2d a)
ElementFormulaContainer< Cmplx >	operator- (const ElementFormulaContainer< Real > frm1, const ElementFormulaContainer< Cmplx > frm2)
ElementFormulaContainer< Cmplx >	operator- (const ElementFormulaContainer< Cmplx > frm1, const ElementFormulaContainer< Cmplx > frm2)
ElementFormulaContainer< Real2d >	operator- (const ElementFormulaContainer< Real2d > frm1, const ElementFormulaContainer< Real2d > frm2)
ElementFormulaContainer< Real >	operator/ (const ElementFormulaContainer< Real > frm1, const ElementFormulaContainer< Real > frm2)
	Simple dividing of a element formulas by a constant via /-operator.
ElementFormulaContainer< Cmplx >	operator/ (const ElementFormulaContainer< Cmplx > frm1, const ElementFormulaContainer< Real > frm2)
ElementFormulaContainer< Cmplx >	operator/ (const ElementFormulaContainer< Real > frm1, const ElementFormulaContainer< Cmplx > frm2)
ElementFormulaContainer< Cmplx >	operator/ (const ElementFormulaContainer< Cmplx > frm1, const ElementFormulaContainer< Cmplx > frm2)
template<class _Tp , class _Ref , class _Ptr >
bool	operator< (const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &__x, const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &__y)
template<class _Tp , class _RefL , class _PtrL , class _RefR , class _PtrR >
bool	operator< (const _Matrix_iterator_base< _Tp, _RefL, _PtrL > &__x, const _Matrix_iterator_base< _Tp, _RefR, _PtrR > &__y)
bool	operator< (const Cell &cell_x, const Cell &cell_y)
	<-operator could be useful for sorting, e.g. in std::set.
bool	operator< (const Connector &cntr_x, const Connector &cntr_y)
	<-operator sorted by the key, it could be useful for sorting, e.g.
template<class F , class G >
std::ostream &	operator<< (std::ostream &os, const std::pair< F, G > &p)
template<class F , int dim>
std::ostream &	operator<< (std::ostream &os, const Point< F, dim > &p)
template<class F >
std::ostream &	operator<< (std::ostream &os, const AdaptiveControl< F > &c)
template<class F >
std::ostream &	operator<< (std::ostream &os, const ElementMatrix< F > &o)
template<class F >
std::ostream &	operator<< (std::ostream &os, std::auto_ptr< F > &a)
	Output operator for auto_ptr's.
template<class F >
std::ostream &	operator<< (std::ostream &os, TColumn< F > *T)
	output-operator for pointer to TColumn, gives either 0 or TColumn itself
template<class F >
std::ostream &	operator<< (std::ostream &os, const typename std::list< F > &l)
template<class F , int dim>
std::ostream &	operator<< (std::ostream &os, const Mapping< F, dim > &m)
template<uint levelDim>
std::ostream &	operator<< (std::ostream &os, const AdaptiveAdjust< levelDim > &a)
template<int dim, class F >
std::ostream &	operator<< (std::ostream &os, const AdaptiveControlP< dim, F > &a)
template<uint dim>
std::ostream &	operator<< (std::ostream &os, const Level< dim > &c)
template<class T , unsigned nlnk>
std::ostream &	operator<< (std::ostream &os, const Joiner< T, nlnk > &j)
template<class F >
std::ostream &	operator<< (std::ostream &os, const std::auto_ptr< F > &p)
std::ostream &	operator<< (std::ostream &os, const Triangle2d::Index &i)
template<class F >
std::ostream &	operator<< (std::ostream &os, const Array< F > &o)
std::ostream &	operator<< (std::ostream &os, const Triangle3d::Index &i)
template<int dim>
std::ostream &	operator<< (std::ostream &os, const AdaptiveAdjustP< dim > &a)
std::ostream &	operator<< (std::ostream &os, const CellData &c)
template<class T >
std::ostream &	operator<< (std::ostream &os, const std::vector< T * > &field)
template<int number>
std::ostream &	operator<< (std::ostream &os, const Orders< number > &o)
std::ostream &	operator<< (std::ostream &os, const IndexRange &i)
std::ostream &	operator<< (std::ostream &os, const AdaptiveControlTag &c)
std::ostream &	operator<< (std::ostream &os, const Quad2d::Index &i)
template<typename T >
std::ostream &	operator<< (std::ostream &os, const HashedSparseMatrix< T > &o)
std::ostream &	operator<< (std::ostream &os, const std::map< uint, IndexRange > &map)
template<class _Tp , class _Ref , class _Ptr >
bool	operator<= (const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &__x, const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &__y)
template<class _Tp , class _RefL , class _PtrL , class _RefR , class _PtrR >
bool	operator<= (const _Matrix_iterator_base< _Tp, _RefL, _PtrL > &__x, const _Matrix_iterator_base< _Tp, _RefR, _PtrR > &__y)
template<class _Tp , class _RefL , class _PtrL , class _RefR , class _PtrR >
bool	operator== (const _Matrix_iterator_base< _Tp, _RefL, _PtrL > &__x, const _Matrix_iterator_base< _Tp, _RefR, _PtrR > &__y)
template<class _Tp , class _Ref , class _Ptr >
bool	operator== (const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &__x, const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &__y)
template<class F >
bool	operator== (const Array< F > &x, const Array< F > &y)
template<class F >
bool	operator== (const Array< F > &x, F &y)
template<class F >
bool	operator== (F &y, const Array< F > &x)
template<class F , int dim>
bool	operator== (const Point< F, dim > &x, const Point< F, dim > &y)
template<class _Tp , class _Ref , class _Ptr >
bool	operator> (const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &__x, const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &__y)
template<class _Tp , class _RefL , class _PtrL , class _RefR , class _PtrR >
bool	operator> (const _Matrix_iterator_base< _Tp, _RefL, _PtrL > &__x, const _Matrix_iterator_base< _Tp, _RefR, _PtrR > &__y)
template<class _Tp , class _Ref , class _Ptr >
bool	operator>= (const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &__x, const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &__y)
template<class _Tp , class _RefL , class _PtrL , class _RefR , class _PtrR >
bool	operator>= (const _Matrix_iterator_base< _Tp, _RefL, _PtrL > &__x, const _Matrix_iterator_base< _Tp, _RefR, _PtrR > &__y)
template<class F >
void	operator>> (std::istream &is, BaseSet< F > &set)
template<class F >
void	operator>> (std::istream &is, BaseSequence< F > &seq)
template<typename T >
std::ostream &	outputMatlab (std::ostream &os, const std::complex< T > &val)
std::ostream &	outputMatlab (std::ostream &os, const TMatrix< Real > &T)
	Function for output of T-Matrix to Matlab.
template<typename T >
std::ostream &	outputMatlab (std::ostream &os, const T &val)
	Function for output of basic types to matlab.
std::ostream &	outputMatlab (std::ostream &os, const TMatrixBase< Real > &T)
	Function for output of T-Matrix base class to Matlab.
template<class F >
void	pointerOutput (std::ostream &os, F *val)
template<class F >
void	pointerOutput (std::ostream &os, const F *val)
template<class F >
void	pointerOutput (std::ostream &os, const F &val)
template<class F >
void	pointerOutput (std::ostream &os, const Array< F > &array)
template<class F , int dim>
Mapping< F, dim > &	prodTranspose (Mapping< F, dim > &m)
template<class F , int dim>
Mapping< F, dim >	prodTranspose (const Mapping< F, dim > &m)
template<class F , class G >
G &	product (const F &m, G &v)
template<class F , class G >
G	product (const F &m, const G &v)
Sequence< Real >	realSeqFromStringWithPower (const std::string s)
	Converts a string to a sequence of real numbers, where a power may be allowed to express, e.g., negative powers of 2.
std::string	removeAllWhite (const std::string str)
	Removes all white space in the string `str`.
template<class F , class G >
F *	securePointer (F &value, G *matrix)
	Templated function, which prevent a pointer to a temporary value got from constant matrices with index operator .
template<class F , class G >
F *	securePointer (const F value, const G *matrix)
char *	shorten (const char *FILE)
	Shortens the string to the given size.
template<typename F >
void	sparseLineToArrays (std::map< int, F > &line, F a, int asub)
	This function converts a sparse line to an array of values and an array of indices.
Sequence< std::string >	splitbySemicolon (const std::string s)
std::vector< std::string >	splitString (const std::string text, const std::string separators)
	Split the string `text` string into words, where the separation token are included in `separators`.
std::vector< std::string >	splitStringByComma (const std::string text)
	Split a strings in words separated by commas while respecting the bracket hierachies.
std::vector< std::string >	splitStringNameParams (const std::string text)
	Split a string like "Ellipse(1.0, 4)" into "Ellipse", "1.0", "4".
template<class F >
void	storeDenseMatrixToMatlab (F &matrix, const uint nofRows, const uint nofCols, std::ostream &ofs, std::string name="")
	Writes a `matrix` to the stream `ofs` as dense matrix `name` in Matlab format.
template<class F >
bool	storeDenseMatrixToMatlab (F &matrix, const uint nofRows, const uint nofCols, const std::string filename, std::string name="", bool append=false)
	Stores a `matrix` to the matlab file `filename` as dense matrix `name`.
template<class F >
void	storeSparseMatrixToOctave (SparseMatrix< F > &matrix, std::ostream &ofs, std::string name="")
	Writes a `matrix` to the stream `ofs` as dense matrix `name` in Octave format (older version don't have sparse matrix format).
template<class F >
std::string	stringSubs (const std::string str, const std::string var, F value)
	Substitute all occurances of a substring `var` of a string `str` by `value` which may be for example a real or another string.
std::string	stringtolower (const std::string s)
char	tolower (const char ch)
template<class F , int dim>
Mapping< F, dim > &	transpose (Mapping< F, dim > &m)
template<class F , int dim>
Mapping< F, dim >	transpose (const Mapping< F, dim > &m)
Variables
static uint	storeDenseMatrixMatlabCounter_ = 0
	Counts number of Matlab outputs (used to uniquely name the matrices)
static uint	storeSparseMatrixMatlabCounter_ = 0

Detailed Description

Geometries and material constants for eddy current problems.

Waveprop.

String functions.

Process command line arguments.

Formula defined on elements.

Base class for adaptive models in 2D.

Bases for semi-infinite intervals or for one directions of semi-infinite cells based on Laguerre functions.

.hh

.hh Bilinear forms for bilinear form with u div v for hp 2D FEM

.hh Bilinear forms for Advection operator for hp 2D FEM

.hh file a priori refinement for quads

1D Meshes.

infiniteMeshes.hh Collection of meshes with infinite cells.

Formula given element-wise, the data is given as a vector on a FE space.

Formula class returning a vector.

Element formula class returning a vector.

Element formula class returning a matrix.

Exception handling for formulas.

Basic namespace for Concepts-2.

Special functions defined for each element of an array, for instant determinant or jacobian.

Kersten Schmidt, 2005

Additional modules may be placed in a different namespace (or one which is nested into this one).

Author:: Philipp Frauenfelder, 2004; Kersten Schmidt, 2009

Bilinear forms for bilinear forms with partial derivatives for hp 2D FEM

Close to the basis in: J. Shen, SIAM Journal on Numerical Analysis, 38:2001.

Classes for physical sources and formulas for both Cartisian and Radial PML

Typedef Documentation

typedef std::complex<Real> concepts::Cmplx

Type for a complex number. It also depends on the setting of Real.

Examples:: BGT_0.cc, exactDtN.cc, and matfileTutorial.cc.

Definition at line 21 of file typedefs.hh.

typedef Point<Cmplx, 2> concepts::Cmplx2d

Definition at line 18 of file vectorsMatricesForward.hh.

typedef Point<Cmplx, 3> concepts::Cmplx3d

Definition at line 19 of file vectorsMatricesForward.hh.

typedef Mapping<Cmplx, 2> concepts::MapCmplx2d

Definition at line 32 of file vectorsMatricesForward.hh.

typedef Mapping<Cmplx, 3> concepts::MapCmplx3d

Definition at line 33 of file vectorsMatricesForward.hh.

typedef Mapping<Real, 2> concepts::MapReal2d

Definition at line 28 of file vectorsMatricesForward.hh.

typedef Mapping<Real, 3> concepts::MapReal3d

Definition at line 31 of file vectorsMatricesForward.hh.

typedef double concepts::Real

Type normally used for a floating point number.

The idea behind this: if you want to have single or quadruple precision instead of double precision, just change this typdef and recompile.

Examples:: BGT_0.cc, exactDtN.cc, hpFEM2d-simple.cc, hpFEM2d.cc, hpFEM3d-EV.cc, inhomDirichletBCs.cc, inhomDirichletBCsLagrange.cc, inhomNeumannBCs.cc, linearDG1d.cc, linearFEM1d-simple.cc, linearFEM1d.cc, matfileTutorial.cc, meshes.cc, and RobinBCs.cc.

Definition at line 18 of file typedefs.hh.

typedef Point<Real, 2> concepts::Real2d

Definition at line 14 of file vectorsMatricesForward.hh.

typedef Point<Real, 3> concepts::Real3d

Definition at line 17 of file vectorsMatricesForward.hh.

typedef Scan<Cell1> concepts::Scan1

A scanner for a 1D mesh.

Definition at line 57 of file mesh.hh.

typedef Scan<Cell2> concepts::Scan2

A scanner for a 2D mesh.

Definition at line 60 of file mesh.hh.

typedef Scan<Cell3> concepts::Scan3

A scanner for a 3D mesh.

Definition at line 63 of file mesh.hh.

typedef Scan<Connector0> concepts::ScanCntr0

Definition at line 50 of file mesh_p.hh.

typedef Scan<Connector1> concepts::ScanCntr1

Definition at line 51 of file mesh_p.hh.

typedef Scan<Connector2> concepts::ScanCntr2

Definition at line 52 of file mesh_p.hh.

typedef signed int concepts::sint

Abbreviation for signed int.

Definition at line 24 of file typedefs.hh.

typedef unsigned char concepts::uchar

Abbreviation for unsigned char.

Definition at line 27 of file typedefs.hh.

typedef UnitNd<2> concepts::Unit2d

Definition at line 22 of file vectorsMatricesForward.hh.

typedef UnitNd<3> concepts::Unit3d

Definition at line 25 of file vectorsMatricesForward.hh.

typedef unsigned short concepts::ushort

Abbreviation for unsigned short.

Definition at line 30 of file typedefs.hh.

Enumeration Type Documentation

enum concepts::intRule

Types of integration rules to choose from.

Enumerator:

GAUSS_LOBATTO
GAUSS_JACOBI
TRAPEZE

Definition at line 13 of file defines.hh.

Function Documentation

template<class F , int dim>

Mapping<F,dim>& concepts::adjugate ( Mapping< F, dim > & m )

Definition at line 28 of file operations.hh.

Here is the call graph for this function:

template<class F , int dim>

Mapping<F,dim> concepts::adjugate ( const Mapping< F, dim > & m )

Definition at line 31 of file operations.hh.

Here is the call graph for this function:

template<class F , class G >

Sequence<G*> concepts::allConnectors	(	const F &	cntr,
		G (F::)(uint) const	fun
	)

Return all connectors of a particular type of another connector, e.g.

all edges of a cell

Sequence<Connector1*> edges = allConnectors(cntr, &Connector2::edge);

Definition at line 124 of file connectorSequence.hh.

template<class F , class G >

void concepts::allConnectors	(	const F &	cntr,
		G (F::)(uint) const	fun,
		Set< G * > &	set
	)

Return all connectors of a particular type of another connector, e.g.

all edges of a cell

Set<Connector1*> edges;
      allConnectors(cntr, &Connector2::edge, edges);

Definition at line 180 of file connectorSet.hh.

template<class F , class H , class I >

void concepts::apply	(	Operator< F > &	op,
		const Matrix< H > &	mX,
		Matrix< I > &	mY
	)

Multiplication with a matrix.

Decomposes matrix mX into vectors, apply standard application operator of op and adds(!) the resulting vectors to mY.

Author:: Kersten Schmidt, 2005

Definition at line 174 of file matrix.hh.

Here is the call graph for this function:

Real concepts::besselJ0 ( const Real x )

Real concepts::besselJ1 ( const Real x )

Real concepts::besselJn	(	const Real	x,
		const int	n
	)

Examples:: exactDtN.cc.

Real concepts::besselY0 ( const Real x )

Real concepts::besselY1 ( const Real x )

Real concepts::besselYn	(	const Real	x,
		const int	n
	)

Examples:: exactDtN.cc.

void concepts::buildEdgeMesh	(	Scan2 *	sc,
		const concepts::Set< uint >	attrib,
		MutableMeshBase &	emsh
	)

Construct a mesh of edges of a 2D mesh w.r.t.

to particular attributes.

Parameters:

sc	Scanner over the cells of the 2D mesh.
attrib	Set of edge attributes.
emsh	Edge mesh to which the elements on the edge are added.

Currently work only for Quad2d as they are only provide a method to generate a cell for an edge.

Typical call

      concepts::MutableMesh1 edgeMsh;
      concepts::Set<uint> eAttrib; eAttrib.insert(2);
      concepts::buildEdgeMesh(msh.scan(), eAttrib, edgeMsh);

The mesh on edges takes over the parent-child relationship from the quadrilateral mesh. But, after construction the meshes are independent meaning that refinement in one mesh is not automatically followed by the other.

The topological objects (connectors) are hold outside, most probably by the 2D mesh which must consequently not be deleted.

Author:: Kersten Schmidt, 2009

void concepts::chebychevPoints ( concepts::Array< Real > & p ) [inline]

Zeros of Chebychev polynomials in [-1,1].

Number of points is given by the size of the array.

Definition at line 105 of file arrayOp.hh.

Here is the call graph for this function:

template<class F >

void concepts::convertCCS_rowSorting	(	F &	m,
		typename F::type *	a,
		int *	asub,
		int *	xa
	)

Method converts a matrix of type F to Sparse Column Storage (CRS) format.

The matrix type needs an iterator over the entrances, which moves at least row by row. Inside the row the entrances are sorted by column before writing to the output arrays.

Parameters:

m	matrix
a	array of values
asub	array of column indices
xa	arrays of row pointers

Author:: , Kersten Schmidt, 2005

Definition at line 123 of file CRS.hh.

template<class F >

void concepts::convertCRS_rowSorting	(	F &	m,
		typename F::value_type *	a,
		int *	asub,
		int *	xa
	)

Method converts a matrix of type F to Sparse Row Storage (CRS) format.

The matrix type needs an iterator over the entrances, which moves at least row by row. Inside the row the entrances are sorted by column before writing to the output arrays.

Parameters:

m	matrix
a	array of values
asub	array of column indices
xa	arrays of row pointers

Author:: , Kersten Schmidt, 2005

Definition at line 79 of file CRS.hh.

Here is the call graph for this function:

template<class F , int dim>

F concepts::determinant ( const Mapping< F, dim > & m )

Definition at line 25 of file operations.hh.

Here is the call graph for this function:

template<class F >

Real concepts::diffReactAsympModelPowerLoss	(	Real	c0,
		Space< Real > *	spc,
		DiffReactAsympModelUepsN< F > &	UepsN
	)

Computes the power loss from the asymptotic expansion solution u_int of order order for a thin sheet of thickness d.

The unterlying trace space is spc. The relative conductivity is c0.

Definition at line 719 of file DiffReactAsympModel.hh.

Here is the call graph for this function:

template<class F >

Real concepts::diffReactAsympModelPowerLoss	(	Real	c0,
		hp1D::Element< Real > &	elm,
		DiffReactAsympModelUepsN< F > &	UepsN
	)

Computes the power loss from the asymptotic expansion solution u_int of order order for a thin element of thickness d.

The relative conductivity is c0.

Definition at line 738 of file DiffReactAsympModel.hh.

Here is the call graph for this function:

std::string concepts::ensureEnding	(	const std::string &	filename,
		const std::string	ending
	)

Returns a string with particular ending.

Append it, if needed.

Author:: Kersten Schmidt, 2005

template<class exc >

exc concepts::exception_set_fields	(	exc	e,
		const std::string &	file,
		const unsigned int	line,
		const std::string &	function,
		const std::string &	excName
	)

Sets fields on exception and throws it.

This routine does the main work for the conceptsException macro. This routine should not be called directly, it is used by the conceptsException macro.

Returns:: An exception which can then be thrown

Parameters:

e	Exception to be thrown
file	Filename where the exception was thrown from
line	Line where the exception was thrown from
function	Name of the function that threw the exception
excName	The name of the exception

See also:: conceptsException; ExceptionBase

Author:: Philipp Frauenfelder, 2000

Definition at line 271 of file exceptions.hh.

Here is the call graph for this function:

template<class exc >

void concepts::exception_throw_assert	(	const std::string &	file,
		int	line,
		const std::string &	function,
		const std::string &	exc_name,
		const std::string &	cond,
		exc	e
	)

Sets the fields of an assertion and throws it.

This routine does the main work for the exception generation mechanism used in the conceptsAssert macro. This routine should not be called directly, it is used by the conceptsAssert macro.

See also:: conceptsAssert; Assertion

Author:: Philipp Frauenfelder, 2000

Definition at line 319 of file exceptions.hh.

Here is the call graph for this function:

void concepts::GaussJacobiAbscWght	(	double *	x,
		double *	w,
		const uint	p
	)

Computes and returns the integration weights and abscissas for the Gauss Jacobi integration.

The abscissas no not include the endpoints -1 and 1.

Integration with the quadrature rule

$\int_{-1}^1 f(x) \, dx \approx \sum_{i=0}^p w_i f(x_i)$

is exact for polynomials $f \in P_{2p+1}$ .

The abscissas $x_i$ are the zeros of $P_{p+1}^{(0,0)}(x)$ and the weights are

$w_i = \frac{2}{1-x_i^2} \left( \frac{d}{dx} \left. P^{(0,0)}_{p+1}(x) \right|_{x=x_i} \right)^{-2}.$

Precondition:: The space for the arrays x and w is allocated, size: p+1.

Author:: Philipp Frauenfelder, 2001

void concepts::GaussLobattoAbscWght	(	double *	x,
		double *	w,
		const uint	p,
		const uint	j = `0`
	)

Computes and returns the integration weights and abscissas for the Gauss (Jacobi) Lobatto integration.

The Jacobi version can be chosen with a parameter. The abscissas include both endpoints, ie. 1 and -1.

Integration with the quadrature rule

$\int_{-1}^1 f(x) \, dx \approx \sum_{i=0}^p w_i f(x_i)$

is exact for polynomials $f \in P_{2p-1}$ . The Jacobi version integrates

$\int_{-1}^1 f(x) (1-x)^j \, dx \approx \sum_{i=0}^p w_i f(x_i)$

exactly for $f \in P_{2p-1}$ .

The abscissas $x_i$ are the zeros of $(1-x^2) P_{p-1}^{(1,1)}(x)$ and the weights are $w_i = 2/(p(p+1) (P_p^{(0,0)}(x_i))^2)$ . For the Jacobi version, the abscissas are the zeros of $(1-x^2) P_{p-1}^{(1+j,1)}(x)$ and the weights are $w_i = 2^{1+j}/(p(p+1+j) (P_p^{(j,0)}(x_i))^2)$ and $w_p = (1+j) \cdot 2^{1+j}/(p(p+1+j) (P_p^{(j,0)}(x_i))^2)$ .

Parameters:

x	Output: the integration abscissas
w	Output: the integration weights
p	Order of the integration, p+1 points are computed
j	The Jacobi version of the integration rule is used if this is non-zero.

Precondition:: The space for the arrays x and w is allocated, size: p+1.

Author:: Philipp Frauenfelder, 2000

void concepts::GaussRadauAbscWght	(	double *	x,
		double *	w,
		const uint	p,
		const uint	j = `0`
	)

Computes and returns the integration weights and abscissas for the Gauss Radau Jacobi integration.

The Jacobi version can be chosen with a parameter. The abscissas include only one endpoint: -1.

Integration with the quadrature rule

$\int_{-1}^1 f(x) \, dx \approx \sum_{i=0}^p w_i f(x_i)$

is exact for polynomials $f \in P_{2p}$ . The Jacobi version integrates

$\int_{-1}^1 f(x) (1-x)^j \, dx \approx \sum_{i=0}^p w_i f(x_i)$

exactly for $f \in P_{2p}$ .

The abscissas $x_i$ are the zeros of $(1+x) P_{p}^{(j,1)}(x)$ and the weights are $w_i = 2/((p+1)(p+1+j) (P_p^{(j,0)}(x_i))^2)$ .

Parameters:

x	Output: the integration abscissas
w	Output: the integration weights
p	Order of the integration, p+1 points are computed
j	The Jacobi version of the integration rule is used if this is non-zero.

Precondition:: The space for the arrays x and w is allocated, size: p+1.

Author:: Philipp Frauenfelder, 2001

std::pair<ThinMeshes2d, PiecewiseFormulaBase<Real>> concepts::generateThinMeshes2dFromInput	(	const InOutParameters	input,
		bool	verbose = `false`
	)

Generates thin meshes from a given parameter list, i.e.

a mesh with resolved thin sheet and another where the sheet is represented by an interface.

The parameter list needs the strings: "sheet" - shape of the middle interface of the thin sheet "source" - shape of sources

Currently ellipsoid sheet and one or two circular sources in the interior are implemented where the boundary of the domain is a circle of radius 2 and attribute 1.

The ellipsoid sheet can be defined via

string sheet  "Ellipse(1.2, 2)"

where the numbers are the minor axis (in y direction) and the major axis (in x direction).

A cirular source can be set via

string source "Circle(0, 0.25, 1)"

where the first number is the x-coordinate of the mid-point (the y-coordinate is 0), the second number is the radius and the third and optional number is the intensity of the source. The circle gets attribute 7.

Two circular sources can be set with

string source "Circle(-0.5, 0.25, 1), Circle(0.5, 0.25, -1)"

where the first one should be left of the second one. The second circle gets attribute 8.

The thin sheet gets attribute 2 in the thin sheet mesh.

The outer region of the sheet gets attribute 6 and the inner attribute 5 (in both meshes). The interface in the limit mesh gets attribute 4.

Author:: Kersten Schmidt, 2010

std::string concepts::getDirectory ( const std::string str )

Returns the directory of a given full filename.

std::string concepts::getFilename ( const std::string str )

Returns the filename (with ending) of a given full filename.

std::string concepts::getFilenamePrefix ( const std::string str )

Returns the prefix of a given full filename, e.g.

. "example" for "~/example.dat".

Import2dMeshGeneral* concepts::import2dMeshGeneralFromInput	(	const InOutParameters	input,
		bool	verbose = `false`
	)

Loads a mesh from a paramater list.

The parameter list needs the strings: "inputfilename" - prefix for all file names.

The parameter list may include the strings: "inputpath" - name of the path where the files are inside. If not given, the current working directory (".") is taken.

It will be excepted five files, namely the coordinate, the element, the attribute, the edge radia and the edge correlation file of the following names. Let the prefix be "example". Then, the files are "example_Coord.dat", "example_Elms.dat", "example_Attr.dat", "example_EdgRadia.dat", "example_EdgCorr.dat".

The files have to exist, but may be empty.

Author:: Kersten Schmidt, 2009

template<typename G >

Real concepts::integrate ( const Element< G > & elm )

Returns the area of the cell belonging to the element elm.

Author:: Kersten Schmidt, 2005

Examples:: exactDtN.cc.

Definition at line 39 of file integral.hh.

Here is the call graph for this function:

template<typename F , typename G >

F concepts::integrate	(	const ElementWithCell< G > &	elm,
		const ElementFormula< F, G > &	frm,
		const Real	t = `0.0`,
		IntegrationCell::intFormType	form = `IntegrationCell::ZERO`
	)

Returns the integral of the element formula frm over the cell belonging to the element elm.

Author:: Kersten Schmidt, 2005

Definition at line 60 of file integral.hh.

Here is the call graph for this function:

template<class F , typename G >

F concepts::integrate	(	SpaceOnCells< G > &	spc,
		const ElementFormula< F, G > &	frm,
		const Real	t = `0.0`,
		IntegrationCell::intFormType	form = `IntegrationCell::ZERO`
	)

Returns the integral over space spc of the formula or element formula frm at time t.

The integration form is form.

Spaces are valid, if their elements are derivated from IntegrationCell.

See also:: IntegrationCell

Author:: Kersten Schmidt, 2005

Definition at line 90 of file integral.hh.

Here is the call graph for this function:

template<class F , int dim>

Mapping<F,dim> concepts::inverse ( const Mapping< F, dim > & m )

Definition at line 22 of file operations.hh.

Here is the call graph for this function:

template<class F >

F& concepts::inverse ( F & f )

Definition at line 13 of file operations.hh.

template<class F >

F concepts::inverse ( const F & f )

Definition at line 16 of file operations.hh.

template<class F , int dim>

Mapping<F,dim>& concepts::inverse ( Mapping< F, dim > & m )

Definition at line 19 of file operations.hh.

Here is the call graph for this function:

void concepts::JacobiDerivatives	(	const double	alf,
		const double	bet,
		const int	maxn,
		const double *	x,
		const int	m,
		const double *	p,
		double *	q
	)

Computes the values of the derivatives of the Jacobi polynomials.

$\frac{d}{dx} P^{(\alpha,\beta)}_i (x_j)$ for $i = 0, \dots, maxn$ and $x_j \in x$ , $|x| = m$ .

Parameters:

alf	$\alpha$
bet	$\beta$
maxn	Highest polynomial degree to be computed
x	Array of size `m` with the points in which the polynomials should be evaluated. $x_j \in [-1,1]$ .
m	Size of array `x`
p	Array of the size `m*`(maxn+1) filled with the Jacobi polynomials.
q	Array of the size `m*`(maxn+1) (must be allocated), will be filled with the values of the derivatives of the poynomials in the points with `i` running fastest.

Precondition:: The space for the array q is allocated, size: m*(maxn+1)

Author:: Philipp Frauenfelder, after the recursion formulae in Karniadakis / Sherwin "Spectral/hp Element Methods for CFD" p. 350f

void concepts::JacobiPol	(	const double	alf,
		const double	bet,
		const int	maxn,
		const double *	x,
		const int	m,
		double *	p
	)

Computes the values of the Jacobi polynomials.

$P^{(\alpha, \beta)}_i (x_j)$ for $i = 0, \dots, maxn$ and $x_j \in x$ , $|x| = m$ .

Parameters:

alf	$\alpha$
bet	$\beta$
maxn	Highest polynomial degree to be computed
x	Array of size `m` with the points in which the polynomials should be evaluated. $x_j \in [-1,1]$ .
m	Size of array `x`
p	Array of the size `m*`(maxn+1) (must be allocated), will be filled with the values of the poynomials in the points with i running fastest.

Precondition:: The space for the array p is allocated, size: m*(maxn+1)

Author:: Philipp Frauenfelder, after the recursion formulae in Karniadakis / Sherwin "Spectral/hp Element Methods for CFD" p. 350f

void concepts::JacobiZeros	(	double *	x,
		int	p,
		double	alf,
		double	bet
	)

Computes the zeros of the Jacobi polynomials $P_{p}^{(\alpha,\beta)}(x)$ .

Parameters:

x	Output: the zeros of the Jacobi polynomials in the elements 1, ..., p. The element 0 of the array is untouched.
p	Degree of the Jacobi polynomial
alf	$\alpha$
bet	$\beta$

Precondition:: The space for the arrays x is allocated, size: p+1

Author:: (C) Copr. 1986-92 Numerical Recipes Software VsXz&52.!-.

template<typename F , typename G >

Real concepts::L2product	(	const ElementWithCell< G > &	elm,
		const ElementFormula< F, G > &	u,
		const ElementFormula< Real > *	c = `0`,
		const Real	t = `0.0`,
		IntegrationCell::intFormType	form = `IntegrationCell::ZERO`
	)

Returns the L2 product or with c weighted L2 product of an element formula u over the cell belonging to the element elm.

$\int\limits_{K}c u^\top\cdot\overline{u}\,dx$

Author:: Kersten Schmidt, 2005

Definition at line 124 of file integral.hh.

Here is the call graph for this function:

template<class F , typename G >

Real concepts::L2product	(	SpaceOnCells< F > &	spc,
		const G &	u,
		const ElementFormula< Real > *	c = `0`,
		const Real	t = `0.0`,
		IntegrationCell::intFormType	form = `IntegrationCell::ZERO`
	)

Returns the L2 product or with c weighted L2 product over space spc of the formula or element formula u at time t.

The integration form is form.

$\int\limits_{\Omega}c u^\top\cdot\overline{u}\,dx$

Spaces are valid, if their elements are derivated from IntegrationCell.

See also:: IntegrationCell

Author:: Kersten Schmidt, 2005

Definition at line 177 of file integral.hh.

Here is the call graph for this function:

void concepts::LinearConvolution	(	const Real *	X,
		const Real *	Y,
		Real *	Z,
		int	lenx,
		int	leny
	)		`[inline]`

Routine peforms linear convolution by straight forward calculation.

I.e. it calculates z = x convolve y

Author:: Clay S. Turner

inputs: X array of data comprising vector #1 Y array of data comprising vector #2 Z pointer to place to save resulting data - needs to be lenx+leny-1 long lenx # of items in vector 1 leny # of items in vector 2

Definition at line 19 of file convol.h.

template<class F >

Array<F> concepts::makeArray	(	uint	n,
		const F &	first,
			...
	)

Creates an array of length
from a comma separated list of values.

e.g.

makeArray(4, 2, 3, 6, 7)

creates an array [2, 3, 6, 7]

Definition at line 87 of file arrayOp.hh.

template<class F , class G >

void concepts::makeArray	(	const F &	cell,
		const Array< Real > &	p,
		G(F::*)(Real) const	fun,
		Array< G > &	array
	)

Creates an array array by applying an function fun of a cell cell for each value p.

Author:: Kersten Schmidt, 2009

Definition at line 25 of file arrays.hh.

Here is the call graph for this function:

template<class F , class G >

void concepts::makeArray	(	const F &	cell,
		const Array< Real > &	pX,
		const Array< Real > &	pY,
		G(F::*)(Real, Real) const	fun,
		Array< G > &	array
	)

Creates an array array by applying an function fun of a cell cell for each combination of the values pX and pY.

The fast loop is over pY.

Author:: Kersten Schmidt, 2009

Definition at line 42 of file arrays.hh.

Here is the call graph for this function:

template<class T >

RCP<const T> concepts::makecRCP_weak ( T * x )

Definition at line 117 of file sharedPointer.hh.

template<class T >

RCP<T> concepts::makeRCP ( T * x )

Function to create a RCP which deletes the object when no RCP points on it anymore.

The function has to be used, if the object is created with new.

For example:

      RCP<int>::Type iP = makeRCP(new int(2));
      iP.reset();   // deletes the integer 2

Second example:

      RCP<int>::Type iP = makeRCP(new int(3)), jP = iP;
      jP.reset();   // does not delete the integer 3, as jP points still on it
      iP.reset();   // deletes the integer 3, no RCP points on it

Definition at line 92 of file sharedPointer.hh.

template<class T >

RCP<T> concepts::makeRCP_weak ( T * x )

Function to create a RCP without deleting the object in the destructor.

The function has to be used, if the object remains externally, e.g., in the heap.

For example:

  int i = 1;
  RCP<int>::Type iP = makeRCP_weak(&i);
  iP.reset();   // will not delete the integer 1

Definition at line 110 of file sharedPointer.hh.

template<class F >

Sequence<F> concepts::makeSequence	(	uint	n,
		const F &	first,
			...
	)

Creates an sequence of length
from a comma separated list of values.

e.g.

makeSequence(4, 2, 3, 6, 7)

creates an sequence [2, 3, 6, 7]

Definition at line 339 of file sequence.hh.

template<class F >

Set<F> concepts::makeSet	(	uint	n,
		const F &	first,
			...
	)

Creates an array of length
from a comma separated list of values.

e.g.

makeSet(4, 3, 2, 6, 7)

creates an set [2, 3, 6, 7]

Definition at line 307 of file set.hh.

int concepts::match	(	const Connector1 &	edg,
		const Connector0 &	vtx,
		int &	idx
	)

Checks, if a edge has a vertex.

In that case the value 1 is returned, and idx is the index of that vertex.

Definition at line 51 of file asympEdges.hh.

Here is the call graph for this function:

int concepts::match	(	const Connector1 &	edg0,
		const Connector1 &	edg1,
		int	idx[]
	)

Checks, if two edges has a common vertex.

In that case the value 1 is returned, and the idx[0]-th vertex of edg0 coincide with the idx[1]-th vertex of edg1.

template<class F , class G , class H >

void concepts::matrixMultiplyRowSorting	(	const F &	factL,
		const G &	factR,
		Matrix< H > &	dest
	)

Multiplies two matrices, which deliver at least a row sorted iterator, and adds (!) the result to a third matrix.

The matrices factL and factR needs the methods nofRows(), nofCols(), begin(row) or begin() respectivly.

Author:: Kersten Schmidt, 2005

Definition at line 26 of file matrixMult.hh.

Here is the call graph for this function:

template<typename F , typename G >

void concepts::memorycpy	(	F *	dest,
		const G *	src,
		size_t	n
	)

Copies n entries from src to dest (faster than std::memcpy)

Definition at line 25 of file vectorsMatrices.hh.

template<class F >

F* concepts::newField ( uint nr ) [inline]

Reserve memory for a field of type F and returns the pointer to first entrance.

Author:: Kersten Schmidt, 2005

Definition at line 15 of file memory.hh.

template<class _Tp , class _RefL , class _PtrL , class _RefR , class _PtrR >

bool concepts::operator!=	(	const _Matrix_iterator_base< _Tp, _RefL, _PtrL > &	__x,
		const _Matrix_iterator_base< _Tp, _RefR, _PtrR > &	__y
	)		`[inline]`

Definition at line 156 of file matrixIterator.hh.

template<class _Tp , class _Ref , class _Ptr >

bool concepts::operator!=	(	const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &	__x,
		const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &	__y
	)		`[inline]`

Definition at line 148 of file matrixIterator.hh.

ElementFormulaContainer<Cmplx> concepts::operator*	(	const ElementFormulaContainer< Cmplx >	frm1,
		const ElementFormulaContainer< Cmplx >	frm2
	)

ElementFormulaContainer<Real2d> concepts::operator*	(	const ElementFormulaContainer< Real2d >	frm1,
		const ElementFormulaContainer< Real >	frm2
	)

ElementFormulaContainer<Cmplx2d> concepts::operator*	(	const ElementFormulaContainer< Real2d >	frm1,
		const ElementFormulaContainer< Cmplx >	frm2
	)

ElementFormulaContainer<Real2d> concepts::operator*	(	const ElementFormulaContainer< Real >	frm1,
		const ElementFormulaContainer< Real2d >	frm2
	)

ElementFormulaContainer<Cmplx2d> concepts::operator*	(	const ElementFormulaContainer< Cmplx >	frm1,
		const ElementFormulaContainer< Real2d >	frm2
	)

ElementFormulaContainer<Real> concepts::operator*	(	const ElementFormulaContainer< Real2d >	frm1,
		const ElementFormulaContainer< Real2d >	frm2
	)

ElementFormulaContainer<MapReal2d> concepts::operator*	(	const ElementFormulaContainer< MapReal2d >	frm1,
		const ElementFormulaContainer< Real >	frm2
	)

ElementFormulaContainer<MapCmplx2d> concepts::operator*	(	const ElementFormulaContainer< MapCmplx2d >	frm1,
		const ElementFormulaContainer< Cmplx >	frm2
	)

ElementFormulaContainer<MapReal2d> concepts::operator*	(	const ElementFormulaContainer< Real >	frm1,
		const ElementFormulaContainer< MapReal2d >	frm2
	)

ElementFormulaContainer<MapCmplx2d> concepts::operator*	(	const ElementFormulaContainer< Cmplx >	frm1,
		const ElementFormulaContainer< MapCmplx2d >	frm2
	)

template<class F , int dim>

Point<typename Combtype<F,Real>::type,dim> concepts::operator*	(	const Real	x,
		const Point< F, dim > &	y
	)		`[inline]`

Definition at line 218 of file vectorsMatrices.hh.

ElementFormulaContainer<Real2d> concepts::operator*	(	const ElementFormulaContainer< MapReal2d >	frm1,
		const ElementFormulaContainer< Real2d >	frm2
	)

template<class F , int dim>

Point<typename Combtype<F,Cmplx>::type,dim> concepts::operator*	(	const Cmplx	x,
		const Point< F, dim > &	y
	)		`[inline]`

Definition at line 224 of file vectorsMatrices.hh.

template<int dim>

Cmplx concepts::operator*	(	const Point< Cmplx, dim > &	a,
		const Point< Real, dim > &	b
	)

Definition at line 230 of file vectorsMatrices.hh.

template<class F , class G >

concepts::Array<typename Combtype<F,G>::type> concepts::operator*	(	const concepts::Array< F > &	array,
		const G &	val
	)

Multiplication operator.

Returns the product of an array of type F and a value of type G.

Definition at line 356 of file array.hh.

Here is the call graph for this function:

template<class F , class G >

Array<typename Combtype<F,G>::type> concepts::operator*	(	const G &	val,
		const Array< F > &	array
	)

Multiplication operator.

Returns the product of an a value of type G and an array of type F.

Definition at line 371 of file array.hh.

template<int dim>

Cmplx concepts::operator*	(	const Point< Real, dim > &	a,
		const Point< Cmplx, dim > &	b
	)

Definition at line 239 of file vectorsMatrices.hh.

Here is the call graph for this function:

ElementFormulaContainer<Real> concepts::operator*	(	const ElementFormulaContainer< Real >	frm,
		const Real	a
	)

Simple multiplying of a element formulas by a constant via *-operator.

ElementFormulaContainer<Cmplx> concepts::operator*	(	const ElementFormulaContainer< Cmplx >	frm,
		const Real	a
	)

ElementFormulaContainer<Cmplx> concepts::operator*	(	const ElementFormulaContainer< Cmplx >	frm,
		const Cmplx	a
	)

ElementFormulaContainer<Cmplx> concepts::operator*	(	const ElementFormulaContainer< Real >	frm,
		const Cmplx	a
	)

ElementFormulaContainer<Real2d> concepts::operator*	(	const ElementFormulaContainer< Real2d >	frm,
		const Real	a
	)

ElementFormulaContainer<Cmplx2d> concepts::operator*	(	const ElementFormulaContainer< Cmplx2d >	frm,
		const Cmplx	a
	)

ElementFormulaContainer<Cmplx2d> concepts::operator*	(	const ElementFormulaContainer< Cmplx >	frm,
		const Real2d	a
	)

ElementFormulaContainer<Real2d> concepts::operator*	(	const ElementFormulaContainer< Real >	frm,
		const Real2d	a
	)

ElementFormulaContainer<MapReal2d> concepts::operator*	(	const ElementFormulaContainer< MapReal2d >	frm,
		const Real	a
	)

ElementFormulaContainer<MapCmplx2d> concepts::operator*	(	const ElementFormulaContainer< MapCmplx2d >	frm,
		const Cmplx	a
	)

ElementFormulaContainer<MapReal2d> concepts::operator*	(	const Real	a,
		const ElementFormulaContainer< MapReal2d >	frm
	)

ElementFormulaContainer<MapCmplx2d> concepts::operator*	(	const Cmplx	a,
		const ElementFormulaContainer< MapCmplx2d >	frm
	)

ElementFormulaContainer<Real2d> concepts::operator*	(	const ElementFormulaContainer< MapReal2d >	frm,
		const Real2d	a
	)

ElementFormulaContainer<Real> concepts::operator*	(	const ElementFormulaContainer< Real >	frm1,
		const ElementFormulaContainer< Real >	frm2
	)

Simple multiplying of two element formulas by *-operator.

ElementFormulaContainer<Cmplx> concepts::operator*	(	const ElementFormulaContainer< Cmplx >	frm1,
		const ElementFormulaContainer< Real >	frm2
	)

ElementFormulaContainer<Cmplx> concepts::operator*	(	const ElementFormulaContainer< Real >	frm1,
		const ElementFormulaContainer< Cmplx >	frm2
	)

template<class _Tp , class _Ref , class _Ptr >

_Matrix_iterator_base<_Tp, _Ref, _Ptr> concepts::operator+	(	ptrdiff_t	__n,
		const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &	__x
	)		`[inline]`

Definition at line 247 of file matrixIterator.hh.

ElementFormulaContainer<Real> concepts::operator+	(	const ElementFormulaContainer< Real >	frm,
		const Real	a
	)

Simple adding of a element formulas and a constant via +-operator.

ElementFormulaContainer<Cmplx> concepts::operator+	(	const ElementFormulaContainer< Cmplx >	frm,
		const Cmplx	a
	)

ElementFormulaContainer<Cmplx> concepts::operator+	(	const ElementFormulaContainer< Cmplx >	frm,
		const Real	a
	)

ElementFormulaContainer<Real> concepts::operator+	(	const ElementFormulaContainer< Real >	frm1,
		const ElementFormulaContainer< Real >	frm2
	)

Simple adding two element formulas by +-operator.

ElementFormulaContainer<Cmplx> concepts::operator+	(	const ElementFormulaContainer< Cmplx >	frm1,
		const ElementFormulaContainer< Real >	frm2
	)

ElementFormulaContainer<Cmplx> concepts::operator+	(	const ElementFormulaContainer< Cmplx >	frm1,
		const ElementFormulaContainer< Cmplx >	frm2
	)

ElementFormulaContainer<Real2d> concepts::operator+	(	const ElementFormulaContainer< Real2d >	frm,
		const Real2d	a
	)

ElementFormulaContainer<Cmplx> concepts::operator+	(	const ElementFormulaContainer< Real >	frm1,
		const ElementFormulaContainer< Cmplx >	frm2
	)

ElementFormulaContainer<Cmplx> concepts::operator+	(	const ElementFormulaContainer< Real >	frm,
		const Cmplx	a
	)

ElementFormulaContainer<Real2d> concepts::operator+	(	const ElementFormulaContainer< Real2d >	frm1,
		const ElementFormulaContainer< Real2d >	frm2
	)

template<typename _Tp , typename _RefL , typename _PtrL , typename _RefR , typename _PtrR >

_Matrix_iterator_base<_Tp, _RefL, _PtrL>::difference_type concepts::operator-	(	const _Matrix_iterator_base< _Tp, _RefL, _PtrL > &	__x,
		const _Matrix_iterator_base< _Tp, _RefR, _PtrR > &	__y
	)		`[inline]`

Definition at line 233 of file matrixIterator.hh.

Here is the call graph for this function:

ElementFormulaContainer<Real> concepts::operator-	(	const ElementFormulaContainer< Real >	frm,
		const Real	a
	)

Simple subtracting of a element formulas and a constant via --operator.

ElementFormulaContainer<Cmplx> concepts::operator-	(	const ElementFormulaContainer< Cmplx >	frm1,
		const ElementFormulaContainer< Real >	frm2
	)

ElementFormulaContainer<Cmplx> concepts::operator-	(	const ElementFormulaContainer< Cmplx >	frm,
		const Cmplx	a
	)

ElementFormulaContainer<Cmplx> concepts::operator-	(	const ElementFormulaContainer< Cmplx >	frm,
		const Real	a
	)

ElementFormulaContainer<Cmplx> concepts::operator-	(	const ElementFormulaContainer< Real >	frm,
		const Cmplx	a
	)

ElementFormulaContainer<Real> concepts::operator-	(	const ElementFormulaContainer< Real >	frm1,
		const ElementFormulaContainer< Real >	frm2
	)

Simple subtracting two element formulas by "-"-operator.

ElementFormulaContainer<Real2d> concepts::operator-	(	const ElementFormulaContainer< Real2d >	frm,
		const Real2d	a
	)

ElementFormulaContainer<Cmplx> concepts::operator-	(	const ElementFormulaContainer< Real >	frm1,
		const ElementFormulaContainer< Cmplx >	frm2
	)

ElementFormulaContainer<Cmplx> concepts::operator-	(	const ElementFormulaContainer< Cmplx >	frm1,
		const ElementFormulaContainer< Cmplx >	frm2
	)

ElementFormulaContainer<Real2d> concepts::operator-	(	const ElementFormulaContainer< Real2d >	frm1,
		const ElementFormulaContainer< Real2d >	frm2
	)

ElementFormulaContainer<Real> concepts::operator/	(	const ElementFormulaContainer< Real >	frm1,
		const ElementFormulaContainer< Real >	frm2
	)

Simple dividing of a element formulas by a constant via /-operator.

ElementFormulaContainer<Cmplx> concepts::operator/	(	const ElementFormulaContainer< Cmplx >	frm1,
		const ElementFormulaContainer< Real >	frm2
	)

ElementFormulaContainer<Cmplx> concepts::operator/	(	const ElementFormulaContainer< Real >	frm1,
		const ElementFormulaContainer< Cmplx >	frm2
	)

ElementFormulaContainer<Cmplx> concepts::operator/	(	const ElementFormulaContainer< Cmplx >	frm1,
		const ElementFormulaContainer< Cmplx >	frm2
	)

template<class _Tp , class _Ref , class _Ptr >

bool concepts::operator<	(	const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &	__x,
		const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &	__y
	)		`[inline]`

Definition at line 164 of file matrixIterator.hh.

Here is the call graph for this function:

template<class _Tp , class _RefL , class _PtrL , class _RefR , class _PtrR >

bool concepts::operator<	(	const _Matrix_iterator_base< _Tp, _RefL, _PtrL > &	__x,
		const _Matrix_iterator_base< _Tp, _RefR, _PtrR > &	__y
	)		`[inline]`

Definition at line 174 of file matrixIterator.hh.

Here is the call graph for this function:

bool concepts::operator<	(	const Cell &	cell_x,
		const Cell &	cell_y
	)

<-operator could be useful for sorting, e.g. in std::set.

bool concepts::operator<	(	const Connector &	cntr_x,
		const Connector &	cntr_y
	)

<-operator sorted by the key, it could be useful for sorting, e.g.

in std::set.

template<class F , class G >

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const std::pair< F, G > &	p
	)

Definition at line 67 of file outputOperator.hh.

template<class F , int dim>

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const Point< F, dim > &	p
	)

Definition at line 191 of file vectorsMatrices.hh.

template<class F >

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const AdaptiveControl< F > &	c
	)

template<class F >

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const ElementMatrix< F > &	o
	)

Definition at line 278 of file element.hh.

template<class F >

std::ostream& concepts::operator<<	(	std::ostream &	os,
		std::auto_ptr< F > &	a
	)

Output operator for auto_ptr's.

Definition at line 30 of file array.hh.

template<class F >

std::ostream& concepts::operator<<	(	std::ostream &	os,
		TColumn< F > *	T
	)

output-operator for pointer to TColumn, gives either 0 or TColumn itself

Definition at line 102 of file tmatrix.hh.

template<class F >

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const typename std::list< F > &	l
	)

Definition at line 105 of file asympEdges.hh.

Here is the call graph for this function:

template<class F , int dim>

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const Mapping< F, dim > &	m
	)

Definition at line 548 of file vectorsMatrices.hh.

Here is the call graph for this function:

template<uint levelDim>

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const AdaptiveAdjust< levelDim > &	a
	)

template<int dim, class F >

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const AdaptiveControlP< dim, F > &	a
	)

Definition at line 42 of file hpMethod.hh.

template<uint dim>

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const Level< dim > &	c
	)

template<class T , unsigned nlnk>

std::ostream & concepts::operator<<	(	std::ostream &	os,
		const Joiner< T, nlnk > &	j
	)

Definition at line 159 of file scannerConnectors.hh.

template<class F >

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const std::auto_ptr< F > &	p
	)

Definition at line 49 of file outputOperator.hh.

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const Triangle2d::Index &	i
	)

template<class F >

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const Array< F > &	o
	)

Definition at line 315 of file array.hh.

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const Triangle3d::Index &	i
	)

template<int dim>

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const AdaptiveAdjustP< dim > &	a
	)

Definition at line 127 of file hpMethod.hh.

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const CellData &	c
	)

template<class T >

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const std::vector< T * > &	field
	)

Definition at line 144 of file meshImport.hh.

template<int number>

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const Orders< number > &	o
	)

Definition at line 56 of file karniadakis.hh.

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const IndexRange &	i
	)

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const AdaptiveControlTag &	c
	)

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const Quad2d::Index &	i
	)

template<typename T >

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const HashedSparseMatrix< T > &	o
	)

Definition at line 189 of file hashedSMatrix.hh.

std::ostream& concepts::operator<<	(	std::ostream &	os,
		const std::map< uint, IndexRange > &	map
	)

template<class _Tp , class _Ref , class _Ptr >

bool concepts::operator<=	(	const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &	__x,
		const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &	__y
	)		`[inline]`

Definition at line 200 of file matrixIterator.hh.

template<class _Tp , class _RefL , class _PtrL , class _RefR , class _PtrR >

bool concepts::operator<=	(	const _Matrix_iterator_base< _Tp, _RefL, _PtrL > &	__x,
		const _Matrix_iterator_base< _Tp, _RefR, _PtrR > &	__y
	)		`[inline]`

Definition at line 208 of file matrixIterator.hh.

template<class _Tp , class _RefL , class _PtrL , class _RefR , class _PtrR >

bool concepts::operator==	(	const _Matrix_iterator_base< _Tp, _RefL, _PtrL > &	__x,
		const _Matrix_iterator_base< _Tp, _RefR, _PtrR > &	__y
	)		`[inline]`

Definition at line 138 of file matrixIterator.hh.

Here is the call graph for this function:

template<class _Tp , class _Ref , class _Ptr >

bool concepts::operator==	(	const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &	__x,
		const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &	__y
	)		`[inline]`

Definition at line 128 of file matrixIterator.hh.

Here is the call graph for this function:

template<class F >

bool concepts::operator==	(	const Array< F > &	x,
		const Array< F > &	y
	)		`[inline]`

Definition at line 323 of file array.hh.

Here is the call graph for this function:

template<class F >

bool concepts::operator==	(	const Array< F > &	x,
		F &	y
	)		`[inline]`

Definition at line 334 of file array.hh.

Here is the call graph for this function:

template<class F >

bool concepts::operator==	(	F &	y,
		const Array< F > &	x
	)		`[inline]`

Definition at line 344 of file array.hh.

template<class F , int dim>

bool concepts::operator==	(	const Point< F, dim > &	x,
		const Point< F, dim > &	y
	)		`[inline]`

Definition at line 209 of file vectorsMatrices.hh.

template<class _Tp , class _Ref , class _Ptr >

bool concepts::operator>	(	const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &	__x,
		const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &	__y
	)		`[inline]`

Definition at line 184 of file matrixIterator.hh.

template<class _Tp , class _RefL , class _PtrL , class _RefR , class _PtrR >

bool concepts::operator>	(	const _Matrix_iterator_base< _Tp, _RefL, _PtrL > &	__x,
		const _Matrix_iterator_base< _Tp, _RefR, _PtrR > &	__y
	)		`[inline]`

Definition at line 192 of file matrixIterator.hh.

template<class _Tp , class _Ref , class _Ptr >

bool concepts::operator>=	(	const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &	__x,
		const _Matrix_iterator_base< _Tp, _Ref, _Ptr > &	__y
	)		`[inline]`

Definition at line 216 of file matrixIterator.hh.

template<class _Tp , class _RefL , class _PtrL , class _RefR , class _PtrR >

bool concepts::operator>=	(	const _Matrix_iterator_base< _Tp, _RefL, _PtrL > &	__x,
		const _Matrix_iterator_base< _Tp, _RefR, _PtrR > &	__y
	)		`[inline]`

Definition at line 224 of file matrixIterator.hh.

template<class F >

void concepts::operator>>	(	std::istream &	is,
		BaseSet< F > &	set
	)

Definition at line 129 of file set.hh.

template<class F >

void concepts::operator>>	(	std::istream &	is,
		BaseSequence< F > &	seq
	)

Definition at line 121 of file sequence.hh.

template<typename T >

std::ostream& concepts::outputMatlab	(	std::ostream &	os,
		const std::complex< T > &	val
	)

Definition at line 34 of file outputMatlab.hh.

Here is the call graph for this function:

std::ostream& concepts::outputMatlab	(	std::ostream &	os,
		const TMatrix< Real > &	T
	)		`[inline]`

Function for output of T-Matrix to Matlab.

example use: outputMatlab(std::cout << "T = ",T) << std::endl;

Definition at line 20 of file outputMatlab.hh.

Here is the call graph for this function:

template<typename T >

std::ostream& concepts::outputMatlab	(	std::ostream &	os,
		const T &	val
	)

Function for output of basic types to matlab.

example use: outputMatlab(std::cout << "x = ",x) << std::endl;

Definition at line 28 of file outputMatlab.hh.

std::ostream& concepts::outputMatlab	(	std::ostream &	os,
		const TMatrixBase< Real > &	T
	)		`[inline]`

Function for output of T-Matrix base class to Matlab.

example use: outputMatlab(std::cout << "T = ",T) << std::endl;

Definition at line 70 of file outputMatlab.hh.

Here is the call graph for this function:

template<class F >

void concepts::pointerOutput	(	std::ostream &	os,
		F *	val
	)

Definition at line 25 of file pointerOutput.hh.

template<class F >

void concepts::pointerOutput	(	std::ostream &	os,
		const F *	val
	)

Definition at line 19 of file pointerOutput.hh.

template<class F >

void concepts::pointerOutput	(	std::ostream &	os,
		const F &	val
	)

Definition at line 14 of file pointerOutput.hh.

template<class F >

void concepts::pointerOutput	(	std::ostream &	os,
		const Array< F > &	array
	)

Definition at line 383 of file array.hh.

Here is the call graph for this function:

template<class F , int dim>

Mapping<F,dim>& concepts::prodTranspose ( Mapping< F, dim > & m )

Definition at line 44 of file operations.hh.

Here is the call graph for this function:

template<class F , int dim>

Mapping<F,dim> concepts::prodTranspose ( const Mapping< F, dim > & m )

Definition at line 48 of file operations.hh.

Here is the call graph for this function:

template<class F , class G >

G& concepts::product	(	const F &	m,
		G &	v
	)

Definition at line 34 of file operations.hh.

template<class F , class G >

G concepts::product	(	const F &	m,
		const G &	v
	)

Definition at line 39 of file operations.hh.

Sequence<Real> concepts::realSeqFromStringWithPower ( const std::string s )

Converts a string to a sequence of real numbers, where a power may be allowed to express, e.g., negative powers of 2.

The string "1.0 2e-8 2p-2" results in Sequence(1, 2e-08, 0.25)

std::string concepts::removeAllWhite ( const std::string str )

Removes all white space in the string str.

template<class F , class G >

F* concepts::securePointer	(	F &	value,
		G *	matrix
	)

Templated function, which prevent a pointer to a temporary value got from constant matrices with index operator .

Author:: Kersten Schmidt, 2005

Definition at line 260 of file matrixIterator.hh.

template<class F , class G >

F* concepts::securePointer	(	const F	value,
		const G *	matrix
	)

Definition at line 263 of file matrixIterator.hh.

char * concepts::shorten ( const char * FILE )

Shortens the string to the given size.

The last part of the string is printed, the first part might be skipped. This is used by the macros DP, DPL and DEBUGL.

template<typename F >

void concepts::sparseLineToArrays	(	std::map< int, F > &	line,
		F *	a,
		int *	asub
	)

This function converts a sparse line to an array of values and an array of indices.

Author:: , Kersten Schmidt, 2005

Definition at line 54 of file CRS.hh.

Sequence<std::string> concepts::splitbySemicolon ( const std::string s )

Definition at line 21 of file asympEdges.hh.

std::vector<std::string> concepts::splitString	(	const std::string	text,
		const std::string	separators
	)

Split the string text string into words, where the separation token are included in separators.

std::vector<std::string> concepts::splitStringByComma ( const std::string text )

Split a strings in words separated by commas while respecting the bracket hierachies.

It splits "Ellipse(1.0, 4), Circle()" into "Ellipse(1.0, 4)" and "Circle()".

std::vector<std::string> concepts::splitStringNameParams ( const std::string text )

Split a string like "Ellipse(1.0, 4)" into "Ellipse", "1.0", "4".

template<class F >

void concepts::storeDenseMatrixToMatlab	(	F &	matrix,
		const uint	nofRows,
		const uint	nofCols,
		std::ostream &	ofs,
		std::string	name = `""`
	)

Writes a matrix to the stream ofs as dense matrix name in Matlab format.

Its applicable for any concepts::Matrix and for concepts::ElementMatrix as well.

Returns:: true if the writing to the file was successfull

Author:: Kersten Schmidt, 2005

Definition at line 60 of file outputMatlab.hh.

Here is the call graph for this function:

template<class F >

bool concepts::storeDenseMatrixToMatlab	(	F &	matrix,
		const uint	nofRows,
		const uint	nofCols,
		const std::string	filename,
		std::string	name = `""`,
		bool	append = `false`
	)

Stores a matrix to the matlab file filename as dense matrix name.

If append is false, overwrite old file, if already existed.

Its applicable for any concepts::Matrix and for concepts::ElementMatrix as well.

Returns:: true if the writing to the file was successfull

Author:: Kersten Schmidt, 2005

Definition at line 30 of file outputMatlab.hh.

template<class F >

void concepts::storeSparseMatrixToOctave	(	SparseMatrix< F > &	matrix,
		std::ostream &	ofs,
		std::string	name = `""`
	)

Writes a matrix to the stream ofs as dense matrix name in Octave format (older version don't have sparse matrix format).

Its applicable for any concepts::Matrix and for concepts::HashedSMatrix as well.

Returns:: true if the writing to the file was successfull

Author:: Kersten Schmidt, 2005

Definition at line 96 of file outputMatlab.hh.

Here is the call graph for this function:

template<class F >

std::string concepts::stringSubs	(	const std::string	str,
		const std::string	var,
		F	value
	)

Substitute all occurances of a substring var of a string str by value which may be for example a real or another string.

Definition at line 78 of file stringFunc.hh.

std::string concepts::stringtolower ( const std::string s )

char concepts::tolower ( const char ch )

template<class F , int dim>

Mapping<F,dim>& concepts::transpose ( Mapping< F, dim > & m )

Definition at line 52 of file operations.hh.

Here is the call graph for this function:

template<class F , int dim>

Mapping<F,dim> concepts::transpose ( const Mapping< F, dim > & m )

Definition at line 56 of file operations.hh.

Here is the call graph for this function:

Variable Documentation

uint concepts::storeDenseMatrixMatlabCounter_ = 0 [static]

Counts number of Matlab outputs (used to uniquely name the matrices)

Definition at line 15 of file outputMatlab.hh.

uint concepts::storeSparseMatrixMatlabCounter_ = 0 [static]

Definition at line 16 of file outputMatlab.hh.

Namespaces

Classes

Typedefs

Enumerations

Functions

Variables

Detailed Description

Typedef Documentation

Enumeration Type Documentation

Function Documentation

Variable Documentation