1 classdef DetailedLeafNode < Greedy.DataTree.Detailed.ILeafNode
2 % tree node implementation
for a detailed data structure holding a reduced
3 % basis and a collateral reduced basis.
7 % interpolation data
for all interpolated operators
11 % data
for the three unknowns (saturation, velocity, pressure)
17 function rbeiddn = DetailedLeafNode(model_data)
19 % constructor initializing the detailed data node
21 rbeiddn = rbeiddn@Greedy.DataTree.Detailed.ILeafNode(model_data);
25 function siz = get_rb_size(this)
26 siz = create_tree(this.rb, ...
27 DataTree.ScalarGreator(@(X) get_rb_size(X)), ...
31 function siz = get_ei_size(this)
32 siz = create_tree(this.ei, ...
33 DataTree.ScalarGreator(@(X) get_ei_size(X)), ...
37 function node = get_active_leaf(this, model,
id)
38 % function node = get_active_leaf(this, model,
id)
39 % @copybrief DataTree.INode.get_active_leaf()
41 % @copydetails DataTree.INode.get_active_leaf()
44 % node: of type Greedy.DataTree.Detailed.ILeafNode
48 node = get_active_leaf(this.rb, model,
id);
51 function [ot1, ot2, ot3] = offtime(this, rmodel)
52 [ot3, ot1, ot2] = offtime(this.rb, rmodel);
53 [ot1, ot2, temp] = offtime(this.ei, rmodel);
57 function delete_rb(this, index)
58 % function delete_rb(this, index)
59 % @copybrief Greedy.DataTree.Detailed.RBLeafNode.delete_rb()
61 % @copydetails Greedy.DataTree.Detailed.RBLeafNode.delete_rb()
62 delete_rb(this.rb, index);