rbmatlab  1.16.09
 All Classes Namespaces Files Functions Variables Modules Pages
ILeafNode.m
2  % interface specialization for a leaf element in a DataTree returned by the
3  % Greedy basis generation algorithms
4 
5  methods
6  function ddlni = ILeafNode(model_data)
7  % function ddlni = ILeafNode(model_data)
8  % constructor for such a leaf element
9  ddlni = ddlni@IDetailedData(struct([]), model_data);
10  end
11 
12 % function active_leaf = get_active_leaf(this, dmodel)
13 % % function active_leaf = get_active_leaf(this, dummy)
14 % % @copybrief .Greedy.DataTree.Detailed.INode.get_active_leaf()
15 % %
16 % % @copydetails .Greedy.DataTree.Detailed.INode.get_active_leaf()
17 % %
18 % % Return values:
19 % % active_leaf: of type Greedy.DataTree.Detailed.ILeafNode
20 % active_leaf = this;
21 % end
22 
23  end
24 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
Interface for a leaf node of a data tree.
Definition: ILeafNode.m:18
DataTree specialization for detailed data generated by a Greedy algorithm instance.
Definition: DuneRBLeafNode.m:3
Definition: leaf.m:17
Interface class for general data tree nodes storing detailed data returned by Greedy.Interface.gen_detailed_data()
Definition: INode.m:20
Customizable implementation of an abstract greedy algorithm.
Definition: DuneRBLeafNode.m:1
Interface class for the generation and storage of reduced basis spaces as described in Module (M2)...
Definition: IDetailedData.m:17