rbmatlab  1.16.09
 All Classes Namespaces Files Functions Variables Modules Pages
hp_rb_generation.m
1 function hp_model = hp_rb_generation(hp_model)
2 %function hp_model = hp_rb_generation(hp_model)
3 %
4 % generates a reduced basis for a parameter space partition
5 % needs a hp_model with computed h_refinment partion (function h_refinment)
6 
7 hp_model.tree = hp2(hp_model.tree);
8 
9  function tree_out = hp2(tree_in)
10  % function tree_out = hp2(tree_in,num_nodes,error2_tol)
11  % hp2 navigiert druch den baum der zwingend von hp1 generiert wurde
12  % und erzeugt die Basen
13 
14  t= iscell(tree_in);
15  % Naviagation durch den gesammten Baum
16  if t==1
17  tree_in{1}= hp2(tree_in{1});
18  tree_in{2} = hp2(tree_in{2});
19  tree_out=tree_in;
20  else
21 
22  % Basisgenerierung
23  tree_in.model.RB_stop_epsilon = hp_model.error_tol2;
24  tree_in.model.RB_stop_Nmax = inf;
25  tree_in.model.nr_extension_modes =hp_model.nr_extension_modes;
26 
27  % mit initalisierter Basis
28  %tree_in.model.use_generated_RB_basis = 1;
29  % mit nicht initalisierter Basis:
30  tree_in.model.use_generated_RB_basis = 0;
31 
32  % Basis genieren (Standart Greedy)
33  tree_in.detailed_data = rb_basis_generation(tree_in.model,tree_in.detailed_data);
34  %erster Parameter
35  tree_in.reduced_data = gen_reduced_data(tree_in.model,tree_in.detailed_data);
36 
37  tree_out = tree_in;
38 
39  end;
40 
41  end
42 
43 end
44 
Customizable implementation of an abstract greedy algorithm.
Definition: DuneRBLeafNode.m:1
function detailed_data = rb_basis_generation(model, detailed_data)
reduced basis construction with different methods