rbmatlab  1.16.09
 All Classes Namespaces Files Functions Variables Modules Pages
RBLeafNode.m
1 classdef RBLeafNode < Greedy.DataTree.Detailed.ILeafNode
2  % tree node implementation for a detailed data structure holding a reduced
3  % basis
4 
5  properties
6  id;
7 
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}}
10  % \subset {\cal W}_h`
11  %
12  % This should be a class as well, as it might be stored outside of matlab.
13  RB;
14  end
15 
16  methods
17  function rbdd = RBLeafNode(model_data, id)
18  % function rbdd = RBLeafNode(model_data)
19  % constructor initializing the reduced data node
20 
21  rbdd = rbdd@Greedy.DataTree.Detailed.ILeafNode(model_data);
22  rbdd.id = id;
23  end
24 
25  function siz = get_rb_size(this)
26  siz = size(this.RB, 2);
27  end
28 
29  function [ot1, ot2, ot3] = offtime(this, rmodel)
30 
31  ot1 = offtime(this.info, rmodel.N);
32 % ot1 = sum(this.info.toc_value_sequence(1:rmodel.N-1));
33  ot2 = 0;
34  ot3 = 0;
35  end
36 
37  function siz = get_ei_size(this)
38  siz = 0;
39  end
40 
41  function this = delete_rb(this, index)
42  % function this = delete_rb(this, index)
43  % delete selected basis functions from the reduced basis
44  %
45  % Parameters:
46  % index: basis functions indices to be removed
47  this.RB = this.RB(:,setdiff(1:size(this.RB,2), index));
48  end
49  end
50 
51 end
interface specialization for a leaf element in a DataTree returned by the Greedy basis generation alg...
Definition: ILeafNode.m:20
DataTree implementation for generated detailed and reduced data
Definition: DuneRBLeafNode.m:2
DataTree specialization for detailed data generated by a Greedy algorithm instance.
Definition: DuneRBLeafNode.m:3
Customizable implementation of an abstract greedy algorithm.
Definition: DuneRBLeafNode.m:1