Multidimensional pseudo-spectral methods on lattice grids
From MaRDI portal
Publication:765263
DOI10.1016/j.apnum.2011.11.002zbMath1237.65130OpenAlexW2014694090MaRDI QIDQ765263
Tor Sørevik, Hans Z. Munthe-Kaas
Publication date: 19 March 2012
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2011.11.002
numerical examplesPoisson equationlattice rulespseudo-spectral methodsfast Fourier transform algorithmmultidimensional Fourier expansion
Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Numerical methods for discrete and fast Fourier transforms (65T50)
Related Items
Trigonometric interpolation on lattice grids ⋮ Sparse high-dimensional FFT based on rank-1 lattice sampling ⋮ High-dimensional sparse FFT based on sampling along multiple rank-1 lattices ⋮ 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 ⋮ Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials ⋮ Groups and Symmetries in Numerical Linear Algebra ⋮ Reconstruction and collocation of a class of non-periodic functions by sampling along tent-transformed rank-1 lattices ⋮ Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables ⋮ Function integration, reconstruction and approximation using rank-$1$ lattices ⋮ Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form ⋮ Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the regularity of the electronic Schrödinger equation in Hilbert spaces of mixed derivatives
- Tables of good lattices in four and five dimensions
- Lattice methods for multiple integration
- Optimal choice of grid points in multidimensional pseudospectral Fourier methods
- A search program for finding optimal integration lattices
- An algorithm for finding optimal integration lattices of composite order
- Fouriertransform on sparse grids with hierarchical bases
- A table of good lattice points in three dimensions
- Five- and six-dimensional lattice rules generated by structured matrices
- Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation
- Lattice rule algorithms for multivariate approximation in the average case setting
- Good lattice rules in weighted Korobov spaces with general weights
- Sparse grid spaces for the numerical solution of the electronic Schrödinger equation
- Three- and four-dimensional 𝐾-optimal lattice rules of moderate trigonometric degree
- Component-by-component construction of good lattice rules
- An Introduction to Lattice Rules and their Generator Matrices
- Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
- Strang Splitting for the Time-Dependent Schrödinger Equation on Sparse Grids
- Lattice Methods for Multiple Integration: Theory, Error Analysis and Examples
- Lattice Rules by Component Scaling
- Application of the Smith Normal Form to the Structure of Lattice Rules
- Four-dimensional lattice rules generated by skew-circulant matrices
- Minimal cubature formulae of trigonometric degree
- Sparse grids for the Schrödinger equation
- On group Fourier analysis and symmetry preserving discretizations of PDEs
- Five-dimensional $K$-optimal lattice rules
