Algorithm 740: Fortran subroutines to compute improved incomplete Cholesky factorizations
Algorithm 740: Fortran subroutines to compute improved incomplete Cholesky factorizations
复制标题
算法 740:用于计算改进的不完全 Cholesky 分解的 Fortran 子例程
DOI:
--
复制
发表时间:
1995
期刊:
影响因子:
--
通讯作者:
P. Plassmann
中科院分区:
文献类型:
--
作者:
Mark T. Jones;P. Plassmann
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.