An efficient spatial discretization of spans of multivariate Chebyshev polynomials
From MaRDI portal
Computation of special functions and constants, construction of tables (65D20) Numerical methods for trigonometric approximation and interpolation (65T40) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Numerical methods for discrete and fast Fourier transforms (65T50)
Cites work
- scientific article; zbMATH DE number 914714 (Why is no real title available?)
- An Extension of Chebfun to Two Dimensions
- Approximation of high-dimensional periodic functions with Fourier-based methods
- Approximation theory and approximation practice
- Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
- Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- Function integration, reconstruction and approximation using rank-\(1\) lattices
- General foundations of high-dimensional model representations
- High dimensional polynomial interpolation on sparse grids
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
- Improved error bound for multivariate Chebyshev polynomial interpolation
- Learning multivariate functions with low-dimensional structures using polynomial bases
- Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials
- On the Maximum Errors of Polynomial Approximations Defined by Interpolation and by Least Squares Criteria
- On the reconstruction of functions from values at subsampled quadrature points
- On the stability and accuracy of least squares approximations
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Probability Inequalities for Sums of Bounded Random Variables
- Reconstructing multivariate trigonometric polynomials from samples along rank-1 lattices
- Reconstruction and collocation of a class of non-periodic functions by sampling along tent-transformed rank-1 lattices
- Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time
- Sparse high-dimensional FFT based on rank-1 lattice sampling
- The uniform sparse FFT with application to PDEs with random coefficients
Cited in
(1)
This page was built for publication: An efficient spatial discretization of spans of multivariate Chebyshev polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6992579)
