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

A recursive algorithm for the G transformation and accurate computation of incomplete Bessel functions

โœ Scribed by Richard M. Slevinsky; Hassan Safouhi

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
157 KB
Volume
60
Category
Article
ISSN
0168-9274

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Accurate and fast algorithm of the molec
Accurate and fast algorithm of the molecular incomplete gamma function with a complex argument
โœ Kazuhiro Ishida ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 131 KB

Several efficient algorithms for the accurate and fast calculation of the molecular incomplete gamma function Fm(z) with a complex argument z are developed. The complex incomplete gamma function is arising in molecular integrals over the gauge-including atomic orbitals. Two kinds of algorithms are r

An Accurate and Efficient Algorithm for
An Accurate and Efficient Algorithm for the Computation of the Characteristic Polynomial of a General Square Matrix
โœ S. Rombouts; K. Heyde ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 99 KB

An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant quantum Monte-Carlo methods.

A new computational algorithm for Green'
A new computational algorithm for Green's functions: Fourier transform of the Newton polynomial expansion
โœ Scott M. Auerbach; Claude Leforestier ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1021 KB

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 system