Summary
In order to factorize an indefinite symmetric matrixG of the formG=LDL T whereL is a trivially invertible matrix andD is a diagonal matrix, we introduce a new kind of pivoting operation. The algorithm suggested maintains the stability and efficiency of the standard Cholesky decomposition whileG need not be positive definite. The problem of factorizingG+αuu T whereu is a vector, α scalar and the factors ofG are known, is also discussed.
Similar content being viewed by others
References
Aasen, J.O.: On the reduction of a symmetric matrix to a tridiagonal form. BIT11, 233–242 (1971)
Barwell, V., George, A.: A comparison of algorithms for solving symmetric indefinite systems of linear equations. Research Report CS-75-05, Department of Computer Science, University of Waterloo, Ontario, Canada 1975
Bunch, J.R., Parlett, B.N.: Direct methods for solving symmetric indefinite systems of linear equations. SIAM J. numer. Analysis8, 639–655 (1971)
Gill, P.E., Golub, G.H., Murray, W., Saunders, M.A.: Methods for modifying matrix factorizations. Math. Comput.28, 505–535 (1974)
Martin, R.S., Peters, G., Wilkinson, J.H.: Symmetric decomposition of a positive definite matrix. Numerische Math.7, 362–383 (1965)
Wilkinson, J.H.: Error analysis of direct methods of matrix inversion. J.A.C.M.8, 281–330 (1961)
Wilkinson, J.H.: The algebraic eigenvalue problem. Oxford University Press (London), 1965
Author information
Authors and Affiliations
Additional information
This research was supported in part by the Israeli National Council for Research and Development
Rights and permissions
About this article
Cite this article
Dax, A., Kaniel, S. Pivoting techniques for symmetric Gaussian elimination. Numer. Math. 28, 221–241 (1977). https://doi.org/10.1007/BF01394454
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01394454