An efficient spatial discretization of spans of multivariate Chebyshev polynomials (Q6992579)

!

WARNING

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use the normal view instead:

An efficient spatial discretization of spans of multivariate Chebyshev polynomials

scientific article; zbMATH DE number 8031618

Language	Label	Description	Also known as
default for all languages	No label defined
English	An efficient spatial discretization of spans of multivariate Chebyshev polynomials	scientific article; zbMATH DE number 8031618

Statements

instance of

scholarly article

0 references

title

An efficient spatial discretization of spans of multivariate Chebyshev polynomials (English)

0 references

author

Lutz Kämmerer

0 references

published in

Applied and Computational Harmonic Analysis

0 references

publication date

26 April 2025

0 references

zbMATH Keywords

sparse multivariate Chebyshev polynomials

0 references

cosine transformed lattice rule

0 references

fast Chebyshev transform

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

On the reconstruction of functions from values at subsampled quadrature points

0 references

High dimensional polynomial interpolation on sparse grids

0 references

Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs

0 references

Polynomial approximation via compressed sensing of high-dimensional functions on lower sets

0 references

Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time

0 references

On the stability and accuracy of least squares approximations

0 references

Improved error bound for multivariate Chebyshev polynomial interpolation

0 references

Probability Inequalities for Sums of Bounded Random Variables

0 references

Reconstructing multivariate trigonometric polynomials from samples along rank-1 lattices

0 references

Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials

0 references

Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform

0 references

The uniform sparse FFT with application to PDEs with random coefficients

0 references

High-dimensional sparse FFT based on sampling along multiple rank-1 lattices

0 references

Function integration, reconstruction and approximation using rank-\(1\) lattices

0 references

Approximation of high-dimensional periodic functions with Fourier-based methods

0 references

Learning multivariate functions with low-dimensional structures using polynomial bases

0 references

Sparse high-dimensional FFT based on rank-1 lattice sampling

0 references

On the Maximum Errors of Polynomial Approximations Defined by Interpolation and by Least Squares Criteria

0 references

General foundations of high-dimensional model representations

0 references

Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations

0 references

Q4889887

0 references

Reconstruction and collocation of a class of non-periodic functions by sampling along tent-transformed rank-1 lattices

0 references

An Extension of Chebfun to Two Dimensions

0 references

Approximation theory and approximation practice

0 references

Identifiers

DOI

10.1016/J.ACHA.2025.101761

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi An efficient spatial discretization of spans of multivariate Chebyshev polynomials