𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximating the inverse of a matrix for use in iterative algorithms on vector processors

✍ Scribed by P. F. Dubois; A. Greenbaum; G. H. Rodrigue

Publisher
Springer Vienna
Year
1979
Tongue
English
Weight
606 KB
Volume
22
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the performance of an automated Verle
On the performance of an automated Verlet neighbor list algorithm for large systems on a vector processor
✍ Ariel A. Chialvo; Pablo G. Debenedetti πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 280 KB

An automated version of the Verlet neighbor list algorithm in which the optimum neighbor list radius (SKIN) increases with the system size (N) shows an almost linear CPU time versus N dependence over the range 102 < N <i0 4. The algorithm's speed is comparable to that of a Link-Cell code (Grest et a

Remarks on the use of the apparent surfa
Remarks on the use of the apparent surface charges (ASC) methods in solvation problems: Iterative versus matrix-inversion procedures and the renormalization of the apparent charges
✍ R. Cammi; J. Tomasi πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 761 KB

We present a formal and numerical comparison between the iterative and matrix-inversion approaches of the polarizable continuum model. The formal analysis shows completely the equivalence of the two approaches. Numerical equivalence is also recovered, introducing in both methods the proper boundary