Nonlinear approximation in bounded orthonormal product bases
DOI10.1007/s43670-023-00057-7zbMath1530.41022arXiv2211.06071OpenAlexW4377293137MaRDI QIDQ6049829
Daniel Potts, Fabian Taubert, Lutz Kämmerer
Publication date: 18 September 2023
Published in: Sampling Theory, Signal Processing, and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.06071
sparse approximationnonlinear approximationhigh-dimensional approximationbounded orthonormal product basesdimension-incremental algorithmprojected coefficients
Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15) Numerical quadrature and cubature formulas (65D32) Numerical methods for trigonometric approximation and interpolation (65T40) Fourier series and coefficients in several variables (42B05) Complexity and performance of numerical algorithms (65Y20) Numerical integration (65D30) Numerical approximation of high-dimensional functions; sparse grids (65D40)
Cites Work
- A multiscale sub-linear time Fourier algorithm for noisy data
- A deterministic sparse FFT algorithm for vectors with small support
- Sparse high-dimensional FFT based on rank-1 lattice sampling
- Reconstruction of sparse Legendre and Gegenbauer expansions
- A mathematical introduction to compressive sensing
- Sparse Legendre expansions via \(\ell_1\)-minimization
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms
- Combinatorial sublinear-time Fourier algorithms
- Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials
- Improved approximation guarantees for sublinear-time Fourier algorithms
- Representation of sparse Legendre expansions
- Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time
- Multiscale high-dimensional sparse Fourier algorithms for noisy data
- The uniform sparse FFT with application to PDEs with random coefficients
- A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
- Kernel-based reconstructions for parametric PDEs
- Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform
- A sparse fast Fourier algorithm for real non-negative vectors
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
- Empirical evaluation of a sub-linear time sparse DFT algorithm
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
- Deterministic Sparse Fourier Approximation Via Approximating Arithmetic Progressions
- On decompositions of multivariate functions
- Function integration, reconstruction and approximation using rank-$1$ lattices
- Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark
- Automatic selection of basis-adaptive sparse polynomial chaos expansions for engineering applications
- Sparse Polynomial Approximation of High-Dimensional Functions
- Approximation of High-Dimensional Periodic Functions with Fourier-Based Methods
- Approximation of high-dimensional parametric PDEs
- Nearly optimal sparse fourier transform
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
