Iterative refinement for linear systems and LAPACK

IMA Journal of Numerical Analysis

Volumn 17, Issue 4, 1997, Pages 495-509

  Higham, Nicholas J ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FIXED POINT ARITHMETIC; LINEAR SYSTEMS;

ARBITRARY NUMBER; ITERATIVE REFINEMENT; SOFTWARE LIBRARIES;

ITERATIVE METHODS;

EID: 0040649367     PISSN: 02724979     EISSN: None     Source Type: Journal    
DOI: 10.1093/imanum/17.4.495     Document Type: Article

References (18)

1. ANDERSON, E., BAI, Z., BISCHOF, C. H., DEMMEL, J. W., DONGARRA, J. J., Du CROZ, J. J., GREENBAUM, A., HAMMARLING, S. J., MCKENNEY, A., OSTROUCHOV, S., & SORENSEN, D. C. 1995 LAPACK Users' Guide, Release 2.0, second edition, Philadelphia, PA: Society for Industrial and Applied Mathematics. ISBN 0-89871-345-5.
2. ARIOLI, M., DEMMEL, J. W., & DUFF, I. S. 1989 Solving sparse linear systems with sparse backward error. SIAM J. Matrix Anal. Appl. 10, 165-190.
3. BUNCH, J. R., & KAUFMAN, L. 1977 Some stable methods for calculating inertia and solving symmetric linear systems. Math. Comput. 31, 163-179.
4. HIGHAM, N. J. 1991 Iterative refinement enhances the stability of QR factorization methods for solving linear equations. BIT 31, 447-468.
5. HIGHAM, N. J. 1995 The Test Matrix Toolbox for MATLAB (version 3.0). Numerical Analysis Report No 276, Manchester Centre for Computational Mathematics, Manchester, UK, September 1995.
6. HlGHAM, N. J. 1996 Accuracy and Stability of Numerical Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics. ISBN 0-89871-355-2.
7. HIGHAM, N. J. 1997 Stability of the diagonal pivoting method with partial pivoting. SIAM J. Matrix Anal. Appl. 18, 52-65.
8. HIGHAM, N. J., & KNIGHT, P. A. 1993 Componentwise error analysis for stationary iterative methods. Linear Algebra, Markov Chains, and Queueing Models (C. D. Meyer and R. J. Plemmons, eds), volume 48 of IMA Volumes in Mathematics and its Applications. New York: Springer, pp 29-46.
9. JANKOWSKI, M., & WOŹNIAKOWSKI, H. 1977 Iterative refinement implies numerical stability. BIT 17, 303-311.
10. KAHAN, W., & IVORY, M. Y. 1996 Roundoff degrades an idealized cantilever. Manuscript. Contained in the document with URL http://http.cs.berkeley.edu/wkahan/ ieee754status/baleful .ps, June 1996.
11. METCALF, M., & REID, J. K. 1990 Fortran 90 Explained. Oxford: Oxford University Press. ISBN 0-19-853772-7.
12. MOLER, C. B. 1967 Iterative refinement in floating point. J. Assoc. Comput. Mach. 14, 316-321.
13. OETTLI, W., & PRAGER, W. 1964 Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides. Numer. Math. 6, 405-409.
14. SKEEL, R. D. 1980 Iterative refinement implies numerical stability for Gaussian elimination. Math. Comput. 35, 817-832.
15. TREFETHEN, L. N., & SCHREIBER, R. S. 1990 Average-case stability of Gaussian elimination. SIAM J. Matrix Anal. Appl. 11, 335-360.
16. VAN DER SLUIS, A. 1969 Condition numbers and equilibration of matrices. Numer. Math. 14, 14-23.
17. WILKINSON, J. H. 1948 Progress report on the Automatic Computing Engine. Report MA/17/1024, Mathematics Division, Department of Scientific and Industrial Research, National Physical Laboratory, Teddington, UK, April 1948.
18. WILKINSON, J. H. 1963 Rounding Errors in Algebraic Processes (Notes on Applied Science No 32). London: Her Majesty's Stationery Office. Also published by Prentice-Hall, Englewood Cliffs, NJ, USA. Reprinted by Dover, New York, 1994. ISBN 0-486-67999-3.