On the reconstruction of functions from values at subsampled quadrature points
DOI10.1090/mcom/3896arXiv2208.13597MaRDI QIDQ6140848
Lutz Kämmerer, Felix Bartel, Daniel Potts, Tino Ullrich
Publication date: 2 January 2024
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.13597
samplingFFTMarcinkiewicz-Zygmund inequalitysubsamplingfunction approximationrank-1 latticezz least squares
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Trigonometric approximation (42A10) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Multidimensional problems (41A63) Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25) Sampling theory in information and communication theory (94A20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sampling on energy-norm based sparse grids for the optimal recovery of Sobolev type functions in \(H^\gamma\)
- On the stability and accuracy of least squares approximations
- Marcinkiewicz-Zygmund measures on manifolds
- User-friendly tail bounds for sums of random matrices
- Sampling, Marcinkiewicz-Zygmund inequalities, approximation, and quadrature rules
- Approximation of mixed order Sobolev functions on the \(d\)-torus: asymptotics, preasymptotics, and \(d\)-dependence
- A fast algorithm for nonequispaced Fourier transforms on the rotation group
- Fast spherical Fourier algorithms.
- The Marcinkiewicz-type discretization theorems
- Numerical Fourier analysis
- Fast algorithms for discrete polynomial transforms on arbitrary grids
- 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
- On optimal recovery in \(L_2\)
- \(L_2\)-norm sampling discretization and recovery of functions from RKHS with finite trace
- Fast approximation by periodic kernel-based lattice-point interpolation with application in uncertainty quantification
- Approximation of functions with small mixed smoothness in the uniform norm
- Sampling discretization and related problems
- A new upper bound for sampling numbers
- Lower bounds for integration and recovery in \(L_2\)
- On sampling discretization in \(L_2\)
- Function values are enough for \(L_2\)-approximation
- Bounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothness
- Worst-case recovery guarantees for least squares approximation using random samples
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- Efficient reconstruction of functions on the sphere from scattered data
- Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
- A sharp upper bound for sampling numbers in \(L_2\)
- Spherical Marcinkiewicz-Zygmund inequalities and positive quadrature
- A Christoffel function weighted least squares algorithm for collocation approximations
- Support Vector Machines
- Optimal weighted least-squares methods
- Function integration, reconstruction and approximation using rank-$1$ lattices
- Boosted optimal weighted least-squares
- Lattice Rules
- High-dimensional integration: The quasi-Monte Carlo way
- Constructive subsampling of finite frames with applications in optimal function recovery
- Sampling numbers of smoothness classes via \(\ell^1\)-minimization
This page was built for publication: On the reconstruction of functions from values at subsampled quadrature points
