2 %
class generating the reduced basis space for the
LinEvol problem with a
5 % The constructor argument
'bg_descr' of type
BasisGenDescr can define the
6 %
Greedy algorithm to be used. (#bg_algorithm)
10 % the reduced basis space.
17 % constructor constructing the reduced basis spaces and storing it in a
25 dd.
datatree = gen_detailed_data(dd.bg_algorithm, rmodel, model_data);
32 function rb_size = get_rb_size(
this, rmodel)
33 leaf_dd = get_leaf(this, rmodel);
34 rb_size = get_rb_size(leaf_dd);
Interface class for all kind of reduced basis generation algorithms
reduced model for linear evolution problems as given by a LinEvol.DetailedModel.
Greedy.DataTree.Detailed.INode datatree
the actual generated data tree
Reduced basis implementation for linear evolution equations.
Struct with control fields for the reduced basis generation.
an interface specialization for detailed data objects used with the Greedy algorithm.
Interface classes to be implemented by the Greedy.Algorithm user.
class generating the reduced basis space for the LinEvol problem with a Greedy algorithm.
Customizable implementation of an abstract greedy algorithm.