Abstract
It is well-known that if Gaussian elimination (GE) with iterative refinement (IR) is used in the solution of systems of linear algebraic equations Ax=b whose coefficient matrices are dense, then the accuracy of the results will usually be greater than the accuracy obtained by the use of Gaussian elimination without iterative refinement (DS). However, both more storage (about 100% because a copy of matrix A is needed) and more computing time (some extra computing time is needed to perform the iterative process) must always be used with the IR process.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Zlatev, Z. (1991). Use of Iterative Refinement in the GE Process. In: Computational Methods for General Sparse Matrices. Mathematics and Its Applications, vol 65. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1116-6_5
Download citation
DOI: https://doi.org/10.1007/978-94-017-1116-6_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4086-2
Online ISBN: 978-94-017-1116-6
eBook Packages: Springer Book Archive