Rehabilitation of the Gauss-Jordan algorithm |
| |
Authors: | T. J. Dekker W. Hoffmann |
| |
Affiliation: | (1) Department of Computer Systems, University of Amsterdam, Kruislaan 409, 1098 SJ Amsterdam, The Netherlands |
| |
Abstract: | Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties. |
| |
Keywords: | AMS(MOS): 65F05, 65G05, 15A06 CR: G1.3 |
本文献已被 SpringerLink 等数据库收录! |
|