A new computational algorithm for Green's functions: Fourier transform of the Newton polynomial expansion
DOI10.1016/0010-4655(93)90142-YzbMATH Open0885.34027OpenAlexW2016449685MaRDI QIDQ1372820FDOQ1372820
Authors: 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
Recommendations
Green's functionpropagatoraccurate half-Fourier transformationNewton polynomial expansionthree-dimensional quantum reaction probabilitiesvery large systems
Green's functions for ordinary differential equations (34B27) Numerical methods for discrete and fast Fourier transforms (65T50)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Title not available (Why is that?)
- Solution of Sparse Indefinite Systems of Linear Equations
- Solution of the time-dependent Liouville-von Neumann equation: dissipative evolution
- Absorbing boundaries for wave propagation problems
- A historical overview of iterative methods
Cited In (5)
- High order perturbation theory for Helmholtz/Schrödinger equations via a separable preconditioner
- Green's function method for strength function in three-body continuum
- The Chebyshev propagator for quantum systems
- Fast algorithms for implementation of the Green's function
- Title not available (Why is that?)
This page was built for publication: A new computational algorithm for Green's functions: Fourier transform of the Newton polynomial expansion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372820)
