A new analysis of empirical interpolation methods and Chebyshev greedy algorithms
From MaRDI portal
Chebyshev greedy algorithmdictionary approximationempirical interpolation methodmetric entropy numbersparametrized PDEreduced basis greedy algorithm
Approximation by arbitrary nonlinear expressions; widths and entropy (41A46) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) General theory of numerical analysis in abstract spaces (65J05) Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs (65M12)
Cites work
- A DEIM induced CUR factorization
- A general multipurpose interpolation procedure: The magic points
- A generalized empirical interpolation method: application of reduced basis techniques to data assimilation
- A new selection operator for the discrete empirical interpolation method -- improved a priori error bound and extensions
- A posteriori error bounds for the empirical interpolation method
- A priori model reduction through proper generalized decomposition for solving time-dependent partial differential equations
- A reduced conjugate gradient basis method for fractional diffusion
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- A state space error estimate for POD-DEIM nonlinear model reduction
- A survey of projection-based model reduction methods for parametric dynamical systems
- A unified way of analyzing some greedy algorithms
- A ‘best points’ interpolation method for efficient approximation of parametrized functions
- An `empirical interpolation' method: Application to efficient reduced-basis discretization of partial differential equations
- Approximation and learning by greedy algorithms
- Approximation of high-dimensional parametric PDEs
- Approximation of parametric derivatives by the empirical interpolation method
- Banach space projections and Petrov-Galerkin estimates
- Certified reduced basis methods for parametrized partial differential equations
- Convergence analysis of the generalized empirical interpolation method
- Convergence rates for greedy algorithms in reduced basis methods
- Efficient and accurate nonlinear model reduction via first-order empirical interpolation
- Efficient model reduction of parametrized systems by matrix discrete empirical interpolation
- Entropy numbers, s-numbers, and eigenvalue problems
- Entropy-based convergence rates of greedy algorithms
- Galerkin Proper Orthogonal Decomposition Methods for a General Equation in Fluid Dynamics
- Greedy algorithms for reduced bases in Banach spaces
- Greedy algorithms in Banach spaces
- Greedy approximation
- Greedy approximation
- High-dimensional statistics. A non-asymptotic viewpoint
- scientific article; zbMATH DE number 6678650 (Why is no real title available?)
- scientific article; zbMATH DE number 44588 (Why is no real title available?)
- scientific article; zbMATH DE number 3626044 (Why is no real title available?)
- scientific article; zbMATH DE number 477682 (Why is no real title available?)
- scientific article; zbMATH DE number 713342 (Why is no real title available?)
- Interpolatory methods for model reduction
- Matching pursuits with time-frequency dictionaries
- Model reduction of dynamical systems on nonlinear manifolds using deep convolutional autoencoders
- Nonlinear model reduction via discrete empirical interpolation
- On greedy algorithm approximating Kolmogorov widths in Banach spaces
- Optimal Convergence Rates for the Orthogonal Greedy Algorithm
- Optimal stable nonlinear approximation
- Parameter multi-domain `hp' empirical interpolation
- Randomized Discrete Empirical Interpolation Method for Nonlinear Model Reduction
- Rates of convex approximation in non-Hilbert spaces
- Reduced basis approximation and a posteriori error estimation for affinely parametrized elliptic coercive partial differential equations. Application to transport and continuum mechanics.
- Reduced basis method for the rapid and reliable solution of partial differential equations
- Reduced basis methods for partial differential equations. An introduction
- Sharp Bounds on the Approximation Rates, Metric Entropy, and n-Widths of Shallow Neural Networks
- Some observations on Babuška and Brezzi theories
- Sparse approximation and recovery by greedy algorithms in Banach spaces
- Stability of discrete empirical interpolation and gappy proper orthogonal decomposition with randomized and deterministic sampling points
Cited in
(2)
This page was built for publication: A new analysis of empirical interpolation methods and Chebyshev greedy algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6994544)
