Reduced Basis Greedy Selection Using Random Training Sets
DOI10.1051/m2an/2020004zbMath1444.62113arXiv1810.09344OpenAlexW2999070312MaRDI QIDQ3304879
No author found.
Publication date: 3 August 2020
Published in: ESAIM: Mathematical Modelling and Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.09344
random samplingentropy numbersKolmogorov \(n\)-widthsreduced basesperformance boundssparse high-dimensional polynomial approximation
Computational learning theory (68Q32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Numerical interpolation (65D05) Dependence of solutions to PDEs on initial and/or boundary data and/or on parameters of PDEs (35B30) Rate of convergence, degree of approximation (41A25) Complexity and performance of numerical algorithms (65Y20) Manifolds of mappings (58D15) Neural nets and related approaches to inference from stochastic processes (62M45)
Related Items (13)
Cites Work
- Unnamed Item
- Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs
- Reduced basis approximation and a posteriori error estimation for affinely parametrized elliptic coercive partial differential equations. Application to transport and continuum mechanics.
- A priori convergence theory for reduced-basis approximations of single-parameter elliptic partial differential equations
- The Marcinkiewicz-type discretization theorems
- Global a priori convergence theory for reduced-basis approximations of single-parameter symmetric coercive elliptic partial differential equations
- Greedy algorithms for reduced bases in Banach spaces
- A prioriconvergence of the Greedy algorithm for the parametrized reduced basis method
- Sparse polynomial approximation of parametric elliptic PDEs. Part I: affine coefficients
- ANALYTIC REGULARITY AND POLYNOMIAL APPROXIMATION OF PARAMETRIC AND STOCHASTIC ELLIPTIC PDE'S
- Convergence Rates for Greedy Algorithms in Reduced Basis Methods
- Multivariate Approximation in Downward Closed Polynomial Spaces
- Approximation of high-dimensional parametric PDEs
- Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs
This page was built for publication: Reduced Basis Greedy Selection Using Random Training Sets