IDR explained

Electronic Transactions on Numerical Analysis

Volumn 36, Issue , 2009, Pages 126-148

  Gutknecht, Martin H ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Bi CGSTAB; CGS; IDR; Induced dimension reduction; Iterative method; Krylov space method; Large nonsymmetric linear system; ML( )BiCGSTAB

Indexed keywords

DIMENSIONALITY REDUCTION; LINEAR SYSTEMS;

BI-CGSTAB; DIMENSION REDUCTION; KRYLOV SPACE METHOD; NONSYMMETRIC LINEAR SYSTEMS; ORTHOGONALITY CONDITIONS; TRADITIONAL APPROACHES;

ITERATIVE METHODS;

EID: 77955694677     PISSN: None     EISSN: 10689613     Source Type: Journal    
DOI: None     Document Type: Article

References (43)

1. J. I. ALIAGA, D. L. BOLEY, R. W. FREUND, AND V. HERNÁNDEZ, A Lanczos-type method for multiple starting vectors, Math. Comp., 69 (2000), pp. 1577-1601.
2. O. AXELSSON, Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations, Linear Algebra Appl., 29 (1980), pp. 1-16.
3. Z. BAI, D. DAY, AND Q. YE, ABLE: an adaptive block Lanczos method for non-Hermitian eigenvalue problems, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 1060-1082.
4. R. FLETCHER, Conjugate gradient methods for indefinite systems, in Numerical Analysis, Dundee, 1975, G. A. Watson, ed., vol. 506 of Lecture Notes in Mathematics, Springer, Berlin, 1976, pp. 73-89.
5. R. W. FREUND, Band Lanczos method (Section 4.6), in Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, and H. van der Vorst, eds., SIAM, Philadelphia, 2000, pp. 80-88.
6. - , Band Lanczos method (Section 7.10), in Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, and H. van der Vorst, eds., SIAM, Philadelphia, 2000, pp. 205-216.
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 M. MALHOTRA, A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides, Linear Algebra Appl., 254 (1997), pp. 119-157. (Pubitemid 127377532)
9. A. GREENBAUM, Estimating the attainable accuracy of recursively computed residual methods, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 535-551.
10. M. H. GUTKNECHT, Stationary and almost stationary iterative (κ, l)-step methods for linear and nonlinear systems of equations, Numer. Math., 56 (1989), pp. 179-213.
11. - , 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://www.sam.math.ethz.ch/-mhg/pub/CopperMtn90.ps.gz and http://www.sam.math. ethz.ch/-mhg/pub/CopperMtn90-7.ps.gz
12. - , Variants of BiCGStab for matrices with complex spectrum, SIAM J. Sci. Comput., 14 (1993), pp. 1020-1033.
13. - , Lanczos-type solvers for nonsymmetric linear systems of equations, Acta Numerica, 6 (1997), pp. 271-397.
14. M. H. GUTKNECHT AND K. J. RESSEL, Look-ahead procedures for Lanczos-type product methods based on three-term Lanczos recurrences, SIAM J. Matrix Anal. Appl., 21 (2000), pp. 1051-1078.
15. 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., 22 (2000), pp. 213-229.
16. M. R. HESTENES AND E. STIEFEL, Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bureau Standards, 49 (1952), pp. 409-435.
17. C. LANCZOS, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Nat. Bureau Standards, 45 (1950), pp. 255-281.
18. - , Solution of systems of linear equations by minimized iterations, J. Res. Nat. Bureau Standards, 49 (1952), pp. 33-53.
19. D. LOHER, Reliable nonsymmetric block Lanczos algorithms, PhD thesis, Diss. no. 16337, ETH Zurich, Zurich, Switzerland, 2006.
20. D. P. O'LEARY, The block conjugate gradient algorithm and related methods, Linear Algebra Appl., 29 (1980), pp. 293-322.
21. J. K. REID, On the method of conjugate gradients for the solution of large sparse systems of linear equations, in Large Sparse Sets of Linear Equations, Proceedings of the Oxford Conference of the Institute of Mathematics and its Applications held in April, 1970, J. K. Reid, ed., Academic Press, London, 1971, pp. 231-254.
22. Y. SAAD AND M. H. SCHULTZ, GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856-869.
23. V. SIMONCINI, A stabilized QMR version of block BICG, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 419-434.
24. G. L. G. SLEIJPEN AND D. R. FOKKEMA, BiCGstab(l) for linear equations involving unsymmetric matrices with complex spectrum, Electronic Trans. Numer. Anal., 1 (1993), pp. 11-32. http://etna.math.kent.edu/vol.1.1993/pp11-32.dir/.
25. G. L. G. SLEIJPEN, P. SONNEVELD, AND M. B. VAN GIJZEN, Bi-CGSTAB as an induced dimension reduction method, Report 08-07, Department of Applied Mathematical Analysis, Delft University of Technology, 2008.
26. G. L. G. SLEIJPEN AND H. A. VAN DER VORST, An overview of approaches for the stable computation of hybrid BiCG methods, Appl. Numer. Math., 19 (1995), pp. 235-254.
27. G. L. G. SLEIJPEN, H. A. VAN DER VORST, AND D. R. FOKKEMA, BiCGstab(l) and other hybrid Bi-CG methods, Numer. Algorithms, 7 (1994), pp. 75-109.
28. G. L. G. SLEIJPEN AND M. B. VAN GIJZEN, Exploiting BiCGstab(ℓ) strategies to induce dimension reduction, Report 09-02, Department of Applied Mathematical Analysis, Delft University of Technology, 2009.
29. P. SONNEVELD, CGS, a fast Lanczos-type solver for nonsymmetric linear systems, Report 84-16, Department of Mathematics and Informatics, Delft University of Technology, 1984.
30. P. SONNEVELD, private communication, 2009.
31. - , CGS, a fast Lanczos-type solver for nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 10 (1989), pp. 36-52.
32. P. SONNEVELD AND M. B. VAN GIJZEN, IDR(s): a family of simple and fast algorithms for solving large nonsymmetric systems of linear equations, Report 07-07, Department of Applied Mathematical Analysis, Delft University of Technology, 2007.
33. P. SONNEVELD AND M. B. VAN GIJZEN, IDR(s): a family of simple and fast algorithms for solving large nonsymmetric systems of linear equations, SIAM J. Sci. Comput., 31 (2008), pp. 1035-1062.
34. E. STIEFEL, Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme, Comm. Math. Helv., 29 (1955), pp. 157-179.
35. M. TANIO AND M. SUGIHARA, GBi-CGSTAB(s, L): IDR(s) with higher-order stabilization polynomials, Tech. Report METR 2009-16, Department of Mathematical Informatics, Graduate School of information Science and Technology, University of Tokyo, April 2009.
36. H. A. VAN DER VORST, Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 13 (1992), pp. 631-644.
37. H. A. VAN DER VORST AND P. SONNEVELD, CGSTAB, a more smoothly converging variant of CG-S, Report 90-50, Department of Mathematics and Informatics, Delft University of Technology, 1990.
38. M. B. VAN GIJZEN AND P. SONNEVELD, An elegant IDR(s) variant that efficiently exploits bi-orthogonality properties, Report 08-21, Department of Applied Mathematical Analysis, Delft University of Technology, 2008.
39. P. K. W. VINSOME, ORTHOMIN-an iterative method for solving sparse sets of simultaneous linear equations, in Proc. Fourth SPE Symposium on Reservoir Simulation, Los Angeles, 1976, pp. 149-160.
40. P. WESSELING AND P. SONNEVELD, Numerical experiments with a multiple grid and a preconditioned Lanczos type method, in Approximation methods for Navier-Stokes problems (Proc. Sympos., Univ. Paderborn, Paderborn, 1979), vol. 771 of Lecture Notes in Math., Springer, Berlin, 1980, pp. 543-562.
41. M.-C. YEUNG AND T. F. CHAN, ML(κ)BiCGSTAB: a BiCGSTAB variant based on multiple Lanczos starting vectors, SIAM J. Sci. Comput., 21 (1999), pp. 1263-1290.
42. D. M. YOUNG AND K. C. JEA, Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods, Linear Algebra Appl., 34 (1980), pp. 159-194.
43. J.-P. ZEMKE, private communication, 2006.