mfherbst / ReducedBasis.jl

Reduced basis methods for parametrised eigenproblems
https://mfherbst.github.io/ReducedBasis.jl/stable/
MIT License
13 stars 0 forks source link

Generalize `POD` to general solvers and compression methods #39

Open pbrehmer opened 1 year ago

pbrehmer commented 1 year ago

In some cases an assembly strategy might be needed where first a basis is assembled (and orthogonalized) on a few selected points and only after that assembled using a greedy strategy.

One use case is e.g. Hamiltonians with conserved quantities that show a block-diagonal structure such that a greedy assembly with a initial snapshot within a certain conserved plateau might get stuck immediately. In these cases one could apply latin hypercube sampling.

pbrehmer commented 1 year ago

As an error estimate just provide the magnitude of the sum of neglected eigenvalues or sum of squared singular values, respectively (see Certified Reduced Basis Methods for Parametrized PDEs).