𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Incomplete Multilevel Cholesky Factorizations

✍ Scribed by Diaz, J. C.; Komara, K.

Book ID
118216193
Publisher
Society for Industrial and Applied Mathematics
Year
2001
Tongue
English
Weight
206 KB
Volume
22
Category
Article
ISSN
0895-4798

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Algorithm 740; Fortran subroutines to co
Algorithm 740; Fortran subroutines to compute improved incomplete Cholesky factorizations
✍ Jones, Mark T.; Plassmann, Paul E. πŸ“‚ Article πŸ“… 1995 πŸ› Association for Computing Machinery 🌐 English βš– 109 KB

Efficient and reliable code to compute incomplete Cholesky factors of sparse matrices for use as preconditioners in a conjugate gradient algorithm is described. This code implements two recently developed, improved incomplete factorization algorithms. An efficient implementation of the standard inco

An improved incomplete Cholesky factoriz
An improved incomplete Cholesky factorization
✍ Jones, Mark T.; Plassmann, Paul E. πŸ“‚ Article πŸ“… 1995 πŸ› Association for Computing Machinery 🌐 English βš– 861 KB
A multilevel block incomplete factorizat
A multilevel block incomplete factorization preconditioning
✍ Y. Notay πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 177 KB

Incomplete factorization preconditioners based on recursive red-black orderings have been shown efficient for discrete second order elliptic PDEs with isotropic coefficients. However, they suffer for some weakness in presence of anisotropy or grid stretching. Here we propose to combine these orderin