Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights
From MaRDI portal
Publication:5145098
DOI10.1090/mcom/3586zbMath1456.65016arXiv1910.06606OpenAlexW3088023350MaRDI QIDQ5145098
Dirk Nuyens, Frances Y. Kuo, Ronald Cools, Ian H. Sloan
Publication date: 20 January 2021
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.06606
Multidimensional problems (41A63) Approximation by polynomials (41A10) Spline approximation (41A15) Algorithms for approximation of functions (65D15) Numerical methods for trigonometric approximation and interpolation (65T40) Numerical integration (65D30)
Related Items (3)
Density Estimation in RKHS with Application to Korobov Spaces in High Dimensions ⋮ Fast approximation by periodic kernel-based lattice-point interpolation with application in uncertainty quantification ⋮ Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Quasi-Monte Carlo finite element methods for elliptic PDEs with lognormal random coefficients
- Application of quasi-Monte Carlo methods to elliptic PDEs with random diffusion coefficients: a survey of analysis and implementation
- Construction of quasi-Monte Carlo rules for multivariate integration in spaces of permutation-invariant functions
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- Tractability of multivariate problems. Volume III: Standard information for operators
- Spline methods using integration lattices and digital nets
- Tractability of multivariate problems. Volume I: Linear information
- Tractability of multivariate problems. Volume II: Standard information for functionals.
- On the power of standard information for multivariate approximation in the worst case setting
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- Tractability of multivariate integration for weighted Korobov classes
- Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces
- Circulant embedding with QMC: analysis for elliptic PDE with lognormal coefficients
- Successive coordinate search and component-by-component construction of rank-1 lattice rules
- Tractability of approximation for weighted Korobov spaces on classical and quantum computers
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness
- Lattice-Nyström method for Fredholm integral equations of the second kind with convolution type kernels
- Lattice rule algorithms for multivariate approximation in the average case setting
- Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points
- Good lattice rules in weighted Korobov spaces with general weights
- Monte Carlo and quasi-Monte Carlo sampling
- Component-by-component construction of good lattice rules
- Monte Carlo and Quasi-Monte Carlo Methods 2000
- Multilevel Higher Order QMC Petrov--Galerkin Discretization for Affine Parametric Operator Equations
- Reconstructing Hyperbolic Cross Trigonometric Polynomials by Sampling along Rank-1 Lattices
- QUASI-MONTE CARLO METHODS FOR HIGH-DIMENSIONAL INTEGRATION: THE STANDARD (WEIGHTED HILBERT SPACE) SETTING AND BEYOND
- Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
- A Belgian View on Lattice Rules
- On decompositions of multivariate functions
- Walsh Spaces Containing Smooth Functions and Quasi–Monte Carlo Rules of Arbitrary High Order
- Constructing Randomly Shifted Lattice Rules in Weighted Sobolev Spaces
- Quasi-Monte Carlo Finite Element Methods for a Class of Elliptic Partial Differential Equations with Random Coefficients
- Function integration, reconstruction and approximation using rank-$1$ lattices
- Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters
- Uncertainty Quantification Using Periodic Random Variables
- On Figures of Merit for Randomly-Shifted Lattice Rules
- Introduction to Quasi-Monte Carlo Integration and Applications
- High-dimensional integration: The quasi-Monte Carlo way
- Constructing Embedded Lattice Rules for Multivariate Integration
- Reconstruction and collocation of a class of non-periodic functions by sampling along tent-transformed rank-1 lattices
This page was built for publication: Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights
