Algorithm 740: Fortran Subroutines to Compute Improved Incomplete Cholesky Factorizations

5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

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 incomplete Cholesky factorization is also included. © 1995, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Jones, M. T., & Plassmann, P. E. (1995). Algorithm 740: Fortran Subroutines to Compute Improved Incomplete Cholesky Factorizations. ACM Transactions on Mathematical Software (TOMS), 21(1), 18–19. https://doi.org/10.1145/200979.200986

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free