Computable Error Bounds for Direct Solution of Linear Equations

Authors:
Bruce A. Chartres;James C. Geuder
Affiliations:
University of Virginia, Charlottesville, Virginia;Division of Applied Mathematics Brown University, Providence, Rhode Island
Venue:
Journal of the ACM (JACM)
Year:
1967

Citing 3
Cited 4

The algebraic eigenvalue problem

The algebraic eigenvalue problem
Error Analysis of Direct Methods of Matrix Inversion

Journal of the ACM (JACM)
Rounding Errors in Algebraic Processes

Rounding Errors in Algebraic Processes

The Influence of the Compiler on the Cost of Mathematical Software—in Particular on the Cost of Triangular Factorization

ACM Transactions on Mathematical Software (TOMS)
A Survey of Indexing Techniques for Sparse Matrices

ACM Computing Surveys (CSUR)
A note on estimating the error in Gaussian elimination without pivoting

ACM SIGNUM Newsletter
A proposed numerical accuracy control system

Symposium on Interactive Systems for Experimental Applied Mathematics: Proceedings of the Association for Computing Machinery Inc. Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

An error analysis of direct methods (i.e., Gaussian elimination or triangular factorization) of solving simultaneous linear algebraic equations is performed in the backward mode, in which the computational errors are expressed as perturbations on the data. Bounds are found for perturbations on the coefficients of the equations, leaving the right-hand sides unchanged. These bounds can be evaluated concurrently with the computation itself, with only a small increase in computing effort. Because they use information obtained during the solution process, these bounds avoid exaggerating the magnitude of the error, and so are also useful as error estimates.