A NEW COMPUTATIONAL ALGORITHM FOR GREENS-FUNCTIONS - FOURIER-TRANSFORM OF THE NEWTON POLYNOMIAL EXPANSION

Citation
Sm. Auerbach et C. Leforestier, A NEW COMPUTATIONAL ALGORITHM FOR GREENS-FUNCTIONS - FOURIER-TRANSFORM OF THE NEWTON POLYNOMIAL EXPANSION, Computer physics communications, 78(1-2), 1993, pp. 55-66
Citations number
39
Categorie Soggetti
Mathematical Method, Physical Science","Computer Applications & Cybernetics","Physycs, Mathematical
ISSN journal
00104655
Volume
78
Issue
1-2
Year of publication
1993
Pages
55 - 66
Database
ISI
SICI code
0010-4655(1993)78:1-2<55:ANCAFG>2.0.ZU;2-T
Abstract
A new iterative method to compute the Green's function for continuum s ystems is presented. It is based on a Newton polynomial expansion of t he corresponding propagator, followed by accurate half-Fourier transfo rmation. The new technique is remarkably stable, accurate and can hand le very large systems. We apply the new method to the calculation of t hree-dimensional quantum reaction probabilities for the initial state- selected D + H-2(n,j) --> DH + H reaction. We find excellent agreement with previous results, requiring very modest amounts of CPU time.