How To Best Sample a Solution Manifold?
DOI10.1007/978-3-319-19749-4_11zbMath1336.65188arXiv1503.00307OpenAlexW1510783914MaRDI QIDQ2799929
Publication date: 14 April 2016
Published in: Sampling Theory, a Renaissance (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.00307
convergencenumerical exampleGalerkin methodsingular perturbationstabilizationconvection-diffusion problemsolution manifoldmodel reductionreduced basis methodKolmogorov \(n\)-widthweakd greedy algorithm
Boundary value problems for second-order elliptic equations (35J25) Singular perturbations in context of PDEs (35B25) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Dependence of solutions to PDEs on initial and/or boundary data and/or on parameters of PDEs (35B30)
Related Items
Cites Work
- Stabilized reduced basis method for parametrized advection-diffusion PDEs
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- A class of discontinuous Petrov-Galerkin methods. I: The transport equation
- Reduced basis approximation and a posteriori error estimation for affinely parametrized elliptic coercive partial differential equations. Application to transport and continuum mechanics.
- On the stability of the reduced basis method for Stokes equations in parametrized domains
- Approximate symmetrization and Petrov-Galerkin methods for diffusion- convection problems
- Weak greedy algorithms
- Greedy algorithms for reduced bases in Banach spaces
- Approximation and learning by greedy algorithms
- ``Natural norm a posteriori error estimators for reduced basis approximations
- Adaptivity and variational stabilization for convection-diffusion equations
- A prioriconvergence of the Greedy algorithm for the parametrized reduced basis method
- REDUCED BASISA POSTERIORIERROR BOUNDS FOR THE STOKES EQUATIONS IN PARAMETRIZED DOMAINS: A PENALTY APPROACH
- A class of discontinuous Petrov-Galerkin methods. II. Optimal test functions
- Convergence Rates for Greedy Algorithms in Reduced Basis Methods
- An optimal control approach to a posteriori error estimation in finite element methods
- Mixed and Hybrid Finite Element Methods
- Certified Reduced Basis Methods for Parametrized Saddle Point Problems
- Adaptive Petrov--Galerkin Methods for First Order Transport Equations
- A posteriorierror bounds for reduced-basis approximations of parametrized parabolic partial differential equations
- A Uniform Analysis of Nonsymmetric and Coercive Linear Operators
- Variational Multiscale Analysis: the Fine‐scale Green’s Function, Projection, Optimization, Localization, and Stabilized Methods
- Double greedy algorithms: Reduced basis methods for transport dominated problems
- Robust A Posteriori Error Estimates for Stationary Convection-Diffusion Equations
- First-Order System LL* (FOSLL*) for General Scalar Elliptic Problems in the Plane
This page was built for publication: How To Best Sample a Solution Manifold?