Modifying pivot elements in Gaussian elimination
HTML articles powered by AMS MathViewer
- by G. W. Stewart PDF
- Math. Comp. 28 (1974), 537-542 Request permission
Abstract:
The rounding-error analysis of Gaussian elimination shows that the method is stable only when the elements of the matrix do not grow excessively in the course of the reduction. Usually such growth is prevented by interchanging rows and columns of the matrix so that the pivot element is acceptably large. In this paper the alternative of simply altering the pivot element is examined. The alteration, which amounts to a rank one modification of the matrix, is undone at a later stage by means of the well-known formula for the inverse of a modified matrix. The technique should prove useful in applications in which the pivoting strategy has been fixed, say to preserve sparseness in the reduction.References
- Donald J. Rose and Ralph A. Willoughby (eds.), Sparse matrices and their applications, Plenum Press, New York-London, 1972. MR 0331743
- Alston S. Householder, The theory of matrices in numerical analysis, Blaisdell Publishing Co. [Ginn and Co.], New York-Toronto-London, 1964. MR 0175290
- J. H. Wilkinson, Rounding errors in algebraic processes, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1963. MR 0161456
Additional Information
- © Copyright 1974 American Mathematical Society
- Journal: Math. Comp. 28 (1974), 537-542
- MSC: Primary 65F05
- DOI: https://doi.org/10.1090/S0025-5718-1974-0343559-8
- MathSciNet review: 0343559