A new computational algorithm for Green's functions: Fourier transform of the Newton polynomial expansion

DOI10.1016/0010-4655(93)90142-YzbMath0885.34027OpenAlexW2016449685MaRDI QIDQ1372820

Scott M. Auerbach, Claude Leforestier

Publication date: 17 November 1997

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0010-4655(93)90142-y

zbMATH Keywords

Green's functionpropagatoraccurate half-Fourier transformationNewton polynomial expansionthree-dimensional quantum reaction probabilitiesvery large systems

Mathematics Subject Classification ID

Green's functions for ordinary differential equations (34B27) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items

The Chebyshev propagator for quantum systems ⋮ High order perturbation theory for Helmholtz/Schrödinger equations via a separable preconditioner

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Absorbing boundaries for wave propagation problems
• A historical overview of iterative methods
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Solution of the time-dependent Liouville-von Neumann equation: dissipative evolution
• Solution of Sparse Indefinite Systems of Linear Equations

This page was built for publication: A new computational algorithm for Green's functions: Fourier transform of the Newton polynomial expansion