Function integration, reconstruction and approximation using rank-$1$ lattices
From MaRDI portal
Publication:4992235
DOI10.1090/mcom/3595zbMath1466.42002arXiv1908.01178OpenAlexW3154542836MaRDI QIDQ4992235
Frances Y. Kuo, Fabio Nobile, Dirk Nuyens, Giovanni Migliorati
Publication date: 7 June 2021
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.01178
quasi-Monte Carlo methodsFourier spacecomponent-by-component constructionChebyshev spacecosine spaceexact integration and approximation on finite index setsrank-\(1\) lattice points
Trigonometric approximation (42A10) Multidimensional problems (41A63) Approximation by polynomials (41A10) Algorithms for approximation of functions (65D15) Numerical quadrature and cubature formulas (65D32) Numerical integration (65D30)
Related Items
Grouped Transformations and Regularization in High-Dimensional Explainable ANOVA Approximation, Nonlinear approximation in bounded orthonormal product bases, Error guarantees for least squares approximation with noisy samples in domain adaptation, On the reconstruction of functions from values at subsampled quadrature points, A Note on Transformed Fourier Systems for the Approximation of Non-periodic Signals, Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights, 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, Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables, Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters, The uniform sparse FFT with application to PDEs with random coefficients
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions
- Sparse high-dimensional FFT based on rank-1 lattice sampling
- On the stability and accuracy of least squares approximations
- Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
- Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets
- Chebyshev lattices, a unifying framework for cubature with Chebyshev weight function
- Interpolation lattices for hyperbolic cross trigonometric polynomials
- Multidimensional pseudo-spectral methods on lattice grids
- Spline methods using integration lattices and digital nets
- Lattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case setting
- Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces
- On the power of standard information for multivariate approximation in the worst case setting
- Weighted tensor product algorithms for linear multivariate problems
- Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices
- Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets
- 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
- Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness
- Lattice rules for nonperiodic smooth integrands
- Lattice rule algorithms for multivariate approximation in the average case setting
- Reconstructing Hyperbolic Cross Trigonometric Polynomials by Sampling along Rank-1 Lattices
- Multivariate Discrete Least-Squares Approximations with a New Type of Collocation Grid
- Reconstructing Multivariate Trigonometric Polynomials from Samples Along Rank-1 Lattices
- Rank-1 Lattices and Higher-Order Exponential Splitting for the Time-Dependent Schrödinger Equation
- Strang Splitting in Combination with Rank-1 and Rank-r Lattices for the Time-Dependent Schrödinger Equation
- Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs
- On the power of standard information for weighted approximation
- Reconstruction and collocation of a class of non-periodic functions by sampling along tent-transformed rank-1 lattices
