Decomposition of a symmetric matrix
- 505 Downloads
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.
Unable to display preview. Download preview PDF.
- 1.Aasen, J. O.: On the reduction of a symmetric matrix to tridiagonal form. BIT11, 233–242 (1971)Google Scholar
- 2.Barwell, V., George, A.: A comparison of algorithms for solving symmetric indefinite systems of linear equations. TOMS2, 242–251 (1976)Google Scholar
- 3.Bowdler, H. J., Martin R. S., Peters, G., Wilkinson, J. H.: Solution of real and complex systems of linear equations. Numer. Math.8, 217–234 (1966)Google Scholar
- 4.Bunch, J. R.: Analysis of the diagonal pivoting method. SIAM Numerical Analysis8, 656–680 (1971)Google Scholar
- 5.Bunch, J. R., Kaufman, L.: Some stable methods for solving symmetric linear systems. Math of. Comp. (to appear), 1977.Google Scholar
- 6.Bunch, J. R., Parlett, B. N.: Direct methods for solving symmetric indefinite systems of linear equations. SIAM Numerical Analysis8, 639–655 (1971)Google Scholar
- 7.Cottle, R. W.: Manifestations of the Schur complement. Linear Algebra and its Applications8, 189–211 (1974)Google Scholar
- 8.Martin, R. S., Peters, G., Wilkinson, J. H.: Symmetric decomposition of a positive definite matrix. Numer. Math.7, 362–383 (1965)Google Scholar
- 9.Parlett, B. N., Reid, J. K.: On the solution of a system of linear equations whose matrix is symmetric but not definite. BIT10, 386–397 (1970)Google Scholar
- 10.Wilkinson, J. H.: The Algebraic Eigenvalue Problem Oxford: Clarendon Press 1965Google Scholar