scientific article; zbMATH DE number 5049856

Frances Y. Kuo, Henryk Woźniakowski, Ian H. Sloan

Publication date: 28 August 2006

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

algorithms multivariate approximation error bounds trigonometric polynomials Fourier coefficients lattice rules worst case setting periodic functions weighted Korobov spaces

Mathematics Subject Classification ID

Trigonometric approximation (42A10) Multidimensional problems (41A63) Numerical methods for trigonometric approximation and interpolation (65T40) Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16) Completeness of sets of functions in one variable harmonic analysis (42A65)

Related Items (34)

$\mathbb{L}_\infty$-approximation in Korobov spaces with exponential weights ⋮ Approximation in Hermite spaces of smooth functions ⋮ Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions ⋮ Spline methods using integration lattices and digital nets ⋮ Lattice algorithms for multivariate $L_{\infty}$ approximation in the worst-case setting ⋮ Constructing lattice rules based on weighted degree of exactness and worst case error ⋮ Sparse high-dimensional FFT based on rank-1 lattice sampling ⋮ Tractability of $\mathbb{L}_2$-approximation in hybrid function spaces ⋮ High-dimensional sparse FFT based on sampling along multiple rank-1 lattices ⋮ Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness ⋮ Tractability of $L_2$-approximation and integration in weighted Hermite spaces of finite smoothness ⋮ Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials ⋮ Ian Sloan and Lattice Rules ⋮ Approximation of analytic functions in Korobov spaces ⋮ Interpolation lattices for hyperbolic cross trigonometric polynomials ⋮ Multivariate $L_{\infty}$ approximation in the worst case setting over reproducing kernel Hilbert spaces ⋮ Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights ⋮ Lattice-Nyström method for Fredholm integral equations of the second kind with convolution type kernels ⋮ Tractability of approximation in the weighted Korobov space in the worst-case setting -- a complete picture ⋮ How anisotropic mixed smoothness affects the decay of singular numbers for Sobolev embeddings ⋮ Lattice rule algorithms for multivariate approximation in the average case setting ⋮ Reconstruction and collocation of a class of non-periodic functions by sampling along tent-transformed rank-1 lattices ⋮ On the power of standard information for multivariate approximation in the worst case setting ⋮ Fast approximation by periodic kernel-based lattice-point interpolation with application in uncertainty quantification ⋮ Multidimensional pseudo-spectral methods on lattice grids ⋮ Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables ⋮ Function integration, reconstruction and approximation using rank-$1$ lattices ⋮ Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices ⋮ Strang Splitting in Combination with Rank-1 and Rank-r Lattices for the Time-Dependent Schrödinger Equation ⋮ Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters ⋮ Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform ⋮ On the approximation of smooth functions using generalized digital nets ⋮ The power of standard information for multivariate approximation in the randomized setting ⋮ Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form

This page was built for publication: