Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness
From MaRDI portal
Publication:2407468
DOI10.1007/s00211-016-0861-7zbMath1422.65467arXiv1510.08336OpenAlexW2963814522MaRDI QIDQ2407468
Lutz Kämmerer, Glenn Byrenheid, Tino Ullrich, Toni Volkmer
Publication date: 29 September 2017
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.08336
Analysis of algorithms and problem complexity (68Q25) Function spaces arising in harmonic analysis (42B35) Trigonometric approximation (42A10) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical quadrature and cubature formulas (65D32) Numerical methods for trigonometric approximation and interpolation (65T40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity and performance of numerical algorithms (65Y20) Numerical integration (65D30)
Related Items
\(s\)-numbers of embeddings of weighted Wiener algebras, Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions, High-dimensional sparse FFT based on sampling along multiple rank-1 lattices, Best \(n\)-term approximation of diagonal operators and application to function spaces with mixed smoothness, On the reconstruction of functions from values at subsampled quadrature points, A Note on Transformed Fourier Systems for the Approximation of Non-periodic Signals, Rank-1 Lattices and Higher-Order Exponential Splitting for the Time-Dependent Schrödinger Equation, Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials, Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights, Approximation of High-Dimensional Periodic Functions with Fourier-Based Methods, Worst-case recovery guarantees for least squares approximation using random samples, Efficient multivariate approximation on the cube, Sampling numbers of a class of infinitely differentiable functions, Sample numbers and optimal Lagrange interpolation of Sobolev spaces \(W_1^r\), Transformed rank-1 lattices for high-dimensional approximation, Fast approximation by periodic kernel-based lattice-point interpolation with application in uncertainty quantification, A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size, 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
Uses Software
Cites Work
- Unnamed Item
- 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\)
- Optimal quasi-Monte Carlo rules on order 2 digital nets for the numerical integration of multivariate periodic functions
- Sampling and cubature on sparse grids based on a B-spline quasi-interpolation
- Interpolation lattices for hyperbolic cross trigonometric polynomials
- Lattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case setting
- Approximation of mixed order Sobolev functions on the \(d\)-torus: asymptotics, preasymptotics, and \(d\)-dependence
- Regularity and approximability of electronic wave functions
- Reconstruction of periodic functions of several variables with respect to the values in the nodes of number-theoretic nets
- Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials
- Hyperbolic cross approximation. Lecture notes given at the courses on constructive approximation and harmonic analysis, Barcelona, Spain, May 30 -- June 3, 2016
- The fast Fourier transform and fast wavelet transform for patterns on the torus
- Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- Constructing lattice rules based on weighted degree of exactness and worst case error
- \(N\)-widths and \(\varepsilon \)-dimensions for high-dimensional approximations
- Lattice rule algorithms for multivariate approximation in the average case setting
- Component-by-component construction of good lattice rules
- Reconstructing Hyperbolic Cross Trigonometric Polynomials by Sampling along Rank-1 Lattices
- Reconstructing Multivariate Trigonometric Polynomials from Samples Along Rank-1 Lattices
- Optimized general sparse grid approximation spaces for operator equations
- Quasi-Monte Carlo methods and pseudo-random numbers
- Fast Discrete Fourier Transform on Generalized Sparse Grids
