Residual smoothing techniques: Do they improve the limiting accuracy of iterative solvers?

BIT Numerical Mathematics

Volumn 41, Issue 1, 2001, Pages 86-114

  Gutknecht, Martin H ^a,b   Rozložnik, Miroslav ^a,b  

^a INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

^b ETH ZURICH   (Switzerland)

Author keywords

Iterative methods; Limiting accuracy; Residual smoothing

Indexed keywords

EID: 0345725586     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021917801600     Document Type: Article

References (33)

1. S. F. Ashby, T. A. Manteuffel, and P. E. Saylor, A taxonomy for conjugate gradient methods, SIAM J. Numer. Anal., 27 (1990), pp. 1542-1568.
2. P. N. Brown, A theoretical comparison of the Arnoldi and GMRES algorithms, SIAM J. Sci. Statist. Comput., 12 (1991), pp. 58-78.
3. L. Chunguang and X. Chengxian, A generalization of residual smoothing technique for iterative methods, Manuscript, 1998.
4. J. Cullum, Peaks, plateaus, numerical instabilities in a Galerkin/minimal residual pair of methods for solving Ax = b, Appl. Numer. Math., 19 (1995), pp. 255-278.
5. J. Cullum and A. Greenbaum, Relations between Galerkin and norm-minimizing iterative methods for solving linear systems, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 223-247.
6. R. Fletcher, Conjugate gradient methods for indefinite systems, in Numerical Analysis, Proceedings of the Dundee Conference on Numerical Analysis 1975, G. A. Watson, ed., Vol. 506 of Lecture Notes in Mathematics, Springer, Berlin, 1976, pp. 73-89.
7. R. W. Freund, M. H. Gutknecht, and N. M. Nachtigal, An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, SIAM J. Sci. Comput., 14 (1993), pp. 137-158.
8. R. W. Freund and N. M. Nachtigal, QMR: A quasi-minimal residual method for non-Hermitian linear systems, Numer. Math., 60 (1991), pp. 315-339.
9. R. W. Freund and N. M. Nachtigal, Implementation details of the coupled QMR algorithm, in Numerical Linear Algebra, L. Reichel, A. Ruttan, and R. S. Varga, eds., W. de Gruyter, 1993, pp. 123-140.
10. R. W. Freund and N. M. Nachtigal, An implementation of the QMR method based on coupled two-term recurrences, in Linear Algebra for Large Scale and Real-Time Applications, M. S. Moonen, G. H. Golub, and B. L. R. de Moor, eds., Kluwer Academic Publishers, Dordrecht, 1993, pp. 381-384.
11. R. W. Freund and N. M. Nachtigal, An implementation of the QMR method based on coupled two-term recurrences, SIAM J. Sci. Comput., 15 (1994), pp. 313-337.
12. A. Greenbaum, Estimating the attainable accuracy of recursively computed residual methods, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 535-551.
13. M. H. Gutknecht, The unsymmetric Lanczos algorithms and their relations to Padé approximation, continued fractions, and the qd algorithm, in Preliminary Proceedings of the Copper Mountain Conference on Iterative Methods, April 1990. http://wwa.sam.math.ethz.ch/~mhg/pub/CopperMtn90.ps.gz and CopperMtn90-7.ps.gz.
14. M. H. Gutknecht, Changing the norm in conjugate gradient type algorithms, SIAM J. Numer. Anal., 30 (1993), pp. 40-56.
15. M. H. Gutknecht, Lanczos-type solvers for nonsymmetric linear systems of equations, Acta Numerica, 6 (1997), pp. 271-397.
16. M. H. Gutknecht and M. Rozložník, Residual smoothing techniques: do they improve the limiting accuracy of iterative solvers?, Research Rep. 99-22, Seminar for Applied Mathematics, ETH Zurich, October 1999.
17. M. H. Gutknecht and M. Rozložník, By how much can residual minimization accelerate the convergence of orthogonal residual methods?, in Research Rep. 2000-09, Seminar for Applied Mathematics, ETH Zurich, July 2000.
18. M. H. Gutknecht and Z. Strakoš, Accuracy of two three-term and three two-term recurrences for Krylov space solvers, SIAM J. Matrix Anal. Appl., to appear.
19. M. R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bureau Standards, 49 (1952), pp. 409-435.
20. K. C. Jea and D. M. Young, On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems, Linear Algebra Appl., 52 (1983), pp. 399-417.
21. C. Lanczos, Solution of systems of linear equations by minimized iterations, J. Res. Nat. Bureau Standards, 49 (1952), pp. 33-53.
22. A. Neumaier, Iterative regularization for large-scale ill-conditioned linear systems, Talk at Oberwolfach, April 1994.
23. C. C. Paige and M. A. Saunders, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal., 12 (1975), pp. 617-629.
24. W. Schönauer, Scientific Computing on Vector Computers, Elsevier, Amsterdam, 1987.
25. G. L. G. Sleijpen and H. A. van der Vorst, Reliable updated residuals in hybrid Bi-CG methods, Computing, 56 (1996), pp. 141-163.
26. G. L. G. Sleijpen, H. A. van der Vorst, and D. R. Fokkema, BiCGstab(l) and other hybrid Bi-CG methods, Numerical Algorithms, 7 (1994), pp. 75-109.
27. G. L. G. Sleijpen, H. A. van der Vorst, and J. Modersitzki, Differences in the effects of rounding errors in Krylov solvers for symmetric indefinite linear systems, to appear in SIAM J. Matrix Anal. Appl..
28. E. Stiefel, Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme, Comm. Math. Helv., 29 (1955), pp. 157-179.
29. H. A. van der Vorst and Q. Ye, Residual replacement strategies for Krylov subspace iterative methods for the convergence of true residuals, preprint, 1999.
30. H. F. Walker, Residual smoothing and peak/plateau behavior in Krylov subspace methods, Appl. Numer. Math., 19 (1995), pp. 279-286.
31. R. Weiss, Convergence Behavior of Generalized Conjugate Gradient Methods, PhD thesis, University of Karlsruhe, 1990.
32. R. Weiss, Properties of generalized conjugate gradient methods, J. Numer. Linear Algebra Appl., 1 (1994), pp. 45-63.
33. L. Zhou and H. F. Walker, Residual smoothing techniques for iterative methods, SIAM J. Sci. Comput., 15 (1994), pp. 297-312.