2 % an
interface specialization for @ref
IDetailedData "detailed data" objects
3 % used with the
Greedy algorithm.
5 % An implementation of
this interface stores its basis space functions in a
24 function detailed_data_leaf = get_leaf(
this, rmodel)
25 %
function reduced_data_leaf = get_leaf(
this, rmodel)
26 % returns the @ref .Greedy.DataTree.Detailed.ILeafNode
"data tree leaf node"
27 %
for a specific combination of parameters and time indices given by a
28 % @ref .IReducedModel
"reduced model".
31 % rmodel: of type .Greedy.User.IReducedModel
34 % detailed_data_leaf:
object of type .Greedy.DataTree.Detailed.ILeafNode
35 % which actually stores a reduced basis space.
37 dmodel = rmodel.detailed_model;
39 if isfield(dmodel.descr,
'nt')
45 detailed_data_leaf = get_by_description(this.datatree, dmodel);
Interface class for all kind of reduced basis generation algorithms
DataTree implementation for generated detailed and reduced data
DataTree specialization for detailed data generated by a Greedy algorithm instance.
an interface specialization for detailed data objects used with the Greedy algorithm.
Interface class for general data tree nodes storing detailed data returned by Greedy.Interface.gen_detailed_data()
Customizable implementation of an abstract greedy algorithm.
Interface class for the generation and storage of reduced basis spaces as described in Module (M2)...