A generalized envelope method for sparse factorization by rows-Reference-Cited by-同舟云学术

A generalized envelope method for sparse factorization by rows

Published:1991-03 Issue:1 Volume:17 Page:112-129
ISSN:0098-3500
Container-title:ACM Transactions on Mathematical Software
language:en
Short-container-title:ACM Trans. Math. Softw.

Author:

Liu Joseph W. H.¹

Affiliation:

1. York Univ., Toronto, Ont., Canada

Abstract

A generalized form of the envelope method is proposed for the solution of large sparse symmetric and positive definite matrices by rows. The method is demonstated to have practical advantages over the conventional column-oriented factorization using compressed column storage or the multifrontal method using full frontal submatrices.

Publisher

Association for Computing Machinery (ACM)

Subject

Applied Mathematics,Software

Link

https://dl.acm.org/doi/pdf/10.1145/103147.103159

Reference18 articles.

1. The influence of relaxed supernode partitions on the multifrontal method

2. Progress in sparse matrix methods for large sparse linear systems on vector supercomputers Int;ASHCRAFT C.;J. Supercomput. Appl.,1987

3. General Sparse Elimination Requires No Permanent Integer Storage

4. Lecture Notes ~n Mathemattcs (912);DUFF I. S.,1982

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. HPS Cholesky: Hierarchical Parallelized Supernodal Cholesky with Adaptive Parameters;ACM Transactions on Parallel Computing;2023-10-26

2. Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization;ACM Transactions on Mathematical Software;2022-05-26

3. Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations;SIAM Journal on Matrix Analysis and Applications;2022-03

4. A survey of direct methods for sparse linear systems;Acta Numerica;2016-05-01

5. Bibliography;Interior Point Algorithms;2011-10-14