Randomized least-squares with minimal oversampling and interpolation in general spaces
From MaRDI portal
Publication:6573780
DOI10.1137/23M160178XzbMATH Open1543.65022MaRDI QIDQ6573780FDOQ6573780
Authors: Matthieu Dolbeault, Moulay Abdellah Chkifa 
Publication date: 17 July 2024
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Recommendations
Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Algorithms for approximation of functions (65D15)
Cites Work
- The Equivalence of Two Extremum Problems
- Hyperbolic cross approximation. Lecture notes given at the courses on constructive approximation and harmonic analysis, Barcelona, Spain, May 30 -- June 3, 2016
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
- Graph sparsification by effective resistances
- Deterministic and stochastic error bounds in numerical analysis
- Interpolation Processes
- On the stability of polynomial interpolation using hierarchical sampling
- Impossibility of fast stable approximation of analytic functions from equispaced samples
- On the stability and accuracy of least squares approximations
- Twice-Ramanujan sparsifiers
- Divergence (Runge phenomenon) for least-squares polynomial approximation on an equispaced grid and mock-Chebyshev subset interpolation
- Constructing linear-sized spectral sparsification in almost-linear time
- An SDP-based algorithm for linear-sized spectral sparsification
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- A few remarks on sampling of signals with small spectrum
- Sparse Polynomial Approximation of High-Dimensional Functions
- Some remarks on the Fejér problem for Lagrange interpolation in several variables
- The discretization problem for continuous frames
- Optimal weighted least-squares methods
- Exponential frames on unbounded sets
- On sampling discretization in \(L_2\)
- Adaptive approximation by optimal weighted least-squares methods
- A note on sampling recovery of multivariate functions in the uniform norm
- On optimal recovery in \(L_2\)
- Function values are enough for \(L_2\)-approximation. II
- Function values are enough for \(L_2\)-approximation
- APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
- Entropy numbers and Marcinkiewicz-type discretization
- Optimal pointwise sampling for \(L^2\) approximation
- Near-optimal sampling strategies for multivariate function approximation on general domains
- \(L_2\)-norm sampling discretization and recovery of functions from RKHS with finite trace
- A new upper bound for sampling numbers
- Worst-case recovery guarantees for least squares approximation using random samples
- A sharp upper bound for sampling numbers in \(L_2\)
- A simple upper bound for Lebesgue constants associated with Leja points on the real line
- Multivariate approximation of functions on irregular domains by weighted least-squares methods
- Optimal sampling rates for approximating analytic functions from pointwise samples
- Optimal sampling and Christoffel functions on general domains
- Boosted optimal weighted least-squares
- An Adaptive Sampling and Domain Learning Strategy for Multivariate Function Approximation on Unknown Domains
- Constructive subsampling of finite frames with applications in optimal function recovery
Cited In (1)
This page was built for publication: Randomized least-squares with minimal oversampling and interpolation in general spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573780)
