Numerical Properties of Block Cholesky-Like Methods for Solving Symmetric Quasi-Definite Linear Systems
AIP conference proceedings(2018)
摘要
This paper presents a comparison of two Cholesky-like algorithms for solving symmetric quasi-definite system Mz = f. This pair of methods computes the block factorization M = R-T DR, where R is upper triangular and D is a diagonal matrix.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要