2 % detailed data node implementation storing a collateral reduced basis space
3 % and interpolation DOFs
6 % a unique identifier
for the parameterized
function or
operator
9 % the collateral reduced basis functions `q_m`
12 % the interpolation DOFs `\tau^{EI}_m`
15 % the interpolation matrix `{\bf B}`
18 % nodal basis functions `\xi_m`
22 % interpolation basis was generated.
26 properties (SetAccess =
private, Dependent)
27 % dimension of the collateral reduced basis space
32 function eidd =
EILeafNode(ei_plugin, model_data)
33 %
function eidd =
EILeafNode(eidetailed, model_data)
34 % constructor initializing the empirical interpolation data node
37 % ei_plugin: the plugin
object of type
Greedy.
Plugin.
EI creating
this
38 % detailed data data node
40 eidd.id = ei_plugin.id;
41 eidd.ophandle = ei_plugin.generator.ophandle;
44 function [ot1, ot2, ot3] = offtime(
this, rmodel)
45 % returns different offline time measurements
47 % dmodel = rbmodel.detailed_model;
50 % Mspace = info.M_train;
52 %
for muind = 1:size(Mspace, 1)
53 % set_mu( dmodel, Mspace(mu_ind,:) );
54 % [LU, tt] = generate(eigen, dmodel,
this);
59 ot2 = this.info.elapsed_time;
63 function M =
get.M(
this)
67 function siz = get_ei_size(
this)
68 siz = size(this.QM, 2);
71 function siz = get_rb_size(this)
Interface for a localized operator that fulfills the so-called -independent DOF dependence.
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.
Implementation of a SnapshotsGenerator.Cached for empirical basis generation. The generate() method r...
Specialization plugins for the greedy algorithm.
Cacheable generators of detailed data snapshots.
Plugin for the Greedy.Algorithm class generating a collateral reduced basis space plus interpolation ...
detailed data node implementation storing a collateral reduced basis space and interpolation DOFs ...
Customizable implementation of an abstract greedy algorithm.