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

The preconditioned conjugate gradient method with incomplete factorization preconditioners

โœ Scribed by I. Arany

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
283 KB
Volume
31
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Parallel m-step preconditioners for the
Parallel m-step preconditioners for the conjugate gradient method
โœ Cristina Corral; Isabel Gimรฉnez; Josรฉ Marฤฑฬn; Josรฉ Mas ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 179 KB

To obtain an ecient parallel algorithm to solve sparse linear systems with the preconditioned conjugate gradient (PCG) method, two types of parallel preconditioners are introduced. The ยฎrst is a polynomial preconditioner type based on a multisplitting of the matrix system, and the second one is obta

Krylov methods preconditioned with incom
Krylov methods preconditioned with incompletely factored matrices on the CM-2
โœ Harry Berryman; Joel Saltz; William Gropp; Ravi Mirchandaney ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 79 KB

In the work presented here, we measured the performance of the components of the key iterative kernel of a preconditioned Krylov space iterative linear system solver. In some sense, these numbers can be regarded as best case timings for these kernels. We timed sweeps over meshes, sparse triangular s