Computational Methods for General Sparse Matrices pp 259-267 | Cite as
Iterative Refinement after the Plane Rotations
Chapter
Abstract
All numerical results presented in the previous chapter are obtained by the use of iterative refinement (IR) after the calculation of the first solution. However, the classical manner of exploiting sparsity (see Chapter 1) is in fact used in the calculations because the drop-tolerance used is so small (T=10−25) that practically no non-zero elements are removed during the decomposition process.
Preview
Unable to display preview. Download preview PDF.
Copyright information
© Springer Science+Business Media Dordrecht 1991