Convergence Rates of the POD–Greedy Method

166 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Model Order Reduction in Fluid Dynamics: Challenges and Perspectives (2014, result): “Results regarding the connection between n-width decay rates and greedy algorithm converges rates can be found in [18, 22] for parametric problems, in [55] for time-dependent problems, and results regarding the n-width decay rates for parameter-dependent elliptic PDEs in [77, 86].”
Survey of multifidelity methods in uncertainty propagation, inference, and optimization (2018, background): “POD is a popular basis generation method because it applies to a wide range of problems, including time-dependent and nonlinear problems [39, 91, 119, 120, 186].”
Nonlinear reduced basis approximation of parameterized evolution equations via the method of freezing (2013, unknown): “…soit satisfaite. d’équations aux derivées partielles algébriques pour v ( t ) et par une équation differentielle ordinaire pour g ( t ) . remplace l’équation originelle de départ Pour v ( t ) , le système est donné par (5), où, pour les élements h de l’algèbre de Lie L G Pour illustrer le…”
Multifidelity importance sampling (2016, background): “There are several sampling schemes available to guide the selection of the snapshots [37, 38, 39]; however, for this example sampling from a uniform distribution in the input domain is sufficient.”