descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1976 English Publisher:Springer Science and Business Media LLCJournal:Numerische Mathematik, volume 27, pages 95-109 (issn: 0029-599X, eissn: 0945-3245,

Authors: Bunch, James R.; Kaufman, Linda; Parlett, Beresford N.;

doi: 10.1007/bf01399088

Decomposition of a symmetric matrix

- Summary
- Subjects
- Metrics

Abstract

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.

Related Organizations

University of California, Berkeley
United States
University of California, San Diego
United States
Bell Labs
United States
University of California, San Diego
United States

Keywords

Numerical computation of matrix norms, conditioning, scaling, Algorithms in computer science

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	61
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average