Randomized least-squares with minimal oversampling and interpolation in general spaces

Numerical interpolation (65D05) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Interpolation in approximation theory (41A05) Algorithms for approximation of functions (65D15)

Cites Work

On the stability and accuracy of least squares approximations
High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
Some remarks on the Fejér problem for Lagrange interpolation in several variables
Divergence (Runge phenomenon) for least-squares polynomial approximation on an equispaced grid and mock-Chebyshev subset interpolation
Deterministic and stochastic error bounds in numerical analysis
The discretization problem for continuous frames
Function values are enough for \(L_2\)-approximation. II
Hyperbolic cross approximation. Lecture notes given at the courses on constructive approximation and harmonic analysis, Barcelona, Spain, May 30 -- June 3, 2016
Entropy numbers and Marcinkiewicz-type discretization
On optimal recovery in \(L_2\)
Optimal pointwise sampling for \(L^2\) approximation
\(L_2\)-norm sampling discretization and recovery of functions from RKHS with finite trace
A simple upper bound for Lebesgue constants associated with Leja points on the real line
A new upper bound for sampling numbers
On sampling discretization in \(L_2\)
Optimal sampling and Christoffel functions on general domains
Function values are enough for \(L_2\)-approximation
Worst-case recovery guarantees for least squares approximation using random samples
Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
A few remarks on sampling of signals with small spectrum
A sharp upper bound for sampling numbers in \(L_2\)
On the Stability of Polynomial Interpolation Using Hierarchical Sampling
Impossibility of Fast Stable Approximation of Analytic Functions from Equispaced Samples
The Equivalence of Two Extremum Problems
Exponential frames on unbounded sets
Interpolation Processes
Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time
Optimal weighted least-squares methods
An SDP-based algorithm for linear-sized spectral sparsification
Near-Optimal Sampling Strategies for Multivariate Function Approximation on General Domains
Boosted optimal weighted least-squares
Sparse Polynomial Approximation of High-Dimensional Functions
Multivariate approximation of functions on irregular domains by weighted least-squares methods
A Note on Sampling Recovery of Multivariate Functions in the Uniform Norm
APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
Twice-ramanujan sparsifiers
Adaptive Approximation by Optimal Weighted Least-Squares Methods
Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs
Optimal sampling rates for approximating analytic functions from pointwise samples
An Adaptive Sampling and Domain Learning Strategy for Multivariate Function Approximation on Unknown Domains
Graph Sparsification by Effective Resistances
Constructive subsampling of finite frames with applications in optimal function recovery

This page was built for publication: Randomized least-squares with minimal oversampling and interpolation in general spaces