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.
17 function rbdd = RBLeafNode(model_data,
id)
18 %
function rbdd = RBLeafNode(model_data)
19 % constructor initializing the reduced data node
25 function siz = get_rb_size(
this)
26 siz = size(this.RB, 2);
29 function [ot1, ot2, ot3] = offtime(this, rmodel)
31 ot1 = offtime(this.info, rmodel.N);
32 % ot1 = sum(this.info.toc_value_sequence(1:rmodel.N-1));
37 function siz = get_ei_size(this)
41 function this = delete_rb(this, index)
42 % function this = delete_rb(this, index)
43 % delete selected basis functions from the reduced basis
46 % index: basis functions indices to be removed
47 this.RB = this.RB(:,setdiff(1:size(this.RB,2), index));
interface specialization for a leaf element in a DataTree returned by the Greedy basis generation alg...
DataTree implementation for generated detailed and reduced data
DataTree specialization for detailed data generated by a Greedy algorithm instance.
Customizable implementation of an abstract greedy algorithm.