(M2) Reduced basis generation

Detailed Description

Implementation of algorithms and data structures for the generation and storage of reduced basis spaces.

This module provides

• common tools useful for the implemenation of basis generation algorithms like
  • (adaptively refineable) finite parameter sets or
  • structures to cache detailed simulations on a hard-drive
• and actual implementations of customizable basis generation algorithms like the Greedy algorithm.

The routines and data structure from this module can therefore be used to ease the implementation of an IDetailedData class as described in Module (M3).

Collaboration diagram for (M2) Reduced basis generation:

Classes
class	Greedy.User.IDetailedData
	an interface specialization for detailed data objects used with the Greedy algorithm. More...
class	Test.DetailedData
	class generating the reduced basis space for the LinEvol problem with a Greedy algorithm. More...
class	SimpleDetailedData
	a very simple detailed data implementation gathering several detailed snapshots spanning the reduced basis space. More...

Namespaces
	Greedy
	Customizable implementation of an abstract greedy algorithm.
	ParameterSampling
	Parameter sampling sets.
	SnapshotsGenerator
	Cacheable generators of detailed data snapshots.