2 %
interface specialization for a reduced model that can be used with the
3 %
Greedy algorithm
for basis generation.
8 % constructor
for this reduced model interface
10 % This constructor is forwarded to the
IReducedModel base
class.
17 function reduced_data = gen_reduced_data(rmodel, detailed_data)
18 %
function reduced_data = gen_reduced_data(rmodel, detailed_data)
19 % @copybrief .IReducedModel.gen_reduced_data()
21 % @copydetails .IReducedModel.gen_reduced_data()
24 % whose leafs are generated by
25 %
'rmodel.bg_descr.reduced_data_constructor'.
37 %
function set_M_on_tree(
this, datatree)
39 % tree_mode = isa(rmodel.M,
'DataTree.INode');
40 % tree_descr = get_leaf_description(datatree);
41 %
for leaf_descr = tree_descr
42 %
leaf =
get(datatree, leaf_descr.basepath);
52 function rb_sim_data = rb_simulation(rmodel, reduced_data)
53 %
function rb_sim_data = rb_simulation(rmodel, reduced_data)
54 % forwards the reduced simulation to the method rb_simulation_impl()
55 % after getting a suitable reduced data
leaf element.
57 % @copydetails .IReducedModel.rb_simulation()
62 reduced_data_leaf = get_leaf(reduced_data, rmodel);
63 rb_sim_data = rb_simulation_impl(rmodel, reduced_data_leaf);
70 %
function rb_sim_data = rb_simulation_impl(rmodel, reduced_data)
71 % implementation of the reduced simulation
77 % rb_sim_data: structure holding the coefficient vectors of the reduced
78 % simulations and optional error estimators.
79 rb_sim_data = rb_simulation_impl(rmodel, reduced_data);
a default reduced data implementation which stores a data tree object copying the structure of a Gree...
Interface for leaf nodes of the DataTree in Greedy.User.ReducedData objects.
an interface specialization for detailed data objects used with the Greedy algorithm.
Interface classes to be implemented by the Greedy.Algorithm user.
This is the interface for a reduced model providing methods to compute low dimensional reduced simula...
Customizable implementation of an abstract greedy algorithm.
interface specialization for a reduced model that can be used with the Greedy algorithm for basis gen...