Transformed rank-1 lattices for high-dimensional approximation
From MaRDI portal
Publication:2303354
DOI10.1553/etna_vol53s239zbMath1431.65014arXiv1805.09106OpenAlexW3004670755MaRDI QIDQ2303354
Publication date: 3 March 2020
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.09106
fast Fourier transformchange of variableslattice rulesparse multivariate trigonometric polynomialsapproximation on unbounded domainsmultiple rank-\(1\) lattice
Numerical methods for discrete and fast Fourier transforms (65T50) Algorithms for approximation of functions (65D15)
Related Items (3)
A Note on Transformed Fourier Systems for the Approximation of Non-periodic Signals ⋮ Efficient multivariate approximation on the cube ⋮ 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
- Sparse high-dimensional FFT based on rank-1 lattice sampling
- Randomly shifted lattice rules for unbounded integrands
- Approximation of mixed order Sobolev functions on the \(d\)-torus: asymptotics, preasymptotics, and \(d\)-dependence
- 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
- Numerical Fourier analysis
- Hyperbolic cross approximation. Lecture notes given at the courses on constructive approximation and harmonic analysis, Barcelona, Spain, May 30 -- June 3, 2016
- Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables
- On efficient weighted integration via a change of variables
- Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform
- 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
- Reconstructing Multivariate Trigonometric Polynomials from Samples Along Rank-1 Lattices
- Spectral Methods
- Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
- Lattice Methods for Multiple Integration: Theory, Error Analysis and Examples
- Quasi-Monte Carlo methods and pseudo-random numbers
- High-dimensional integration: The quasi-Monte Carlo way
This page was built for publication: Transformed rank-1 lattices for high-dimensional approximation
