2 % tree node implementation
for a detailed data structure holding a reduced
8 % matrix of size
'H x N' holding the Dof vectors of the reduced basis
9 % snapshot vectors spanning the reduced basis space `{\cal W}_{\text{red}}
12 % This should be a
class as well, as it might be stored outside of matlab.
19 function rbdd = DuneRBLeafNode(model_data,
id)
21 % constructor initializing the reduced data node
25 rbdd.mexptr = model_data.mexptr;
28 function siz = get_rb_size(
this)
29 siz = this.mexptr('get_rb_size');
32 function [ot1, ot2, ot3] = offtime(this, rmodel)
34 ot1 = offtime(this.info, rmodel.N);
35 % ot1 = sum(this.info.toc_value_sequence(1:rmodel.N-1));
40 function siz = get_ei_size(this)
44 function this = delete_rb(this, index)
45 % function this = delete_rb(this, index)
46 % delete selected basis functions from the reduced basis
49 % index: basis functions indices to be removed
50 this.mexptr('clear_rb');
interface specialization for a leaf element in a DataTree returned by the Greedy basis generation alg...
DataTree implementation for generated detailed and reduced data
tree node implementation for a detailed data structure holding a reduced basis
DataTree specialization for detailed data generated by a Greedy algorithm instance.
Customizable implementation of an abstract greedy algorithm.