首页> 外文期刊>ACM transactions on mathematical software >Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate
【24h】

Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate

机译:算法887:CHOLMOD,超节点稀疏Cholesky分解和更新/降级

获取原文
获取原文并翻译 | 示例

摘要

CHOLMOD is a set of routines for factorizing sparse symmetric positive definite matrices of the form A or AA~T, updating/downdating a sparse Cholesky factorization, solving linear systems, updating/downdating the solution to the triangular system Lx = b, and many other sparse matrix functions for both symmetric and unsymmetric matrices. Its supernodal Cholesky factorization relies on LAPACK and the Level-3 BLAS, and obtains a substantial fraction of the peak performance of the BLAS. Both real and complex matrices are supported. CHOLMOD is written in ANSI/ISO C, with both C and MATLAB™ interfaces. It appears in MATLAB 7.2 as x=Ab when A is sparse symmetric positive definite, as well as in several other sparse matrix functions.
机译:CHOLMOD是一组例程,用于分解形式为A或AA〜T的稀疏对称正定矩阵,更新/降级稀疏的Cholesky分解,求解线性系统,将求解更新/降级为三角系统Lx = b等。对称和非对称矩阵的稀疏矩阵函数。它的超节点式Cholesky分解依赖于LAPACK和Level-3 BLAS,并获得了BLAS峰值性能的很大一部分。同时支持实数和复数矩阵。 CHOLMOD用ANSI / ISO C编写,具有C和MATLAB™接口。当A是稀疏对称正定项时,在MATLAB 7.2中,它在x = Ab中出现,并且在其他几个稀疏矩阵函数中也是如此。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号