Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation
DOI10.1007/S00607-007-0225-3zbMATH Open1117.65137OpenAlexW2012708209MaRDI QIDQ2369947FDOQ2369947
Authors: 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
Recommendations
- Strang Splitting for the Time-Dependent Schrödinger Equation on Sparse Grids
- Fourier pseudospectral method on generalized sparse grids for the space-fractional Schrödinger equation
- Sparse grids for the Schrödinger equation
- A wavelet based sparse grid method for the electronic Schrödinger equation
- Strang splitting in combination with rank-1 and rank-\(r\) lattices for the time-dependent Schrödinger equation
Fourier transformconvergencenumerical examplespseudo-spectral methodStrang splittingSparse gridsSchrödinger equation
Numerical methods for trigonometric approximation and interpolation (65T40) PDEs in connection with quantum mechanics (35Q40) Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs (65M12) Computational methods for problems pertaining to quantum theory (81-08) Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics (81Q05) Spectral, collocation and related methods for initial value and initial-boundary value problems involving PDEs (65M70)
Cites Work
- Sparse grids
- Spectral Methods in MATLAB
- Title not available (Why is that?)
- Fouriertransform on sparse grids with hierarchical bases
- Error bounds for exponential operator splittings
- The picture book of quantum mechanics
- Strang Splitting for the Time-Dependent Schrödinger Equation on Sparse Grids
- Adaptive sparse grid multilevel methods for elliptic PDEs based on finite differences
- Title not available (Why is that?)
- Propagation through conical crossings: An asymptotic semigroup
- Title not available (Why is that?)
- Construction and validation of a rigorous surface hopping algorithm for conical crossing
- Fast evaluation of trigonometric polynomials from hyperbolic crosses
Cited In (25)
- Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids
- Title not available (Why is that?)
- Trigonometric interpolation on lattice grids
- Strang Splitting for the Time-Dependent Schrödinger Equation on Sparse Grids
- On the stability of the hyperbolic cross discrete Fourier transform
- Interpolation lattices for hyperbolic cross trigonometric polynomials
- Computing quantum dynamics in the semiclassical regime
- Rank-1 Lattices and Higher-Order Exponential Splitting for the Time-Dependent Schrödinger Equation
- Multidimensional pseudo-spectral methods on lattice grids
- Sparse grid central discontinuous Galerkin method for linear hyperbolic systems in high dimensions
- Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
- A Fast Matrix-free Algorithm for Spectral Approximations to the Schrödinger Equation
- Speeding up the flash calculations in two-phase compositional flow simulations - the application of sparse grids
- Fourier pseudospectral method on generalized sparse grids for the space-fractional Schrödinger equation
- B-spline quasi-interpolation on sparse grids
- Sparse high-dimensional FFT based on rank-1 lattice sampling
- Fast discrete Fourier transform on generalized sparse grids
- Fourier spectral method on sparse grids for computing ground state of many-particle fractional Schrödinger equations
- Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form
- Fast sparse nonlinear Fourier expansions of high dimensional functions
- Strang splitting in combination with rank-1 and rank-\(r\) lattices for the time-dependent Schrödinger equation
- Sparse grid discontinuous Galerkin methods for high-dimensional elliptic equations
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- A Sparse Interpolation Algorithm for Dynamical Simulations in Computational Chemistry
- Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials
Uses Software
This page was built for publication: Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369947)
