Multidimensional pseudo-spectral methods on lattice grids
From MaRDI portal
Publication:765263
DOI10.1016/J.APNUM.2011.11.002zbMATH Open1237.65130OpenAlexW2014694090MaRDI QIDQ765263FDOQ765263
Authors: Tor Sørevik, Hans 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
Recommendations
- Optimal choice of grid points in multidimensional pseudospectral Fourier methods
- scientific article; zbMATH DE number 2046351
- Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables
- Multipole expansions and pseudospectral cardinal functions: A new generalization of the fast Fourier transform
- Fouriertransform on sparse grids with hierarchical bases
numerical examplesPoisson equationpseudo-spectral methodslattice rulesfast Fourier transform algorithmmultidimensional Fourier expansion
Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Numerical methods for discrete and fast Fourier transforms (65T50)
Cites Work
- Title not available (Why is that?)
- Lattice methods for multiple integration
- Fouriertransform on sparse grids with hierarchical bases
- 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
- Component-by-component construction of good lattice rules
- An Introduction to Lattice Rules and their Generator Matrices
- 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
- Lattice rules for multivariate approximation in the worst case setting
- 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
- Sparse grids for the Schrödinger equation
- Good lattice rules in weighted Korobov spaces with general weights
- On group Fourier analysis and symmetry preserving discretizations of PDEs
- Sparse grid spaces for the numerical solution of the electronic Schrödinger equation
- On the regularity of the electronic Schrödinger equation in Hilbert spaces of mixed derivatives
- Five- and six-dimensional lattice rules generated by structured matrices
- Three- and four-dimensional \(K\)-optimal lattice rules of moderate trigonometric degree
- Lattice Methods for Multiple Integration: Theory, Error Analysis and Examples
- Five-dimensional $K$-optimal lattice rules
- A table of good lattice points in three dimensions
- Lattice Rules by Component Scaling
- Optimal choice of grid points in multidimensional pseudospectral Fourier methods
- Tables of good lattices in four and five dimensions
- A search program for finding optimal integration lattices
- An algorithm for finding optimal integration lattices of composite order
- Title not available (Why is that?)
Cited In (17)
- A pseudo-spectral multiscale method: interfacial conditions and coarse grid equations
- Trigonometric interpolation on lattice grids
- A new generalization of the PSWFs with applications to spectral approximations on quasi-uniform grids
- Function integration, reconstruction and approximation using rank-$1$ lattices
- Groups and symmetries in numerical linear algebra
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
- Rank-1 Lattices and Higher-Order Exponential Splitting for the Time-Dependent Schrödinger Equation
- Optimal choice of grid points in multidimensional pseudospectral Fourier methods
- Title not available (Why is that?)
- Reconstruction and collocation of a class of non-periodic functions by sampling along tent-transformed rank-1 lattices
- Sparse high-dimensional FFT based on rank-1 lattice sampling
- Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form
- A geometric multigrid method based on L-shaped coarsening for PDEs on stretched grids
- Reconstructing multivariate trigonometric polynomials from samples along rank-1 lattices
- Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials
This page was built for publication: Multidimensional pseudo-spectral methods on lattice grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765263)
