Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions
From MaRDI portal
(Redirected from Publication:306699)
Abstract: We develop algorithms for multivariate integration and approximation in the weighted half-period cosine space of smooth non-periodic functions. We use specially constructed tent-transformed rank-1 lattice points as cubature nodes for integration and as sampling points for approximation. For both integration and approximation, we study the connection between the worst-case errors of our algorithms in the cosine space and the worst-case errors of some related algorithms in the well-known weighted Korobov space of smooth periodic functions. By exploiting this connection, we are able to obtain constructive worst-case error bounds with good convergence rates for the cosine space.
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
Cites work
- scientific article; zbMATH DE number 3962404 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 2046351 (Why is no real title available?)
- scientific article; zbMATH DE number 1790439 (Why is no real title available?)
- scientific article; zbMATH DE number 914714 (Why is no real title available?)
- scientific article; zbMATH DE number 3187192 (Why is no real title available?)
- A Belgian View on Lattice Rules
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- Component-by-component construction of good lattice rules
- Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces
- Constructing Randomly Shifted Lattice Rules in Weighted Sobolev Spaces
- Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
- Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points
- From high oscillation to rapid approximation I: modified Fourier expansions
- Integration and approximation in arbitrary dimensions
- Lattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case setting
- Lattice rule algorithms for multivariate approximation in the average case setting
- Lattice rules for multivariate approximation in the worst case setting
- Lattice rules for nonperiodic smooth integrands
- Multivariate modified Fourier series and application to boundary value problems
- On approximate recovery of functions with bounded mixed derivative
- On the convergence rate of the component-by-component construction of good lattice rules
- On the step-by-step construction of quasi--Monte Carlo integration rules that achieve strong tractability error bounds in weighted Sobolev spaces
- Reconstructing hyperbolic cross trigonometric polynomials by sampling along rank-1 lattices
- Reconstructing multivariate trigonometric polynomials from samples along rank-1 lattices
- Reconstruction and collocation of a class of non-periodic functions by sampling along tent-transformed rank-1 lattices
- Reconstruction of periodic functions of several variables with respect to the values in the nodes of number-theoretic nets
- Theory of Reproducing Kernels
- Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness
- Tractability of multivariate problems. Volume I: Linear information
- Tractability of multivariate problems. Volume II: Standard information for functionals.
- Tractability of multivariate problems. Volume III: Standard information for operators
Cited in
(19)- The fast reduced QMC matrix-vector product
- 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
- The uniform sparse FFT with application to PDEs with random coefficients
- A Note on Transformed Fourier Systems for the Approximation of Non-periodic Signals
- 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
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)
