2 %
Test reduced data implementation
4 properties(SetAccess=
private)
5 % number of reduced basis vectors stored in
this data node.
8 % number of collateral reduced basis vectors stored in
this data node.
11 % number of collateral reduced basis vectors used
for error estimation.
16 function rd = ReducedData(rmodel, detailed_data)
17 % Constructor
for the generation of the reduced matrices and vectors.
20 error(
'Test.ReducedData constructor needs an argument');
21 elseif nargin == 2 && isa(rmodel,
'IReducedModel') ...
22 && isa(detailed_data,
'Test.ReducedData')
24 copy_extract(rd, copy, rmodel);
26 fill_fields(rd, rmodel, detailed_data);
28 error('Did not find constructor for your arguments');
32 function conds = get_conds(this)
33 disp('calling get_conds');
39 methods(Access=private)
41 function fill_fields(this, rmodel, detailed_data)
44 this.Mstrich = rmodel.Mstrich;
47 function copy_extract(this, copy, rmodel)
50 this.Mstrich = rmodel.Mstrich;
56 function yesno = needs_subset_copy(this, rmodel)
57 % function yesno = needs_subset_copy(this, rmodel)
58 % @copybrief ::
GreedyUser.IReducedDataNode.needs_subset_copy()
60 % @copydetails ::
GreedyUser.IReducedDataNode.needs_subset_copy()
65 yesno = rmodel.N ~= this.N || rmodel.M ~= this.M || this.Mstrich ~= rmodel.Mstrich;
a test model doing nothing
Interface for leaf nodes of the DataTree in Greedy.User.ReducedData objects.
Reduced basis implementation for non-linear evolution equations.
Test reduced basis implementation.
Interface classes to be implemented by the Greedy.Algorithm user.
Customizable implementation of an abstract greedy algorithm.