rbmatlab  1.16.09
 All Classes Namespaces Files Functions Variables Modules Pages
DetailedData.m
2  % class generating the reduced basis space for the LinEvol problem with a
3  % Greedy algorithm.
4  %
5  % The constructor argument 'bg_descr' of type BasisGenDescr can define the
6  % Greedy algorithm to be used. (#bg_algorithm)
7 
8  properties
9  % a basis generation algorithm of type Greedy.Interface used to generate
10  % the reduced basis space.
11  bg_algorithm;
12  end
13 
14  methods
15  function dd = DetailedData(rmodel, model_data)
16  % function dd = DetailedData(rmodel, model_data)
17  % constructor constructing the reduced basis spaces and storing it in a
19  %
20  % Parameters:
21  % rmodel: of type LinEvol.ReducedModel
22 
23  dd = dd@Greedy.User.IDetailedData(rmodel.bg_descr, model_data);
24 
25  dd.datatree = gen_detailed_data(dd.bg_algorithm, rmodel, model_data);
26  end
27 
28  end
29 
30  methods
31 
32  function rb_size = get_rb_size(this, rmodel)
33  leaf_dd = get_leaf(this, rmodel);
34  rb_size = get_rb_size(leaf_dd);
35  end
36 
37  end
38 end
Interface class for all kind of reduced basis generation algorithms
Definition: Interface.m:18
reduced model for linear evolution problems as given by a LinEvol.DetailedModel.
Definition: ReducedModel.m:18
Greedy.DataTree.Detailed.INode datatree
the actual generated data tree
Definition: IDetailedData.m:37
Reduced basis implementation for linear evolution equations.
Struct with control fields for the reduced basis generation.
Definition: dummyclasses.c:56
an interface specialization for detailed data objects used with the Greedy algorithm.
Definition: IDetailedData.m:19
Interface classes to be implemented by the Greedy.Algorithm user.
class generating the reduced basis space for the LinEvol problem with a Greedy algorithm.
Definition: DetailedData.m:18
Customizable implementation of an abstract greedy algorithm.
Definition: DuneRBLeafNode.m:1