๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by Scott M. Auerbach; Claude Leforestier


Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
1021 KB
Volume
78
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

โœฆ Synopsis


A new iterative method to compute the Green's function for continuum systems is presented. It is based on a Newton polynomial expansion of the corresponding propagator, followed by accurate half-Fourier transformation. The new technique is remarkably stable, accurate and can handle very large systems. We apply the new method to the calculation of three-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.

. .


๐Ÿ“œ SIMILAR VOLUMES


A New Numerical Algorithm for the Analyt
โœ Vincent D. Natoli; Morrel H. Cohen; Bengt Fornberg ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 318 KB

to continue the result to the real axis. Numerical analytic continuation, however, is notoriously difficult, and most The need to calculate the spectral properties of a Hermitian operator H frequently arises in the technical sciences. A common ap-techniques developed thus far are useful only for sp

A computational algorithm for the Green'
โœ Eugene P. Dougherty; Herschel Rabitz ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 665 KB

## Abstract The recent interest in numerical modeling of chemical kinetics has generated the need for proper analysis of the system sensitivities in such models. This paper describes the logic for a program developed by the authors to implement the Green's function method of sensitivity analysis in