Find out how to access previewonly content
, Volume 27, Issue 1, pp 95109
First online:
Decomposition of a symmetric matrix
 James R. BunchAffiliated withDepartment of Mathematics, University of California
 , Linda KaufmanAffiliated withBell Laboratories
 , Beresford N. ParlettAffiliated withDepartment of Mathematics and Department of Electrical Engineering and Computer Science, University of California
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessSummary
An algorithm is presented to compute a triangular factorization and the inertia of a symmetric matrix. The algorithm is stable even when the matrix is not positive definite and is as fast as Cholesky. Programs for solving associated systems of linear equations are included.
 Title
 Decomposition of a symmetric matrix
 Journal

Numerische Mathematik
Volume 27, Issue 1 , pp 95109
 Cover Date
 197603
 DOI
 10.1007/BF01399088
 Print ISSN
 0029599X
 Online ISSN
 09453245
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 Authors

 James R. Bunch ^{(1)}
 Linda Kaufman ^{(2)}
 Beresford N. Parlett ^{(3)}
 Author Affiliations

 1. Department of Mathematics, University of California, San Diego, USA
 2. Bell Laboratories, Murray Hill, 07974, New Jersey, USA
 3. Department of Mathematics and Department of Electrical Engineering and Computer Science, University of California, Berkeley, USA