Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions
DOI10.1016/J.JCO.2016.05.004zbMATH Open1347.65004DBLPjournals/jc/CoolsKNS16arXiv1606.00648OpenAlexW2392207747WikidataQ57778794 ScholiaQ57778794MaRDI QIDQ306699FDOQ306699
Authors: Ronald Cools, F. Y. Kuo, Dirk Nuyens, Gowri Suryanarayana
Publication date: 1 September 2016
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.00648
Recommendations
- Lattice rules for nonperiodic smooth integrands
- Reconstruction and collocation of a class of non-periodic functions by sampling along tent-transformed rank-1 lattices
- Efficient multivariate approximation on the cube
- Lattice rules in non-periodic subspaces of Sobolev spaces
- Integration and approximation in cosine spaces of smooth functions
convergencequasi-Monte Carlo methodsalgorithmerror boundfunction approximationmultivariate integrationcomponent-by-component constructioncosine serieshyperbolic crossesrank-1 lattice rulessmooth non-periodic functionsworst-case error
Cites Work
- Theory of Reproducing Kernels
- Title not available (Why is that?)
- Lattice rules for nonperiodic smooth integrands
- Title not available (Why is that?)
- Tractability of multivariate problems. Volume III: Standard information for operators
- Tractability of multivariate problems. Volume I: Linear information
- Tractability of multivariate problems. Volume II: Standard information for functionals.
- On approximate recovery of functions with bounded mixed derivative
- 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
- Lattice rules for multivariate approximation in the worst case setting
- Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces
- Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points
- On the step-by-step construction of quasi--Monte Carlo integration rules that achieve strong tractability error bounds in weighted Sobolev spaces
- Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the convergence rate of the component-by-component construction of good lattice rules
- Reconstruction of periodic functions of several variables with respect to the values in the nodes of number-theoretic nets
- Integration and approximation in arbitrary dimensions
- 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
- Reconstructing multivariate trigonometric polynomials from samples along rank-1 lattices
- A Belgian View on Lattice Rules
- From high oscillation to rapid approximation I: modified Fourier expansions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constructing Randomly Shifted Lattice Rules in Weighted Sobolev Spaces
- Reconstruction and collocation of a class of non-periodic functions by sampling along tent-transformed rank-1 lattices
- Lattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case setting
- Multivariate modified Fourier series and application to boundary value problems
Cited In (19)
- A sparse FFT approach for ODE with random coefficients
- Scaled lattice rules for integration on \(\mathbb{R}^d\) achieving higher-order convergence with error analysis in terms of orthogonal projections onto periodic spaces
- Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters
- Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights
- Error guarantees for least squares approximation with noisy samples in domain adaptation
- Construction-free median quasi-Monte Carlo rules for function spaces with unspecified smoothness and general weights
- Reconstruction and collocation of a class of non-periodic functions by sampling along tent-transformed rank-1 lattices
- A Note on Transformed Fourier Systems for the Approximation of Non-periodic Signals
- The uniform sparse FFT with application to PDEs with random coefficients
- Lattice rules for nonperiodic smooth integrands
- Efficient multivariate approximation on the cube
- Strang splitting in combination with rank-1 and rank-\(r\) lattices for the time-dependent Schrödinger equation
- Function integration, reconstruction and approximation using rank-\(1\) lattices
- Component-by-component construction of randomized rank-1 lattice rules achieving almost the optimal randomized error rate
- On a reduced component-by-component digit-by-digit construction of lattice point sets
- Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness
- Constructing lattice points for numerical integration by a reduced fast successive coordinate search algorithm
- Lattice rules in non-periodic subspaces of Sobolev spaces
- The fast reduced QMC matrix-vector product
This page was built for publication: Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306699)