Randomized least-squares with minimal oversampling and interpolation in general spaces
From MaRDI portal
Publication:6573780
Recommendations
Cites work
- A few remarks on sampling of signals with small spectrum
- A new upper bound for sampling numbers
- A note on sampling recovery of multivariate functions in the uniform norm
- 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
- APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
- Adaptive approximation by optimal weighted least-squares methods
- An Adaptive Sampling and Domain Learning Strategy for Multivariate Function Approximation on Unknown Domains
- An SDP-based algorithm for linear-sized spectral sparsification
- Boosted optimal weighted least-squares
- Constructing linear-sized spectral sparsification in almost-linear time
- Constructive subsampling of finite frames with applications in optimal function recovery
- Deterministic and stochastic error bounds in numerical analysis
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- Divergence (Runge phenomenon) for least-squares polynomial approximation on an equispaced grid and mock-Chebyshev subset interpolation
- Entropy numbers and Marcinkiewicz-type discretization
- Exponential frames on unbounded sets
- Function values are enough for \(L_2\)-approximation
- Function values are enough for \(L_2\)-approximation. II
- Graph sparsification by effective resistances
- High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
- Hyperbolic cross approximation. Lecture notes given at the courses on constructive approximation and harmonic analysis, Barcelona, Spain, May 30 -- June 3, 2016
- Impossibility of fast stable approximation of analytic functions from equispaced samples
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- Interpolation Processes
- Multivariate approximation of functions on irregular domains by weighted least-squares methods
- Near-optimal sampling strategies for multivariate function approximation on general domains
- On optimal recovery in \(L_2\)
- On sampling discretization in \(L_2\)
- On the stability and accuracy of least squares approximations
- On the stability of polynomial interpolation using hierarchical sampling
- Optimal pointwise sampling for \(L^2\) approximation
- Optimal sampling and Christoffel functions on general domains
- Optimal sampling rates for approximating analytic functions from pointwise samples
- Optimal weighted least-squares methods
- Some remarks on the Fejér problem for Lagrange interpolation in several variables
- Sparse Polynomial Approximation of High-Dimensional Functions
- The Equivalence of Two Extremum Problems
- The discretization problem for continuous frames
- Twice-Ramanujan sparsifiers
- Worst-case recovery guarantees for least squares approximation using random samples
- \(L_2\)-norm sampling discretization and recovery of functions from RKHS with finite trace
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)