Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation

DOI10.1007/S00607-007-0225-3zbMath1117.65137OpenAlexW2012708209MaRDI QIDQ2369947

Vasile Gradinaru

Publication date: 21 June 2007

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-007-0225-3

zbMATH Keywords

Fourier transformconvergencenumerical examplesSchrödinger equationpseudo-spectral methodStrang splittingSparse grids

Mathematics Subject Classification ID

Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics (81Q05) Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs (65M12) PDEs in connection with quantum mechanics (35Q40) Computational methods for problems pertaining to quantum theory (81-08) Spectral, collocation and related methods for initial value and initial-boundary value problems involving PDEs (65M70) Numerical methods for trigonometric approximation and interpolation (65T40)

Related Items (23)

Fourier spectral method on sparse grids for computing ground state of many-particle fractional Schrödinger equations ⋮ Computing quantum dynamics in the semiclassical regime ⋮ Trigonometric interpolation on lattice grids ⋮ Sparse grid discontinuous Galerkin methods for high-dimensional elliptic equations ⋮ Sparse high-dimensional FFT based on rank-1 lattice sampling ⋮ Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids ⋮ A Sparse Interpolation Algorithm for Dynamical Simulations in Computational Chemistry ⋮ Fast discrete algorithms for sparse Fourier expansions of high dimensional functions ⋮ On the stability of the hyperbolic cross discrete Fourier transform ⋮ 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 ⋮ Interpolation lattices for hyperbolic cross trigonometric polynomials ⋮ Fast sparse nonlinear Fourier expansions of high dimensional functions ⋮ Fourier pseudospectral method on generalized sparse grids for the space-fractional Schrödinger equation ⋮ B-spline quasi-interpolation on sparse grids ⋮ Speeding up the flash calculations in two-phase compositional flow simulations - the application of sparse grids ⋮ Sparse Grid Central Discontinuous Galerkin Method for Linear Hyperbolic Systems in High Dimensions ⋮ Multidimensional pseudo-spectral methods on lattice grids ⋮ Strang Splitting in Combination with Rank-1 and Rank-r Lattices for the Time-Dependent Schrödinger Equation ⋮ A Fast Matrix-free Algorithm for Spectral Approximations to the Schrödinger Equation ⋮ Fast Discrete Fourier Transform on Generalized Sparse Grids ⋮ 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

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fouriertransform on sparse grids with hierarchical bases
• Adaptive sparse grid multilevel methods for elliptic PDEs based on finite differences
• Error bounds for exponential operator splittings
• Construction and validation of a rigorous surface hopping algorithm for conical crossing
• Fast evaluation of trigonometric polynomials from hyperbolic crosses
• The Picture Book of Quantum Mechanics
• Strang Splitting for the Time-Dependent Schrödinger Equation on Sparse Grids
• Spectral Methods in MATLAB
• Sparse grids
• Propagation through conical crossings: An asymptotic semigroup

This page was built for publication: Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation