A note on estimating the error in Gaussian elimination without pivoting
- 1 April 1985
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGNUM Newsletter
- Vol. 20 (2) , 2-7
- https://doi.org/10.1145/1057941.1057942
Abstract
This article deals with the problem of estimating the error in the computed solution to a system of equations when that solution is obtained by using Gaussian elimination without pivoting. The corresponding problem, where either partial or complete pivoting is used, has received considerable attention, and efficient and reliable methods have been developed. However, in the context of solving large sparse systems, it is often very attractive to apply Gaussian elimination without pivoting, even though it cannot be guaranteed a-priori that the computation is numerically stable. When this is done, it is important to be able to determine when serious numerical errors have occurred, and to be able to estimate the error in the computed solution. In this paper a method for achieving this goal is described. Results of a large number of numerical experiments suggest that the method is both inexpensive and reliable.Keywords
This publication has 6 references indexed in Scilit:
- A Set of Counter-Examples to Three Condition Number EstimatorsSIAM Journal on Scientific and Statistical Computing, 1983
- Condition Number Estimation for Sparse MatricesSIAM Journal on Scientific and Statistical Computing, 1981
- Estimating Matrix Condition NumbersSIAM Journal on Scientific and Statistical Computing, 1980
- An Estimate for the Condition Number of a MatrixSIAM Journal on Numerical Analysis, 1979
- Monitoring the stability of the triangular factorization of a sparse matrixNumerische Mathematik, 1974
- Computable Error Bounds for Direct Solution of Linear EquationsJournal of the ACM, 1967