Use of Iterative Refinement in the Solution of Sparse Linear Systems

It is well known that if Gaussian elimination with iterative refinement (IR) is used in the solution of systems of linear algebraic equations $Ax = b$ whose 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 time is needed to perform the iterative process) must be used with IR. Normally, when the matrix is sparse the accuracy of the solution computed by some sparse matrix technique and IR will still be greater. In this paper it is verified (by many numerical experiments) that the use of sparse matrix techniques with IR may also result in a reduction of both the computing time and the storage requirements (this will never happen when IR is applied for dense matrices). Two parameters, a drop-tolerance $T \geqq 0$ and a stability factor $u > 1$, are introduced in the effo...

[1]  H. Markowitz.  The Elimination form of the Inverse and its Application to Linear Programming , 1957 .

[2]  James Hardy Wilkinson,et al.  Rounding errors in algebraic processes , 1964, IFIP Congress.

[3]  J. H. Wilkinson,et al.  Note on the iterative refinement of least squares solution , 1966 .

[4]  R. J. Clasen.  Techniques for automatic tolerance control in linear programming , 1966, CACM.

[5]  John K. Reid,et al.  The Solution of Large Sparse Unsymmetric Systems of Linear Equations , 1971, IFIP Congress.

[6]  Fred G. Gustavson,et al.  Some Basic Techniques for Solving Sparse Systems of Linear Equations , 1972 .

[7]  G. Stewart.  Introduction to matrix computations , 1973 .

[8]  I. Duff,et al.  A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations , 1976 .

[9]  Åke Bjürck.  METHODS FOR SPARSE LINEAR LEAST SQUARES PROBLEMS , 1976 .

[10]  Michael A. Malcolm,et al.  Computer methods for mathematical computations , 1977 .

[11]  H. Wozniakowski,et al.  Iterative refinement implies numerical stability , 1977 .

[12]  Jerzy Wasniewski,et al.  Use of a semiexplicit Runge-Kutta integration algorithm in a spectroscopic problem , 1978, Comput. Chem..

[13]  J. H. Wilkinson,et al.  AN ESTIMATE FOR THE CONDITION NUMBER OF A MATRIX , 1979 .

[14]  P. G. Thomsen,et al.  Application of backward differentiation methods to the finite element solution of time‐dependent problems , 1979 .

[15]  Z. Zlatev.  On Some Pivotal Strategies in Gaussian Elimination by Sparse Technique , 1980 .

[16]  N. Munksgaard,et al.  Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients , 1980, TOMS.