CBasisGenDescr | Struct with control fields for the reduced basis generation |
CGreedy.LRFG.BasisInfo | |
CGreedy.Checkpoint | Helper class used to store and restore data tree objects at specified checkpoints |
▼CCopyable | |
►CAbstractModel.Model | MODEL Abstract model class |
►CARE.Model | MODEL Class that defines the assemble method which is used by both, the DetailedModel and the ReducedModel |
CARE.DefaultModel | DEFAULTMODEL |
►CDARE.Model | MODEL Main class for the DARE model |
CDARE.DefaultModel | DEFAULTMODEL |
Cdare_advection_diffusion | Implicit Euler discretization of a finite-difference convection-diffusion model |
►CARE.DetailedData | Implementation of the detailed data interface for the ARE |
CDARE.DetailedData | |
▼Cdynamicprops | |
►CIModel | This is the common interface for all models, detailed and reduced ones |
►CIDetailedModel | This is the interface for a detailed model providing methods to compute high dimensional simulation snapshots |
►CGreedy.User.IDetailedModel | This is and IDetailedModel interface specialization for detailed models that shall be suitable for Greedy algorithms |
►CGreedy.User.FVDetailedModelDefault | Interface specialization of an IDetailedModel ready to use with Greedy algorithms for (time dependent) Finite volume discretizations |
CLinEvol.DetailedModel | Detailed model for a linear evolution problem with a Finite volume discretization |
CLinEvolDune.DetailedModel | Detailed model for a linear evolution problem with a Finite volume discretization |
CNonlinEvol.DetailedModel | IDetailedModel implementation for a non linear evolution problem |
CTest.DetailedModel | Test model doing nothing |
CTwoPhaseFlow.DetailedModel | IDetailedModel implementation for a two phase flow system |
►CLinStat.DetailedModel | Detailed model for a linear stationary problem with a Finite element discretization |
CThermalBlock.DetailedModel | Detailed model for the Thermalblock problem |
CLinStatDune.DetailedModel | Detailed model for a linear stationary problem with a discretization implemented in Dune-RB |
►CIReducedModel | This is the interface for a reduced model providing methods to compute low dimensional reduced simulations based on a priori generated reduced basis spaces |
►CGreedy.User.IReducedModel | Interface specialization for a reduced model that can be used with the Greedy algorithm for basis generation |
►CLinEvol.ReducedModel | Reduced model for linear evolution problems as given by a LinEvol.DetailedModel |
CLinEvolDune.ReducedModel | Reduced model for linear evolution problems as given by a LinEvol.DetailedModel |
CNonlinEvol.ReducedModel | Reduced model for non-linear evolution problems as given by a NonlinEvol.DetailedModel |
CTwoPhaseFlow.ReducedModel | Reduced model for non-linear evolution problems as given by a TwoPhaseFlow.DetailedModel |
CLinStat.ReducedModel | Reduced model for linear stationary problems as given by a LinStat.DetailedModel |
CLinStatDune.ReducedModel | Reduced model for linear stationary problems as given by a LinStatDune.DetailedModel |
CTest.ReducedModel | Test model doing nothing |
▼Chandle | |
►CAbstractModel.DetailedData | |
CARE.DetailedData | Implementation of the detailed data interface for the ARE |
CAbstractModel.Model | MODEL Abstract model class |
►CAbstractModel.ModelData | |
►CARE.ModelData | Model data implementation for the ARE |
CDARE.ModelData | |
►CAbstractModel.RBSimData | |
►CARE.RBSimData | |
CDARE.RBSimData | |
►CAbstractModel.ReducedData | |
CARE.ReducedData | |
►CAbstractModel.SimData | |
►CARE.SimData | Simulation data for a solution to the ARE |
CARE.SimDataRec | |
CDARE.SimData | |
CDARE.SimDataRec | |
►CARE.GammaCalculation.GammaCalculatorInterface | BASE Basis class for the preparation and calculation of gamma Any subclass should also overwrite the |
CARE.GammaCalculation.Kernel | |
CARE.GammaCalculation.Lyapunov | LYAPUNOV This is the default implementation for the calculation of the gamma value |
CDARE.GammaCalculation.Kernel | |
CDARE.GammaCalculation.Lyapunov | LYAPUNOV Calculate the value of the inverse operator by solving the Lyapunov equation |
CDARE.GammaCalculation.PowerIteration | POWERITERATION Calculate the (approximate) value of gamma by applying a power iteration to the matrix H, where H is never formed explicitly but only vector products are calculated H*x |
CCacheableObject | Class which wraps an object pointer to an object that is stored somewhere on the hdd (in a cache) |
CDARE.ReducedData | |
►CDataTree.ICreator | Interface for a class used to create a new (sub-)tree from an old one with the DataTree.INode.create_tree() method |
►CDataTree.CreatorDefault | Default implementation of the DataTree.ICreator interface |
CDataTree.DummyMerger | Test implementation of an DataTree.ICreator that actually merges two trees together and creates new leaf elements out of the leafs of the two base trees |
CDataTree.NullCreator | Simple DataTree.ICreator copying the original tree and applying a custom function to its leafs returning nothing |
CDataTree.ScalarCreator | Simple DataTree.ICreator copying the original tree and applying a custom function to its leafs returning a scalar value |
CGreedy.User.ReducedData | Default reduced data implementation which stores a data tree object copying the structure of a Greedy.User.IDetailedData.datatree as returned by the greedy algorithm objects |
CNonlinEvol.ReducedData | Reduced data implementation for non-linear evolution problems with finite volume discretizations |
CTwoPhaseFlow.ReducedData | Reduced data implementation for non-linear evolution problems with finite volume discretizations |
CDataTree.LeafDescription | DataTree.ICreator implementation which does not create a tree, but a cell array of descriptions for all leafs in the tree |
►CDataTree.INode | Interface for a node in a DataTree |
►CDataTree.DefaultNode | Default implementation for a DataTree.INode |
►CDataTree.IdMapNode | Data Tree element which can be filtered by ids |
CFem.CompositeFunctionSpace | Composite function space for composition of FE function spaces on same grid |
CGreedy.DataTree.Detailed.IdMapNode | Specialization of detailed data tree node with an id map for its children |
CGreedy.DataTree.Reduced.IdMapNode | |
►CDataTree.PpartNode | |
CGreedy.DataTree.Detailed.PpartNode | |
CDataTree.TpartNode | Data Tree element which can be filtered by time instants |
►CDataTree.ILeafNode | Interface for a leaf node of a data tree |
CDataTree.DummyLeafNode | Dummy implementation for a DataTree.ILeafNode that stores a single data |
CFem.Lagrange.BubbleInfo | Scalar Lagrange FE functions (degree 1) with additional bubble function on triangular grid |
CFem.Lagrange.DefaultInfo | Scalar Lagrange FE functions on triangular grid |
►CGreedy.DataTree.Detailed.ILeafNode | Interface specialization for a leaf element in a DataTree returned by the Greedy basis generation algorithms |
CGreedy.DataTree.Detailed.DuneRBLeafNode | Tree node implementation for a detailed data structure holding a reduced basis |
CGreedy.DataTree.Detailed.EILeafNode | Detailed data node implementation storing a collateral reduced basis space and interpolation DOFs |
CGreedy.DataTree.Detailed.PODEILeafNode | Tree node implementation for a detailed data structure holding a reduced basis and a collateral reduced basis |
CGreedy.DataTree.Detailed.RBLeafNode | Tree node implementation for a detailed data structure holding a reduced basis |
CTwoPhaseFlow.DetailedLeafNode | Tree node implementation for a detailed data structure holding a reduced basis and a collateral reduced basis |
►CGreedy.User.IReducedDataNode | Interface for leaf nodes of the DataTree in Greedy.User.ReducedData objects |
CGreedy.DataTree.Reduced.SeparableFunctionNode | |
CGreedy.DataTree.Reduced.SeparableOperatorNode | |
CLinEvol.ReducedData | Reduced data implementation for linear evolution problems with finite volume discretizations |
CLinEvolDune.ReducedData | Reduced data implementation for linear evolution problems with finite volume discretizations |
CNonlinEvol.EiRbReducedDataNode | Reduced data implementation for non-linear evolution problems with finite volume discretizations |
CNonlinEvol.EiReducedDataNode | Implementation of a Greedy.User.IReducedDataNode storing reduced data depending on collateral reduced basis space information only (e.g. interpolation DOFs and a local grid) |
CNonlinEvol.RbReducedDataNode | Implementation of a Greedy.User.IReducedDataNode storing reduced data depending on reduced basis space information only. (e.g. reduced matrices of operators) |
CNonlinEvol.ReducedData | Reduced data implementation for non-linear evolution problems with finite volume discretizations |
CTest.ReducedData | Test reduced data implementation |
CTwoPhaseFlow.EiRbReducedDataNode | Reduced data implementation for non-linear evolution problems with finite volume discretizations |
CTwoPhaseFlow.EiReducedDataNode | Implementation of a Greedy.User.IReducedDataNode storing reduced data depending on collateral reduced basis space information only (e.g. interpolation DOFs and a local grid) |
CTwoPhaseFlow.RbReducedDataNode | Implementation of a Greedy.User.IReducedDataNode storing reduced data depending on reduced basis space information only. (e.g. reduced matrices of operators) |
CTwoPhaseFlow.ReducedData | Reduced data implementation for non-linear evolution problems with finite volume discretizations |
►CFem.IFemInfo | Abstract class for implementing finite elements. Fem info classes implementing this interface are compatible with Fem.DiscFunc |
CFem.CompositeFunctionSpace | Composite function space for composition of FE function spaces on same grid |
CFem.Lagrange.BubbleInfo | Scalar Lagrange FE functions (degree 1) with additional bubble function on triangular grid |
CFem.Lagrange.DefaultInfo | Scalar Lagrange FE functions on triangular grid |
►CGreedy.DataTree.Detailed.INode | Interface class for general data tree nodes storing detailed data returned by Greedy.Interface.gen_detailed_data() |
CGreedy.DataTree.Detailed.IdMapNode | Specialization of detailed data tree node with an id map for its children |
►CGreedy.DataTree.Detailed.IInjectableNode | |
CGreedy.DataTree.Detailed.TpartNode | |
CGreedy.DataTree.Detailed.ILeafNode | Interface specialization for a leaf element in a DataTree returned by the Greedy basis generation algorithms |
CGreedy.DataTree.Detailed.InfoNode | Very simple detailed data tree node with only one child |
CGreedy.DataTree.Detailed.PpartNode | |
CFem.BcInfo | Class for boundary condition information. Allows more flexible usage |
CFem.DiscFunc | Continous piecewise polynomial function of arbitrary dimension. Can be used for all finite elements (discrete function information class) implementing IFeminfo (e.g. Fem.Lagrange.DefaultInfo) |
CFem.OperatorsDefault | Fem operators can be obtained from stored components |
Cfemdiscfunc | Class representing a continous piecewise polynomial function of arbitrary dimension. DOFS correspond to the values of Lagrange-nodes |
Cfeminfo | Structure representing the fem-space information shared by all fem-functions. Implemented as handle class, in order to be linked into df-classes |
►CGreedy.DataTree.Info | DataTree.INode extension for data nodes that can store information on their generation process |
CGreedy.DataTree.Detailed.INode | Interface class for general data tree nodes storing detailed data returned by Greedy.Interface.gen_detailed_data() |
►CGreedy.Interface | Interface class for all kind of reduced basis generation algorithms |
CGreedy.Algorithm | Default greedy basis generation class |
CGreedy.Combined | Combines two or more instances of a Greedy.Interface class by executing them subsequently |
CGreedy.EiTpart | |
►CGreedy.MetaInterface | |
CGreedy.TrainingSetAdaptation | Greedy basis generation extension which adaptively refines the trainings parameter set |
CGreedy.LRFG.Algorithm | ALGORITHM The main implementation of the LRFG algorithm This algorithm is an implementation of the low-rank factor greedy algorithm as it was presented in the paper by A. Schmidt and B. Haasdonk (2016). It is a generic class which can be applied to all OOP models that implement a certain interface |
►CGreedy.LRFG.ModelInterface | |
CARE.Model | MODEL Class that defines the assemble method which is used by both, the DetailedModel and the ReducedModel |
►CGreedy.Plugin.Interface | Interface class for extension algorithms which define the basis extension routines used by the abstract Greedy algorithm class Greedy.Algorithm |
►CGreedy.Plugin.Default | Default implementation of a Greedy.Plugin.Interface interface class |
►CGreedy.Plugin.EICommon | Interface for Greedy.Plugin.Interface implementations generating an empirical interpolation basis |
►CGreedy.Plugin.EI | Plugin for the Greedy.Algorithm class generating a collateral reduced basis space plus interpolation DOFs and a local grid |
CGreedy.Plugin.EIPOD | Plugin for the Greedy.Algorithm class generating a collateral reduced basis space plus interpolation DOFs and a local grid |
CGreedy.Plugin.SummedEI | Plugin for the Greedy.Algorithm class generating collateral reduced basis space plus interpolation DOFs and a local grid for several different parameterized functions or operators |
►CGreedy.Plugin.PODCommon | Interface for Greedy.Plugin.Interface implementations generating an reduced basis space for parametrized partial differential equations |
CGreedy.Plugin.POD | Extension class implementing the POD-greedy algorithm extension routines |
CGreedy.Plugin.PODDune | Extension class implementing the POD-greedy algorithm extension routines |
CGreedy.Plugin.PODEI | Greedy.Plugin.Interface implementation that extends in each basis extension step, the reduced basis space and/or the collateral reduced basis space(s) |
►Cgridbase | Base class for all grid classes |
Ccubegrid | A hierarchical cubegrid of arbitrary dimension |
Conedgrid | One dimensional grid implementation |
Crectgrid | A cartesian rectangular grid in two dimensions with axis parallel elements |
Ctriagrid | A triangular conforming grid in two dimensions |
►CIDetailedData | Interface class for the generation and storage of reduced basis spaces as described in Module (M2) |
CGreedy.DataTree.Detailed.ILeafNode | Interface specialization for a leaf element in a DataTree returned by the Greedy basis generation algorithms |
►CGreedy.User.IDetailedData | Interface specialization for detailed data objects used with the Greedy algorithm |
CLinEvol.DetailedData | Class generating the reduced basis space for the LinEvol problem with a Greedy algorithm |
CNonlinEvol.DetailedData | Class generating the reduced basis space for the LinEvol problem with a Greedy algorithm |
CTest.DetailedData | Class generating the reduced basis space for the LinEvol problem with a Greedy algorithm |
CTwoPhaseFlow.DetailedData | Class generating the reduced basis space for the LinEvol problem with a Greedy algorithm |
►CSimpleDetailedData | Very simple detailed data implementation gathering several detailed snapshots spanning the reduced basis space |
CLinStat.DetailedData | So far, this only implements the SimpleDetailedData class |
►CILocalizedOperator | Interface for a localized operator that fulfills the so-called \(H\)-independent DOF dependence |
CFv.TwoPhase.DivergenceSpace | |
CFv.TwoPhase.GlobalSpace | |
CFv.TwoPhase.SaturationSpace | |
CFv.TwoPhase.VelocitySpace | |
CLocalizedOperatorDefault | |
►CIReducedData | Interface class for the generation and storage of offline matrices and vectors as described in Module (M3) |
CGreedy.DataTree.Reduced.IdMapNode | |
CGreedy.User.IReducedDataNode | Interface for leaf nodes of the DataTree in Greedy.User.ReducedData objects |
CGreedy.User.ReducedData | Default reduced data implementation which stores a data tree object copying the structure of a Greedy.User.IDetailedData.datatree as returned by the greedy algorithm objects |
CLinStat.ReducedData | Reduced data implementation for linear stationary problems with finite element discretizations |
CLinStatDune.ReducedData | Reduced data implementation for linear stationary problems of the form \(L_I u = f\) |
►CISeparableFunction | |
CSeparableFunctionDefault | |
►CISeparableOperator | |
CFv.TwoPhase.DivergenceSpace | |
CFv.TwoPhase.PressureMean | |
CFv.TwoPhase.VelocitySpace | |
Cldgdiscfunc | Ldg shape functions implementation |
Cldginfo | Structure for the information of a ldg-function |
►CParameterSampling.Interface | Interface for parameter sampling classes producing discrete parameter sample in the parameter space \({\cal M}\) |
►CParameterSampling.IRefineable | Interface class for parameter sample classes that allow the adaptive refinement of the sampling |
CParameterSampling.Uniform | Parameter sampling class with uniformly distributed parameters in the parameter space |
CParameterSampling.Prescribed | |
CParameterSampling.Random | Parameter sampling class producing randomly distributed parameter samples in sparameter space \({\cal M}\) |
CParameterSampling.Single | |
CPostprocess.StochasticAssessment.Assessment | Class used to compute reduced several reduced simulations over a huge parameter sample extracting useful information |
CPostprocess.StochasticAssessment.Output | Result class for computations executed by an Postprocess.StochasticAssessment.Assessment object |
CRbfInterpolant | Implements rbf interpolation by thin plate splines or gaussian |
►CSnapshotsGenerator.Cached | Interface for the storage and generation of detailed data that can be used to build reduced basis functions |
CSnapshotsGenerator.Random | Creates random Dof vectors (for testing purposes only!) |
►CSnapshotsGenerator.SpaceOpEvals | Implementation of a SnapshotsGenerator.Cached for empirical basis generation. The generate() method returns the evaluations of an operator or a function on the solution (trajectory) of a detailed simulation |
CSnapshotsGenerator.MergedSpaceOpEvals | This class combines two SnapshotsGenerator.SpaceOpEvals and produces the combination of both operator/function evaluations |
CSnapshotsGenerator.Trajectories | Implementation of a SnapshotsGenerator.Cached for reduced basis generation. The generate() method returns a detailed simulation |
CStokesReducedDataWrapper | Wrapper-class for reduced data containing big data |
►CVecMat.ICompositeMatrix | Handle class holding a cell array for a "composite-matrix" |
CVecMat.CompositeMatrixDefault | For block-diagonal matrices |
CVecMat.LUPQ_Handle | Handle for passing l-u-p-q-factors to functions |
CXPartMap | Geometric tree where every nodes has geometry information attached |
CGreedy.Plugin.InjectedTpart | |
▼CTwoPhaseData.Interface | |
CTwoPhaseData.BrooksCorey | |
CTwoPhaseData.Michel | |
CTwoPhaseData.MichelPrsLin | |
CTwoPhaseData.MichelSimple | |
Cleaf | |
CMatlabDocMaker | MatlabDocMaker: Class for information & tasks concerning the UQ-RB-Test documentation |
CModelData | Struct with high dimensional data needed for a high dimensional simulation |
CModelDescr | Struct with control fields for the analytical PDE functions, the discretization and the parametrization |
▼CRbReducedDataDefault | |
CGreedy.DataTree.Reduced.TpartNode | TPartReducedData |