Recent computational developments in Krylov subspace methods for linear systems

Numerical Linear Algebra with Applications

Volumn 14, Issue 1, 2007, Pages 1-59

  Simoncini, Valeria ^a,b,c   Szyld, Daniel B ^d  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b CNR   (Italy)

^c CIRSA   (Italy)

^d Temple University   (United States)

Author keywords

Iterative methods; Krylov subspaces; Linear systems

Indexed keywords

EID: 33846787171     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/nla.499     Document Type: Review

References (353)

1. Moneer M. Abu-Elnaga, Mona A. El-Kady, and Raymond D. Findlay. Sparse formulation of the transient energy function method for applications to large-scale power systems. IEEE Transactions on Power Systems 1988; 3:1648-1654.
2. Guillaume Alléon, Bruno Carpentieri, Iain S. Duff, Luc Giraud, Julien Langou, Émetic Martin, and Guillaume Sylvand. Efficient parallel iterative solvers for the solution of large dense linear systems arising from the boundary element method in electromagnetism. Proceedings of the International Conference on Supercomputing in Nuclear Application (SNA), Paris, September 2003.
3. Rajeev Alur and George J. Pappas, editors. Hybrid systems: computation and control. Proceedings of the 7th International Workshop, HSCC 2004, Philadelphia, PA, U.S.A., 25-27 March 2004. Lecture Notes in Computer Science, vol. 2993. Springer: New York, 2004.
4. Athanasios C. Antoulas, Danny C. Sorensen, and Serkan Gugercin. A survey of model reduction methods for large linear systems. Contemporary Mathematics 2001; 280:193-219.
5. Mario Arioli. A stopping criterion for the Conjugate Gradient algorithm in a finite element method framework. Numerische Mathematik 2004; 97:1-24.
6. Mario Arioli, Iain S. Duff, and Daniel Ruiz. Stopping criteria for iterative solvers. SIAM Journal on Matrix Analysis and Applications 1992; 13:138-144.
7. Mario Arioli, Daniel Loghin, and Andrew J. Wathen. Stopping criteria in finite element problems. Numerische Mathematik 2005; 99:381-410.
8. Mario Arioli, Eric Noulard, and Alessandro Russo. Stopping criteria for iterative methods: applications to PDEs. Calcolo 2001; 38:97-112.
9. Walter E. Arnoldi. The principle of minimized iteration in the solution of the matrix eigenvalue problem. Quarterly of Applied Mathematics 1951; 9:17-29.
10. Steven F. Ashby, Michael J. Holst, Thomas A. Manteuffel, and Paul E. Saylor. The role of the inner product in stopping criteria for Conjugate Gradient iterations. BIT Numerical Mathematics 2001; 41:26-52.
11. Steven F. Ashby, Thomas A. Manteuffel, and Paul E. Saylor. A taxonomy for Conjugate Gradient methods. SIAM Journal on Numerical Analysis 1990; 27:1542-1568.
12. Owe Axelsson. A generalized Conjugate Gradient, least squares method. Numerische Mathematik 1987; 51:209-227.
13. Owe Axelsson. Iterative Solution Methods. Cambridge University Press: Cambridge, New York, 1994.
14. Owe Axelsson and Vincent A. Barker. Finite Element Solution of Boundary Value Problems. Classics in Applied Mathematics, vol. 35. Academic Press: Orlando, 1984. Reprinted by SIAM: Philadelphia, PA, 2001.
15. Owe Axelsson and Igor Kaporin. Error norm estimation and stopping criteria in preconditioned Conjugate Gradient iterations. Numerical Linear Algebra with Applications 2001; 8:265-286.
16. Owe Axelsson and Andrey Kucherov. Real valued iterative methods for solving complex symmetric linear systems. Numerical Linear Algebra with Applications 2000; 7:197-218.
17. Owe Axelsson and Gunhild Lindskog. On the rate of convergence of the preconditioned Conjugate Gradient method. Numerische Mathematik 1986; 48:499-523.
18. Owe Axelsson and Panayot S. Vassilevski. A black box generalized Conjugate Gradient solver with inner iterations and variable-step preconditioning. SIAM Journal on Matrix Analysis and Applications 1991; 12:625-644.
19. James Baglama, Daniela Calvetti, Gene H. Golub, and Lothar Reichel. Adaptively preconditioned GMRES algorithms. SIAM Journal on Scientific Computing 1998; 20:243-269.
20. Zhaojun Bai, James Demmel, Jack Dongarra, Axel Ruhe, and Henk A. van der Vorst, editors. Templates for the Solution of Algebraic Eigenvalue Problems: a Practical Guide. SIAM: Philadelphia, PA, 2000.
21. Zhaojun Bai, Patrick M. Dewilde, and Roland W. Freund. Reduced-order modeling. In Handbook of Numerical Analysis. Numerical Methods in Electromagnetics, Schilder WHA, ter Maten JW (eds), vol. XIII. Elsevier: Amsterdam, 2005; 825-895.
22. Zhaojun Bai and Yangfeng Su. Dimension reduction of second-order dynamical systems via a second-order Arnoldi method. SIAM Journal on Scientific Computing 2005; 26:1692-1709.
23. Allison H. Baker, Elizabeth R. Jessup, and Thomas Manteuffel. A technique for accelerating the convergence of restarted GMRES. SIAM Journal on Matrix Analysis and Applications 2005; 26:962-984.
24. Randolph E. Bank and Tony F. Chan. An analysis of the composite step biconjugate gradient method. Numerische Mathematik 1993; 66:293-319.
25. Randolph E. Bank and Tony F. Chan. A composite step biconjugate gradient algorithm for nonsymmetric linear systems. Numerical Algorithms 1994; 7:1-16.
26. Richard Barrett, Michael W. Berry, Tony F. Chan, James Demmel, June Donato, Jack Dongarra, Victor Eijkhout, Roldan Pozo, Charles Romine, and Henk A. van der Vorst. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM: Philadelphia, PA, 1993.
27. Teri Barth and Thomas Manteuffel. Variable metric Conjugate Gradient methods. In Advances in Numerical Methods for Large Sparse Sets of Linear Equations, Matrix Analysis and Parallel Computing, PCG 94, Natori M, Nodera T (eds), vol. 10. Keio University: Yokohama, 1994; 165-188.
28. Bernhard Beckermann, Sergei A. Goreinov, and Eugene E. Tyrtyshnikov. Some remarks on the Elman estimate for GMRES. SIAM Journal on Matrix Analysis and Applications 2006; 27:772-778.
29. Bernhard Beckermann and Arno B.J. Kuijlaars. Superlinear convergence of Conjugate Gradients. SIAM Journal on Numerical Analysis 2001; 39:300-329.
30. Bernhard Beckermann and Arno B.J. Kuijlaars. Superlinear CG convergence for special right-hand sides. Electronic Transactions on Numerical Analysis 2002; 14:1-19.
31. Peter Benner, Gene H. Golub, Volker Mehrmann, and Danny C. Sorensen, editors. Dimension Reduction of Large-Scale Systems. Lecture Notes in Computational Science and Engineering, vol. 25. Springer: Berlin, Heidelberg, 2005.
32. Michele Benzi. Preconditioning techniques for large linear systems: a survey. Journal of Computational Physics 2002; 182:418-477.
33. Michele Benzi, Gene H. Golub, and Jörg Liesen. Numerical solution of saddle point problems. Acta Numerica 2005; 14:1-137.
34. Michele Benzi and Valeria Simoncini. On the eigenvalues of a class of saddle point matrices. Numerische Mathematik 2006; 103:173-196.
35. George Biros and Omar Ghattas. Parallel Lagrange-Newton-Krylov-Schur methods for PDE-constrained optimization. Part I: The Krylov-Schur solver. SIAM Journal on Scientific Computing 2005; 27:687-713.
36. Åke Björck. Numerical Methods for Least Squares Problems. SIAM: Philadelphia, PA, 1996.
37. Amina Bouras and Valérie Frayssé. A relaxation strategy for inexact matrix-vector products for Krylov methods. Technical Report 15, CERFACS, Toulouse, France, 2000.
38. Amina Bouras and Valérie Frayssé. Inexact matrix-vector products in Krylov methods for solving linear systems: a relaxation strategy. SIAM Journal on Matrix Analysis and Applications 2005; 26:660-678.
39. Amina Bouras, Valérie Frayssé, and Luc Giraud. A relaxation strategy for inner-outer linear solvers in domain decomposition methods. Technical Report 17, CERFACS, Toulouse, France, 2000.
40. William E. Boyse and Andrew A. Seidl. A block QMR method for computing multiple simultaneous solutions to complex symmetric systems. SIAM Journal on Scientific Computing 1996; 17:263-274.
41. James H. Bramble and Joseph E. Pasciak. A preconditioning technique for indefinite systems resulting from mixed approximations of elliptic problems. Mathematics of Computation 1988; 50:1-17.
42. Claude Brezinski. Projection Methods for Systems of Equations. North-Holland: Amsterdam, 1997.
43. Claude Brezinski and Michela Redivo Zaglia. Hybrid procedures for solving linear systems. Numerische Mathematik 1994; 67:1-19.
44. Claude Brezinski and Michela Redivo Zaglia. Look-ahead in Bi-CGSTAB and other product methods for linear systems. BIT 1995; 35:169-201.
45. Claude Brezinski and Michela Redivo Zaglia. Transpose-free Lanczos-type algorithm for nonsymmetric linear systems. Numerical Algorithms 1998; 17:67-103.
46. Claude Brezinski, Michela Redivo Zaglia, and Hassane Sadok. Avoiding breakdown and near-breakdown in Lanczos type algorithms. Numerical Algorithms 1991; 1:261-284.
47. Claude Brezinski, Michela Redivo Zaglia, and Hassane Sadok. A breakdown-free Lanczos type algorithm for solving linear systems. Numerische Mathematik 1992; 63:29-38.
48. Claude Brezinski, Michela Redivo Zaglia, and Hassane Sadok. Breakdowns in the implementation of the Lanczos method for solving linear systems. Computers and Mathematics with Applications 1997; 33:31-44.
49. Claude Brezinski, Michela Redivo Zaglia, and Hassane Sadok. New look-ahead Lanczos-type algorithms for linear systems. Numerische Mathematik 1999; 83:53-85.
50. Peter N. Brown. A theoretical comparison of the Arnoldi and the GMRES algorithms. SIAM Journal on Scientific and Statistical Computing 1991; 12:58-78.
51. Charles G. Broyden. A class of methods for solving nonlinear simultaneous equations. Mathematics of Computation 1965; 19:577-593.
52. Charles G. Broyden. A new taxonomy of Conjugate Gradient methods. Computers and Mathematics with Applications 1996; 31:7-17.
53. Charles G. Broyden and Maria T. Vespucci. Krylov Solvers for Linear Algebraic Systems. Studies in Computational Mathematics, vol. 11. Elsevier: Amsterdam, 2004.
54. Are Magnus Bruaset. A Survey of Preconditioned Iterative Methods, Pitman Research Notes in Mathematics Series, vol. 328. Lonman Scientific and Technical: Harlow, Esssex, England, 1995.
55. Angelika Bunse-Gerstner and Ronald Stöver. On a Conjugate Gradient-type method for solving complex symmetric linear systems. Linear Algebra and its Applications 1999; 287:105-123.
56. Xiao-Chuan Cai, William D. Gropp, David E. Keyes, Robin G. Melvin, and David P. Young. Parallel Newton-Krylov-Schwarz algorithms for the transonic full potential equation. SIAM Journal on Scientific Computing 1998; 19:246-265.
57. Xiao-Chuan Cai and Olof B. Widlund. Multiplicative Schwarz algorithms for some nonsymmetric and indefinite problems. S1AM Journal on Numerical Analysis 1993; 30:936-952.
58. Daniela Calvetti, Bryan W. Lewis, and Lothar Reichel. On the regularizing properties of the GMRES method. Numerische Mathematik 2002; 91:605-625.
59. Daniela Calvetti, Serena Morigi, Lothar Reichel, and Fiorella Sgallari. Computable error bounds and estimates for the Conjugate Gradient Method. Numerical Algorithms 2000; 25:79-88.
60. Sergio Campobasso. Effects of flow instabilities on the linear Harmonic analysis of unsteady flow in turbomachinery. Ph.D. Thesis, Oxford University, Trinity Term, 2004.
61. Zhi-Hao Cao. On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems. Applied Numerical Mathematics 1998; 27:123-140.
62. Bruno Carpentieri, Iain S. Duff, and Luc Giraud. A class of spectral two-level preconditioners. SIAM Journal on Scientific Computing 2003; 25:749-765.
63. Bruno Carpentieri, Iain S. Duff, Luc Giraud, and Guillaume Sylvand. Combining fast multipole techniques and an approximate inverse preconditioner for large electromagnetism calculations. SIAM Journal on Scientific Computing 2005; 27:774-792.
64. Tony F. Chan, Efstratios Gallopoulos, Valeria Simoncini, Tedd Szeto, and Charles H. Tong. A quasi-minimal residual variant of the Bi-CGSTAB algorithm for nonsymmetric systems. SIAM Journal on Scientific Computing 1994; 15:338-347.
65. Tony F. Chan and Tedd Szeto. Composite step product methods for solving nonsymmetric linear systems. SIAM Journal on Scientific Computing 1996; 17:1491-1508.
66. Andrew Chapman and Yousef Saad. Deflated and augmented Krylov subspace techniques. Numerical Linear Algebra with Applications 1997; 4:43-66.
67. David C. Chatfield, Melissa S. Reeves, Donald G. Truhlar, Csilla Duneczky, and David W. Schwenke. Complex generalized minimal residual algorithm for iterative solution of quantum mechanical reactive scattering equations. Journal of Chemical Physics 1992; 97:8322-8333.
68. Ke Chen. Matrix Preconditioning Techniques and Applications. Cambridge Monograph on Applied and Computational Mathematics, vol. 19. Cambridge University Press: Cambridge, U.K., 2005.
69. Anthony T. Chronopoulos. s-step iterative methods for (non)symmetric (in)definite linear systems. SIAM Journal on Numerical Analysis 1991; 28:1776-1789.
70. Paul Concus and Gene H. Golub. A generalized Conjugate Gradient method for nonsymmetric linear equations. In Computing Methods in Applied Science and Engineering, Glowinski R, Lions J-L (eds). Lecture Notes in Economics and Mathematical Systems, vol. 134. Springer: New York, 1976; 56-65.
71. Jane Cullum. Peaks, plateaux, and numerical stabilities in a Galerkin/minimal residual pair of methods for solving Ax = b. Applied Numerical Mathematics 1995; 19:255-278.
72. Jane Cullum. Iterative methods for solving Ax = b, GMRES/FOM versus QMR/BiCG. Advances in Computational Mathematics 1996; 6:1-24.
73. Jane Cullum and Anne Greenbaum. Relations between Galerkin and norm-minimizing iterative methods for solving linear systems. SIAM Journal on Matrix Analysis and Applications 1996; 17:223-247.
74. Jane Cullum, Wolfgang Kerner, and Ralph A. Willoughby. A generalized nonsymmetric Lanczos procedure. Computer Physics Communications 1989; 53:19-48.
75. Jane Cullum and Ralph A. Willoughby. Lanczos Algorithms for Large Symmetric Eigenvalue Computations. Classics in Applied Mathematics, vol. 41. Birkhaüser: Basel, 1985. vol. 1. Theory, vol. 2. Programs. Vol. 1 reprinted by SIAM: Philadelphia, PA, 2002.
76. Nigel Cundy, Jasper van den Eshof, Andreas Frommer, Thomas Lippert, Stefan Krieg, and Katrin Schäfer. Numerical methods for the QCD overlap operator: III. Nested iterations. Computer Physics Communications 2005; 165:221-242.
77. Germund Dahlquist, Gene H. Golub, and Stephen G. Nash. Bounds for the error in linear systems. In Workshop on Semi-Infinite Programming, Hettich R (ed.). Springer: Berlin, 1978; 154-172.
78. Biswa N. Datta and Yousef Saad. Arnoldi methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment. Linear Algebra and its Applications 1991; 154-156:225-244.
79. Philip J. Davis. Interpolation and Approximation. Blaisdell: New York, Toronto, London, 1963. Reprinted by Dover: New York, 1975.
80. David Day and Michael A. Heroux. Solving complex-valued linear systems via equivalent real formulations. SIAM Journal on Scientific Computing 2001; 23(2):480-498.
81. Eric de Sturler. Nested Krylov methods based on GCR. Journal of Computational and Applied Mathematics 1996; 67:15-41.
82. Eric de Sturler. A performance model for Krylov subspace methods on mesh-based parallel computers. Parallel Computing 1996; 22:57-74.
83. Eric de Sturler. Truncation strategies for optimal Krylov subspace methods. SIAM Journal on Numerical Analysis 1999; 36:864-889.
84. Victorita Dolean and Stéphane Lanteri. Parallel multigrid methods for the calculation of unsteady flows on unstructured grids: algorithmic aspects and parallel performance on clusters of PCs. Parallel Computing 2004; 30:503-525.
85. Tobin A. Driscol, Kim-Chuan Toh, and Lloyd N. Trefethen. From potential theory to matrix iterations in six steps. SIAM Review 1998; 40:547-578.
86. Iain S. Duff. Combining direct and iterative methods for the solution of large linear systems in different application areas. Technical Report RAL-TR-2004-033, Rutherford Appleton Laboratory, Chilton, Didcot, Oxfordshire, U.K., 2004. Also TR/PA/04/128, CERFACS, Toulouse, France.
87. Iain S. Duff. MA57 - a code for the solution of sparse symmetric indefinite systems. ACM Transactions on Mathematical Software 2004; 30:118-144.
88. Iain S. Duff, Albert M. Erisman, and John K. Reid. Direct Methods for Sparse Matrices. Clarendon Press: Oxford, 1986. (2nd edn. in preparation).
89. Iain S. Duff and Jennifer A. Scott. A parallel direct solver for large sparse highly unsymmetric linear systems. ACM Transactions on Mathematical Software 2004; 30:95-117.
90. Jitka Dřkosová, Anne Greenbaum, Miroslav Rozložnik, and Zdeněk Strakoš. Numerical stability of the GMRES method. BIT Numerical Mathematics 1995; 35:308-330.
91. Michael Eiermann. Field of values and iterative methods. Linear Algebra and its Applications 1993; 180:167-197.
92. Michael Eiermann and Oliver G. Ernst. Geometric aspects in the theory of Krylov subspace methods. Acta Numerica 2001; 10:251-312.
93. Michael Eiermann and Oliver G. Ernst A restarted Krylov subspace method for the evaluation of matrix functions. Technical Report, Institut für Numerische Mathematik und Optimierung, Techniche Universität Bergakademie Freiberg, June 2005; SIAM Journal on Numerical Analysis, in press.
94. Michael Eiermann, Oliver G. Ernst, and Olaf Schneider. Analysis of acceleration strategies for restarted minimal residual methods. Journal of Computational and Applied Mathematics 2000; 123:261-292.
95. Timo Eirola and Olavi Nevanlinna. Accelerating with rank-one updates. Linear Algebra and its Applications 1989; 121:511-520.
96. Stanley C. Eisenstat, Howard C. Elman, and Martin H. Schultz. Variational iterative methods for nonsymmetric systems of linear equations. SIAM Journal on Numerical Analysis 1983; 20:345-357.
97. Stanley C. Eisenstat, James M. Ortega, and Courtenay T. Vaughan. Efficient polynomial preconditioning for the Conjugate Gradient method. SIAM Journal on Scientific and Statistical Computing 1990; 11:859-872.
98. Howard C. Elman. Iterative methods for large sparse nonsymmetric systems of linear equations. Ph.D. Thesis, Yale University: New Haven, CT, 1982.
99. Howard C. Elman, Oliver G. Ernst, and Dianne P. O'Leary. A multigrid method enhanced by Krylov subspace iteration for discrete Helmholtz equations. SIAM Journal on Scientific Computing 2001; 23:1290-1314.
100. Howard C. Elman, David J. Silvester, and Andrew J. Wathen. Finite Elements and Fast Iterative Solvers, with Applications in Incompressible Fluid Dynamics, Numerical Mathematics and Scientific Computation, vol. 21. Oxford University Press: Oxford, New York, 2005.
101. Mark Embree. Convergence of Krylov subspace methods for non-normal matrices. Ph.D. Thesis, Oxford University Computing Laboratory, Numerical Analysis Group, Michaelmas Term, 1999.
102. Mark Embree. The tortoise and the hare restart GMRES. SIAM Review 2003; 45:259-266.
103. Shlomo Engelberg and Aaron E. Naiman. A note on Conjugate Gradient convergence. Part III. Numerische Mathematik 2000; 85:685-696.
104. Jocelyne Erhel. A parallel GMRES version for general sparse matrices. Electronic Transactions on Numerical Analysis 1995; 3:160-176.
105. Jocelyne Erhel, Kevin Burrage, and Bert Pohl. Restarted GMRES preconditioned by deflation. Journal of Computational and Applied Mathematics 1996; 69:303-318.
106. Jocelyne Erhel and Frédéric Guyomarc'h. An augmented Conjugate Gradient method for solving consecutive symmetric positive definite linear systems. SIAM Journal on Matrix Analysis and Applications 2000; 21:1279-1299.
107. Oliver G. Ernst. Residual-minimizing Krylov subspace methods for stabilized discretizations of convection-diffusion equations. SIAM Journal on Matrix Analysis and Applications 2000; 21:1079-1101.
108. Azeddine Essai. Weighted FOM and GMRES for solving nonsymmetric linear systems. Numerical Algorithms 1998; 18:277-292.
109. Vance Faber, Wayne D. Joubert, Emanuel Knill, and Thomas A. Manteuffel. Minimal residual method stronger than polynomial preconditioning. SIAM Journal on Matrix Analysis and Applications 1996; 17:707-729.
110. Vance Faber and Thomas A. Manteuffel. Necessary and sufficient conditions for the existence of a Conjugate Gradient method. SIAM Journal on Numerical Analysis 1984; 21:352-362.
111. Vance Faber and Thomas A. Manteuffel. Orthogonal error methods. SIAM Journal on Numerical Analysis 1987; 24:170-187.
112. Heike Fassbender and Khakim D. Ikramov. SYMMLQ-like procedure of Ax=b where A is a special normal matrix. Calcolo 2006; 43:17-37.
113. Peter Feldmann, Roland W. Freund, and Emrah Acar. Power grid analysis using a flexible conjugate gradient algorithm with sparsification. Technical Report, Department of Mathematics, University of California, Davis, June 2006.
114. Anna Feriani, Federico Perotti, and Valeria Simoncini. Iterative system solvers for the frequency analysis of linear mechanical systems. Computer Methods in Applied Mechanics and Engineering 2000; 190:1719-1739.
115. Bernd Fischer. Polynomial Based Iteration Methods for Symmetric Linear Systems. Wiley/Teubner: Chichester, West Essex, England, Stuttgart, 1996.
116. Bernd Fischer and Roland W. Freund. An inner product-free Conjugate Gradient-like algorithm for Hermitian positive definite systems. In Proceedings of the Cornelius Lanczos International Centenary Conference, David Brown J, Chu MT, Ellison DC, Plemmons RJ (eds). SIAM: Philadelphia, PA, 1994; 288-290.
117. Bernd Fischer and Gene H. Golub. On the error computation for polynomial based iteration methods. In Recent Advances in Iterative Methods, Golub GH, Greenbaum A, Luskin M (eds). Springer: New York, 1994; 59-67.
118. Bernd Fischer, Alison Ramage, David J. Silvester, and Andrew J. Wathen. Minimum residual methods for augmented systems. BIT Numerical Mathematics 1998; 38:527-543.
119. Matthias Fischer and Lothar Gaul. Fast BEM-FEM mortar coupling for acoustic-structure interaction. International Journal for Numerical Methods in Engineering 2005; 62:1677-1690.
120. Roger Fletcher. Conjugate Gradient methods for indefinite systems. In Numerical Analysis-Dundee 1975, Alistair Watson G (ed.). Lecture Notes in Mathematics, vol. 506. Springer: Heidelberg, 1976; 73-89.
121. Diederik R. Fokkema, Gerard L.G. Sleijpen, and Henk A. van der Vorst. Generalized conjugate gradient squared. Journal of Computational and Applied Mathematics 1996; 71:125-146.
122. Jason Frank and C. (Kees) Vuik. On the construction of deflation-based preconditioners. SIAM Journal on Scientific Computing 2001; 23:442-462.
123. Roland W. Freund. On Conjugate Gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices. Numerische Mathematik 1990; 57:285-312.
124. Roland W. Freund. Conjugate Gradient-type methods for linear systems with complex symmetric coefficient matrices. SIAM Journal on Scientific and Statistical Computing 1992; 13:425-448.
125. Roland W. Freund. Quasi-kernel polynomials and convergence results for quasi-minimal residual iterations. In Numerical Methods in Approximation Theory, vol. 9. Braess D, Schumaker LL (eds), Birkhäuser: Basel, 1992; 77-95.
126. Roland W. Freund. Solution of shifted linear systems by quasi-minimal residual iterations. In Numerical Linear Algebra, Reichel L, Ruttan A, Varga RS (eds). W. de Gruyter: Berlin, 1993; 101-121.
127. Roland W. Freund. Transpose-free quasi-minimal residual methods for non-Hermitian linear systems. In Recent Advances in Iterative Methods, vol. 60. Golub GH, Greenbaum A, Luskin M (eds). IMA Volumes in Mathematics and its Applications, Springer: New York, 1994; 69-94.
128. Roland W. Freund. Model reduction methods based on Krylov subspaces. Acta Numerica 2003; 12:267-319.
129. Roland W. Freund. Krylov subspaces associated with higher-order linear dynamical systems. BIT Numerical Mathematics 2005; 45:495-516.
130. Roland W. Freund. Padé-type model reduction of second-order and higher-order linear dynamical systems. In Dimension Reduction of Large-Scale Systems, Benner P, Mehrmann V, Sorensen DC (eds), Lecture Notes in Computational Science and Engineering, vol. 45; Proceedings of a Workshop held in Oberwolfach, Germany, 19-25 October 2003. Springer: Berlin, Heidelberg, 2005; 191-223.
131. Roland W. Freund, Gene H. Golub, and Noel M. Nachtigal. Iterative solution of linear systems. Acta Numerica 1992; 1:57-100.
132. Roland W. Freund, Gene H. Golub, and Nöel M. Nachtigal. Recent advances in Lanczos-based iterative methods for nonsymmetric linear systems. In Algorithmic Trends in Computational Fluid Dynamics, Hussaini MY, Kumar A, Salas MD (eds). Springer: Berlin, 1993; 137-162.
133. Roland W. Freund, Martin H. Gutknecht, and Nöel M. Nachtigal. An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices. S1AM Journal on Scientific Computing 1993; 14:137-158.
134. Roland W. Freund and Marlis Hochbruck. On the use of two QMR algorithms for solving singular systems and applications in Markov Chain modelling. Numerical Linear Algebra with Applications 1994; 1:403-420.
135. Roland W. Freund and Nöel M. Nachtigal. QMR: a quasi-minimal residual method for non-Hermitian linear systems. Numerische Mathematik 1991; 60:315-339.
136. Roland W. Freund and Nöel M. Nachtigal. An implementation of the QMR method based on coupled two-term recurrences. SIAM Journal on Scientific Computing 1994; 15:313-337.
137. Roland W. Freund and Nöel M. Nachtigal. Software for simplified Lanczos and QMR algorithms. Applied Numerical Mathematics 1995; 19:319-341.
138. Vladimir M. Fridman. The method of minimal iterations with minimum errors for a system of linear algebraic equations with symmetric matrix. Zhurnal Vychislitelc nou Matematiki i Matematichskou i Fiziki 1962; 2:341-342 (in Russian).
139. English translation in USSR Computational Mathematics and Mathematical Physics 1963; 2:362-363.
140. Andreas Frommer. BiCGSTAB(ℓ) for families of shifted linear systems. Computing 2003; 70:87-109.
141. Andreas Frommer and Uwe Glässner. Restarted GMRES for shifted linear systems. SIAM Journal on Scientific Computing 1998; 19:15-26.
142. Andreas Frommer and Peter Maass. Fast CG-based methods for Tikhonov-Phillips regularization. SIAM Journal on Scientific Computing 1999; 20:1831-1850.
143. Andreas Frommer and Andre Weinberg. Verified error bounds for linear systems through the Lanczos process. Reliable Computing 1999; 5:255-267.
144. Luc Giraud, Serge Gratton, and Julien Langou. Convergence in backward error of relaxed GMRES. Technical Report TR/PA/06/08, CERFACS, Toulouse, France, 2006.
145. Luc Giraud, Serge Gratton, and Émeric Martin. Incremental spectral preconditioners for sequences of linear systems. Technical Report TR/PA/05/17, CERFACS, Toulouse, France, 2005; Applied Numerical Mathematics, in press.
146. Israel Gohberg, Peter Lancaster, and Leiba Rodman. Matrices and Indefinite Scalar Products, Operator Theory: Advances and Applications, vol. 8. Birkhäuser: Basel, Boston, 1983.
147. Israel Gohberg, Leiba Rodman, and Peter Lancaster. Matrix Polynomials. Academic Press: New York, 1982.
148. Gene H. Golub and Gérard A. Meurant. Matrices, moments and quadrature II; how to compute the norm of the error in iterative methods. BIT 1997; 37:687-705.
149. Gene H. Golub and Dianne P. O'Leary. Some history of the Conjugate Gradient and Lanczos algorithms: 1948-1976. SIAM Review 1989; 31:50-102.
150. Gene H. Golub and Michael L. Overton. The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems. Numerische Mathematik 1988; 53:571-593.
151. Gene H. Golub and Zdenek Strakoš. Estimates in quadratic formulas. Numerical Algorithms 1994; 8:241-268.
152. Gene H. Golub and Charles F. Van Loan. Matrix Computations (3rd edn). The John Hopkins University Press: Baltimore, 1996.
153. Gene H. Golub and Qiang Ye. Inexact inverse iterations for the generalized eigenvalue problems. BIT Numerical Mathematics 2000; 40:671-684.
154. Gene H. Golub and Qiang Ye. Inexact preconditioned Conjugate Gradient method with inner-outer iteration. SIAM Journal on Scientific Computing 2001; 21:1305-1320.
155. Gene H. Golub, Zhenyue Zhang, and Hongyuan Zha. Large sparse symmetric eigenvalue problems with homogeneous linear constraints: the Lanczos process with inner-outer iterations. Linear Algebra and its Applications 2000; 309:289-306.
156. Serge Goossens and Dirk Roose. Ritz and harmonic Ritz values and the convergence of FOM and GMRES. Numerical Linear Algebra with Applications 1999; 6:281-293.
157. Serge Gratton. Private communication, 2005.
158. Anne Greenbaum. Estimating the attainable accuracy of recursively computed residual methods. SIAM Journal on Matrix Analysis and Applications 1997; 18:535-551.
159. Anne Greenbaum. Iterative Methods for Solving Linear Systems, Frontiers in Applied Mathematics, vol. 17. SIAM: Philadelphia, PA, 1997.
160. Anne Greenbaum. Some theoretical results derived from polynomial numerical hulls of Jordan blocks. Electronic Transactions on Numerical Analysis 2004; 18:81-90.
161. Anne Greenbaum and Leonid Gurvits. Max-min properties of matrix factor forms. SIAM Journal on Scientific Computing 1994; 15:348-358.
162. Anne Greenbaum and Leonid Gurvits. A further note on max-min properties of matrix factor forms. SIAM Journal on Scientific Computing 1995; 16:496-499.
163. Anne Greenbaum, Vlastimil Pták, and Zdeněk Strakoš. Any nonincreasing convergence curve is possible for GMRES. SIAM Journal on Matrix Analysis and Applications 1996; 17:95-118.
164. Anne Greenbaum, Miroslav Rozložnik, and Zdeněk Strakoš. Numerical behaviour of the modified Gram-Schmidt GMRES implementation. BIT Numerical Mathematics 1997; 37:706-719.
165. Anne Greenbaum and Zdeněk Strakoš. Matrices that generate the same Krylov residual spaces. In Recent Advances in Iterative Methods, Golub GH, Greenbaum A, Luskin M (eds). IMA Volumes in Mathematics and its Applications, vol. 60. Springer: New York, 1994; 95-118.
166. Anne Greenbaum and Lloyd N. Trefethen. GMRES/CR and Arnoldi/Lanczos as matrix approximation problems. SIAM Journal on Scientific Computing 1994; 15:359-368.
167. Roger G. Grimes, John G. Lewis, and Horst D. Simon. A shifted block Lanczos algorithm for solving sparse symmetric generalized eigenproblems. SIAM Journal on Matrix Analysis and Applications 1994; 15:228-272.
168. Martin H. Gutknecht. A completed theory of the unsymmetric Lanczos process and related algorithms. Part I. SIAM Journal on Matrix Analysis and Applications 1992; 13:594-639.
169. Martin H. Gutknecht. Changing the norm in Conjugate Gradient type algorithms. SIAM Journal on Numerical Analysis 1993; 30:40-56.
170. Martin H. Gutknecht. Variants of BiCGStab for matrices with complex spectrum. SIAM Journal on Scientific Computing 1993; 14:1020-1033.
171. Martin H. Gutknecht. A completed theory of the unsymmetric Lanczos process and related algorithms. Part II. SIAM Journal on Matrix Analysis and Applications 1994; 15:15-58.
172. Martin H. Gutknecht. Lanczos-type solvers for nonsymmetric linear systems of equations. Acta Numerica 1997; 6:271-397.
173. Martin H. Gutknecht. Block Krylov space methods for linear systems with multiple right-hand sides: an introduction. In Modern Mathematical Models, Methods and Algorithms for Real World Systems, Siddiqi AH, Duff IS, Christensen O (eds). Anamaya Publishers: New Delhi, 2006, in press.
174. Martin H. Gutknecht and Klaus J. Ressel. Look-ahead procedures for Lanczos-type product methods based on three-term Lanczos recurrences. SIAM Journal on Matrix Analysis and Applications 2000; 21:1051-1078.
175. Martin H. Gutknecht and Miroslav Rozložník. By how much can residual minimization accelerate the convergence of orthogonal residual methods? Numerical Algorithms 2001; 27:189-213.
176. Martin H. Gutknecht and Miroslav Rozložník. Residual smoothing techniques: do they improve the limiting accuracy of iterative solvers? BIT Numerical Mathematics 2001; 41:86-114.
177. Martin H. Gutknecht and Miroslav Rozložník. A framework for generalized conjugate gradient methods - with special emphasis on contributions by Rüdiger Weiss. Applied Numerical Mathematics 2002; 41:7-22.
178. Martin H. Gutknecht and Zdeněk Strakoš". Accuracy of two three-term and three two-term recurrences for Krylov space solvers. SIAM Journal on Matrix Analysis and Applications 2000; 22:213-229.
179. Martin Hanke, Marlis Hochbruck, and Wilhelm Niethammer. Experiments with Krylov subspace methods on a massively parallel computer. Applications of Mathematics 1993; 38:440-451.
180. Per Christian Hansen. Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion. SIAM Monographs on Mathematical Modeling and Computation, vol. 4. SIAM: Philadelphia, PA, 1997.
181. Magnus R. Hestenes and Eduard Stiefel. Methods of Conjugate Gradients for solving linear systems. Journal of Research of the National Bureau of Standards 1952; 49:409-436.
182. Marlis Hochbruck and Christian Lubich. On Krylov subspace approximations to the matrix exponential operator. SIAM Journal on Numerical Analysis 1997; 34:1911-1925.
183. Marlis Hochbruck and Christian Lubich. Error analysis of Krylov methods in a nutshell. SIAM Journal on Scientific Computing 1998; 19:695-701.
184. Marlis Hochbruck and Gerhard Starke. Preconditioned Krylov subspace methods for Lyapunov matrix equations. SIAM Journal on Matrix Analysis and Applications 1995; 16:156-171.
185. Roger A. Horn and Charles R. Johnson. Matrix Analysis. Cambridge University Press: Cambridge, 1985.
186. Dan Y. Hu and Lothar Reichel. Krylov-subspace methods for the Sylvester equation. Linear Algebra and its Applications 1992; 172:283-313.
187. Marko Huhtanen. A Hermitian Lanczos method for normal matrices. SIAM Journal on Matrix Analysis and Applications 2002; 23:1092-1108.
188. Ilse Ipsen. Expressions and bounds for the GMRES residual. BIT Numerical Mathematics 2000; 40:524-535.
189. David A. H. Jacobs. A generalization of the Conjugate-Gradient method to solve complex systems. IMA Journal on Numerical Analysis 1986; 6:447-452.
190. Carl Jagels and Lothar Reichel. The isometric Arnoldi process and an application to iterative solution of large linear systems. In Iterative Methods in Linear Algebra, Beauwens R, Pieter PN de Groen (eds). Elsevier Science/North-Holland: Amsterdam, 1992; 361-369.
191. Carl Jagels and Lothar Reichel. A fast minimal residual algorithm for shifted unitary matrices. Numerical Linear Algebra with Applications 1994; 1:361-369.
192. Kang C. Jea and David M. Young. On the simplification of generalized Conjugate-Gradient methods for nonsymmetrizable linear systems. Linear Algebra and its Applications 1983; 52-53:399-417.
193. Zhongxiao Jia. On IOM(q): the incomplete orthogonalization method for large unsymmetric linear systems. Numerical Linear Algebra with Applications 1996; 3:491-512.
194. Olin J. Johnson, Charles A. Micchelli, and George Paul. Polynomial preconditioners for Conjugate Gradient calculations. SIAM Journal on Numerical Analysis 1983; 20:362-376.
195. Pascal Joly and Gérard Meurant. Complex Conjugate Gradient methods. Numerical Algorithms 1993; 4:379-406.
196. Wayne D. Joubert. Lanczos methods for the solution of nonsymmetric systems of linear equations. SIAM Journal on Matrix Analysis and Applications 1992; 13:926-943.
197. Wayne D. Joubert. A robust GMRES-based adaptive polynomial preconditioning algorithm for nonsymmetric linear systems. SIAM Journal on Scientific Computing 1994; 15:427-439.
198. Wayne D. Joubert. On the convergence behaviour of the restarted GMRES algorithm for solving nonsymmetric linear systems. Numerical Linear Algebra with Applications 1994; 1:427-447.
199. Erik F. Kaasschieter. Preconditioned conjugate gradients for solving singular systems. Journal of Computational and Applied Mathematics 1988; 24:265-275.
200. Igor Kaporin. Superlinear convergence in minimum residual iterations. Numerical Linear Algebra with Applications 2005; 12:453-470.
201. Ebrahim M. Kasenally. GMBACK: a generalised minimum backward error algorithm for nonsymmetric linear systems. SIAM Journal on Scientific Computing 1995; 16:698-719.
202. Ebrahim M. Kasenally and Valeria Simoncini. Analysis of a minimum perturbation algorithm for nonsymmetric linear systems. SIAM Journal on Numerical Analysis 1997; 34:48-66.
203. C. T. (Tim) Kelley. Iterative Methods for Linear and Nonlinear Equations. SIAM: Philadelphia, PA, 1995.
204. C. T. (Tim) Kelley and Zhaoqin Q. Xue. GMRES and integral operators. SIAM Journal on Scientific Computing 1996; 17:217-226.
205. Serge A. Kharchenko and Alex Yu. Yeremin. Eigenvalue translation based preconditioners for the GMRES(k) method. Numerical Linear Algebra with Applications 1995; 2:51-77.
206. Dana A. Knoll and David E. Keyes. Jacobian-free Newton-Krylov methods: a survey of approaches and applications. Journal of Computational Physics 2004; 193:357-397.
207. Audrey Kucherov. A fast iterative method for solving in real arithmetic a system of linear equations with a complex symmetric matrix. Sovietsky Mathematischeskoe Doklady 1991; 43:377-379.
208. Arno B.J. Kuijlaars. Convergence analysis of Krylov subspace iterations with methods from potential theory. SIAM Review 2006; 48:3-40.
209. Cornelius Lanczos. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. Journal of Research of the National Bureau of Standards 1950; 45:255-282.
210. Cornelius Lanczos. Solution of linear equations by minimized iterations. Journal of Research of the National Bureau of Standards 1952; 49:33-53.
211. Jörg Liesen. Computable convergence bounds for GMRES. SIAM Journal on Matrix Analysis and Applications 2000; 21:882-903.
212. Jörg Liesen, Miroslav Rozložník, and Zdeněk Strakoš. Least squares residuals and minimal residual methods. SIAM Journal on Scientific Computing 2002; 23:1503-1525.
213. Jörg Liesen and Paul E. Saylor. Orthogonal Hessenberg reduction and orthogonal Krylov subspace bases. SIAM Journal on Numerical Analysis 2005; 42:2148-2158.
214. Jörg Liesen and Zdeněk Strakoš. Convergence of GMRES for tridiagonal Toeplitz matrices. SIAM Journal on Matrix Analysis and Applications 2004; 26:233-251.
215. Jörg Liesen and Zdeněk Strakoš. GMRES convergence analysis for a convection-diffusion model problem. SIAM Journal on Scientific Computing 2005; 26:1989-2009.
216. Jörg Liesen and Zdeněk Strakoš. On numerical stability in large scale linear algebraic computations. Zeitschrift für Angewandte Mathematik und Mechanik 2005; 85:307-325.
217. Jörg Liesen and Petr Tichý. Convergence analysis of Krylov subspace methods. GAMM-Mitteilungen 2004; 27:153-173.
218. Jörg Liesen and Petr Tichý. The worst-case GMRES for normal matrices. BIT Numerical Mathematics 2004; 44:409-435.
219. Jörg Liesen and Petr Tichý. On the worst-case convergence of MR and CG for symmetric positive definite tridiagonal Toeplitz matrices. Electronic Transactions on Numerical Analysis 2005; 20:180-197.
220. Luciano Lopez and Valeria Simoncini. Analysis of projection methods for rational function approximation to the matrix exponential operator. SIAM Journal on Numerical Analysis 2006; 44:613-635.
221. David G. Luenberger. Linear and Nonlinear Programming (2nd edn). Addison-Wesley: Reading, MA, 1984.
222. Jan Mandel. On block diagonal and Schur complement preconditioning. Numerische Mathematik 1990; 58:79-93.
223. Lois Mansfield. On the use of deflation to improve the convergence of Conjugate Gradient iteration. Communications in Applied Numerical Methods 1988; 4:151-156.
224. Thomas A. Manteuffel and James Otto. On the roots of the orthogonal polynomials and residual polynomials associated with a Conjugate Gradient method. Numerical Linear Algebra with Applications 1994; 1:449-475.
225. Geoff Markham. Conjugate Gradient type methods for indefinite, asymmetric, and complex systems. IMA Journal of Numerical Analysis 1990; 10:155-170.
226. Jiri Maryška, Miroslav Rozložník, and Miroslav Tůma. Schur complement systems in the mixed-hybrid finite element approximation of the potential fluid flow problem. SIAM Journal on Scientific Computing 2000; 22:704-723.
227. Karl Meerbergen. The solution of parametrized symmetric linear systems. SIAM Journal on Matrix Analysis and Applications 2003; 24:1038-1059.
228. Gérard A. Meurant. The computation of bounds for the norm of the error in the Conjugate Gradient algorithm. Numerical Algorithms 1994; 16:77-87.
229. Gérard A. Meurant. Computer Solution of Large Linear Systems, Studies in Mathematics and its Applications, vol. 28. North-Holland: Amsterdam, 1999.
230. Gérard A. Meurant and Zdeněk Strakoš. The Lanczos and conjugate gradient algorithms in finite precision arithmetic. Acta Numerica 2006; 15:471-542.
231. István Montvay and Gernot Münster. Quantum Fields on the Lattice. Cambridge Monographs on Mathematical Physics. Cambridge University Press: Cambridge, New York, Melbourne, 1994.
232. Ronald B. Morgan. Computing interior eigenvalues of large matrices. Linear Algebra and its Applications 1991; 154-156:289-309.
233. Ronald B. Morgan. A restarted GMRES method augmented with eigenvectors. SIAM Journal on Matrix Analysis and Applications 1995; 16:1154-1171.
234. Ronald B. Morgan. Implicitly restarted GMRES and Arnoldi methods for nonsymmetric systems of equations. SIAM Journal on Matrix Analysis and Applications 2000; 21:1112-1135.
235. Ronald B. Morgan. GMRES with deflated restarting. SIAM Journal on Scientific Computing 2002; 24:20-37.
236. Reinhard Nabben and C. (Kees) Vuik. A comparison of deflation and coarse grid correction applied to porous media flow. SIAM Journal on Numerical Analysis 2004; 42:1631-1647.
237. Reinhard Nabben and C. (Kees) Vuik. A comparison of deflation and the balancing preconditioner. SIAM Journal on Scientific Computing 2006; 27:1742-1759.
238. Noel M. Nachtigal. A look-ahead variant of the Lanczos algorithm and its application to the quasi-minimal residual method for non-Hermitian linear systems. Ph.D. Thesis, Massachussets Institute of Technology, Cambridge, MA, 1991.
239. Noel M. Nachtigal, Satish C. Reddy, and Lloyd N. Trefethen. How fast are nonsymmetric matrix iterations? SIAM Journal on Matrix Analysis and Applications 1992; 13:778-795.
240. Noel M. Nachtigal, Lothar Reichel, and Lloyd N. Trefethen. A hybrid GMRES algorithm for nonsymmetric matrix iterations. SIAM Journal on Matrix Analysis and Applications 1992; 13:796-825.
241. Aaron E. Naiman, Ivo M. Babuška, and Howard C. Elman. A note on Conjugate Gradient convergence. Numerische Mathematik 1997; 76:209-230.
242. Aaron E. Naiman and Shlomo Engelberg. A note on Conjugate Gradient convergence, Part II. Numerische Mathematik 2000; 85:665-683.
243. Ramesh Natarajan. An iterative scheme for dense, complex-symmetric, linear systems in acoustics boundary-element computations. SIAM Journal on Scientific Computing 1998; 19:1450-1470.
244. Olavi Nevanlinna. Convergence of Iterations for Linear Equations. Birkhäuser: Basel, 1993.
245. Roy A. Nicolaides. Deflation of Conjugate Gradients with applications to boundary value problems. SIAM Journal on Numerical Analysis 1987; 24:355-365.
246. Yvan Notay. Flexible Conjugate Gradient. SIAM Journal on Scientific Computing 2000; 22:1444-1460.
247. Bahram Nour-Omid, Beresford N. Parlett, Thomas Ericsson, and Paul S. Jensen. How to implement the spectral transformation. Mathematics of Computation 1987; 48:663-673.
248. Alexander Padiy, Owe Axelsson, and Ben Polman. Generalized augmented matrix preconditioning approach and its application to iterative solution of ill-conditioned algebraic systems. SIAM Journal on Matrix Analysis and Applications 2000; 22:793-818.
249. Christopher C. Paige, Beresford N. Parlett, and Henk A. van der Vorst. Approximate solutions and eigenvalue bounds from Krylov subspaces. Numerical Linear Algebra with Applications 1995; 2:115-134.
250. Christopher C. Paige, Miroslav Rozložník, and Zdeněk Strakoš. Modified Gram-Schmidt (MGS), least squares, and backward stability of MGS-GMRES. SIAM Journal on Matrix Analysis and Applications 2006; 28:264-284.
251. Christopher C. Paige and Michael A. Saunders. Solution of sparse indefinite systems of linear equations. SIAM Journal on Numerical Analysis 1975; 12:617-629.
252. Christopher C. Paige and Michael A. Saunders. LSQR: An algorithm for sparse linear equations and least squares problems. ACM Transactions on Mathematical Software 1982; 8:43-71.
253. Christopher C. Paige and Zdeněk Strakoš. Bounds for the least squares distance using scaled total least squares problems. Numerische Mathematik 2002; 91:93-115.
254. Christopher C. Paige and Zdeněk Strakoš. Residual and backward error bounds in minimum residual Krylov subspace methods. SIAM Journal on Scientific Computing 2002; 23:1899-1924.
255. Beresford N. Parlett. Reduction to tridiagonal form and minimal realizations. SIAM Journal on Matrix Analysis and Applications 1992; 13:567-593.
256. Beresford N. Parlett and Hsin-Cbu Chen. Use of indefinite pencils for computing damped natural modes. Linear Algebra and its Applications 1990; 140:53-88.
257. Beresford N. Parlett, Derek R. Taylor, and Zhishun A. Liu. A look-ahead Lanczos algorithm for unsymmetric linear systems. Mathematics of Computation 1985; 44:105-124.
258. Micol Pennacchio and Valeria Simoncini. Efficient algebraic solution of reaction-diffusion systems for the cardiac excitation process. Journal of Computational and Applied Mathematics 2002; 145:49-70.
259. Federico Perotti and Valeria Simoncini. Analytical and numerical techniques in frequency domain response computation. In Recent Research Developments in Structural Dynamics, Luongo A (ed.). Research Signpost: Trivandrum, India, 2003; 33-54.
260. Claude Pommerell and Wolfgang Fichtner. Memory aspects and performance of iterative solvers. SIAM Journal on Scientific Computing 1994; 15:460-473.
261. Ernesto E. Prudencio, Richard Byrd, and Xiao-Chuan Cai. Parallel full space SPQ Lagrange-Newton-Krylov-Schwarz algorithms for PDE-constrained optimization problems. SIAM Journal on Scientific Computing 2006; 27:1305-1328.
262. Alfio Quarteroni and Alberto Valli. Domain Decomposition Methods for Partial Differential Equations. Oxford Science Publications, Clarendon Press: Oxford, 1999.
263. Lothar Reichel and Qiang Ye. Breakdown-free GMRES for singular systems. SIAM Journal on Matrix Analysis and Applications 2005; 26:1001-1021.
264. Klaus J. Ressel and Martin H. Gutknecht. QMR-smoothing for Lanczos-type product methods based on three-term recurrences. SIAM Journal on Scientific Computing 1998; 19:55-73.
265. Mickael Robbé and Miloud Sadkane. A convergence analysis of GMRES and FOM methods for Sylvester equations. Numerical Algorithms 2002; 30:71-89.
266. Stefan Röllin and Martin H. Gutknecht. Variations of Zhang's Lanczos-type product method. Applied Numerical Mathematics 2002; 41:119-133.
267. Miroslav Rozložník and Rüdiger Weiss. On the stable implementation of the generalized minimal error method. Journal of Computational and Applied Mathematics 1998; 98:49-62.
268. Miroslav Rozložník and Valeria Simoncini. Krylov subspace methods for saddle point problems with indefinite preconditioning. SIAM Journal on Matrix Analysis and Applications 2002; 24:368-391.
269. Jurgen J. Rusch. Using a complex version of GMRES for solving optical scattering problems. In Iterative Methods in Linear Algebra, Beauwens R, de Groen PN (eds). Elsevier Science (North-Holland): Amsterdam, 1992; 459-468.
270. Yousef Saad. Krylov subspace methods for solving large unsymmetric linear systems. Mathematics of Computation 1981; 37:105-126.
271. Yousef Saad. Practical use of some Krylov subspace methods for solving indefinite and unsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing 1984; 5:203-228.
272. Yousef Saad. Practical use of polynomial preconditioning for the Conjugate Gradient method. SIAM Journal on Scientific and Statistical Computing 1985; 6:865-881.
273. Yousef Saad. A flexible inner-outer preconditioned GMRES. SIAM Journal on Scientific Computing 1993; 14:461-469.
274. Yousef Saad. Iterative Methods for Sparse Linear Systems (2nd edn). The PWS Publishing Company: Boston, 1996. SIAM: Philadelphia, PA, 2003.
275. Yousef Saad. Analysis of augmented Krylov subspace methods. SIAM Journal on Matrix Analysis and Applications 1997; 18:435-449.
276. Yousef Saad and Martin H. Schultz. GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing 1986; 7:856-869.
277. Yousef Saad and Henk A. van der Vorst. Iterative solution of linear systems in the 20th century. Journal of Computational and Applied Mathematics 2000; 123:1-33.
278. Yousef Saad and Kesheng Wu. DQGMRES: A direct quasi-minimal residual algorithm based on incomplete orthogonalization. Numerical Linear Algebra with Applications 1996; 3:329-343.
279. Yousef Saad, Man-Chung Yeung, Jocelyne Erhel, and Frédéric Guyomarc'h. A deflated version of the Conjugate Gradient algorithm. SIAM Journal on Scientific Computing 2000; 21:1909-1926.
280. Tapan K. Sarkar. On the application of the generalized biconjugate gradient method. Journal of Electromagnetic Waves and Applications 1987; 1:223-242.
281. Tapan K. Sarkar, Xiaopu Yang, and Ercument Arvas. A limited survey of various Conjugate Gradient methods for solving complex matrix equations arising in electromagnetic wave interactions. Wave Motion 1988; 10:527-546.
282. Marcus Sarkis and Daniel B. Szyld. Optimal left and right additive Schwarz preconditioning for minimal residual methods with Euclidean and energy norms. Computer Methods in Applied Mechanics and Engineering, 2006, in press.
283. Marcus Sarkis and Daniel B. Szyld. A proposal for a dynamically adaptive inexact additive additive Schwarz preconditioner. In Proceedings of the Sixteenth Conference on Domain Decomposition Methods, 2005, Widlund O, Keyes D (eds), vol. 55. Lecture Notes in Computational Science and Engineering. Springer: Berlin, 2006, in press.
284. Michael A. Saunders, Horst D. Simon, and Elizabeth L. Yip. Two Conjugate-Gradient-type methods for unsymmetric linear equations. SIAM Journal on Numerical Analysis 1988; 25:927-940.
285. Paul E. Saylor and Dennis C. Smolarski. Computing the roots of complex orthogonal and kernel polynomials. SIAM Journal on Scientific Computing 1988; 9:1-13.
286. Paul E. Saylor and Dennis C. Smolarski. Implementation of an adaptive algorithm for Richardson's method. Linear Algebra and its Applications 1991; 154-156:615-646.
287. Valeria Simoncini. On the numerical solution of AX - XB = C. BIT Numerical Mathematics 1996; 36:182-198.
288. Valeria Simoncini. Linear systems with a quadratic parameter and application to structural dynamics. In Iterative Methods in Scientific Computation IV, Kincaid DR, Elster AC (eds). IMACS Series in Computational and Applied Mathematics, vol. 5. IMACS: New Brunswick, NJ, 1999; 451-461.
289. Valeria Simoncini. A new variant of restarted GMRES. Numerical Linear Algebra with Applications 1999; 6:61-77.
290. Valeria Simoncini. On the convergence of restarted Krylov subspace methods. SIAM Journal on Matrix Analysis and Applications 2000; 22:430-452.
291. Valeria Simoncini. Restarted full orthogonalization method for shifted linear systems. BIT Numerical Mathematics 2003; 43:459-466.
292. Valeria Simoncini. Block triangular preconditioners for symmetric saddle-point problems. Applied Numerical Mathematics 2004; 49:63-80.
293. Valeria Simoncini. Variable accuracy of matrix-vector products in projection methods for eigencomputation. SIAM Journal on Numerical Analysis 2005; 43:1155-1174.
294. Valeria Simoncini and Lars Eldén. Inexact Rayleigh quotient-type methods for eigenvalue computations. BIT Numerical Mathematics 2002; 42:159-182.
295. Valeria Simoncini and Efstratios Gallopoulos. Iterative methods for complex symmetric systems with multiple right-hand sides. Technical Report 1322, Center for Supercomputing Research and Development, December 1993. Available at http://www.dm.unibo.it/~simoncin.
296. Valeria Simoncini and Efstratios Gallopoulos. Convergence properties of block GMRES and matrix polynomials. Linear Algebra and its Applications 1996; 247:97-120.
297. Valeria Simoncini and Micol Pennacchio. The behaviour of symmetric Krylov subspace methods for solving Mx= (M - γyI)v. Linear Algebra and its Applications 2004; 380:53-71.
298. 2 A + λB + C)x = b and application to structural dynamics. SIAM Journal on Scientific Computing 2002; 23:1876-1898.
299. Valeria Simoncini and Daniel B. Szyld. Flexible inner-outer Krylov subspace methods. SIAM Journal on Numerical Analysis 2003; 40:2219-2239.
300. Valeria Simoncini and Daniel B. Szyld. Theory of inexact Krylov subspace methods and applications to scientific computing. SIAM Journal on Scientific Computing 2003; 25:454-477.
301. Valeria Simoncini and Daniel B. Szyld. The effect of non-optimal bases on the convergence of Krylov subspace methods. Numerische Mathematik 2005; 100:711-733.
302. Valeria Simoncini and Daniel B. Szyld. On the occurrence of superlinear convergence of exact and inexact Krylov subspace methods. SIAM Review 2005; 47:247-272.
303. Valeria Simoncini and Daniel B. Szyld. Relaxed Krylov subspace approximation. PAMM: Proceedings of Applied Mathematics and Mechanics 2005; 5:797-800.
304. Gerard L. G. Sleijpen and Diederik R. Fokkema. BiCGStab(ℓ) for linear equations involving unsymmetric matrices with complex spectrum. Electronic Transactions on Numerical Analysis 1993; 1:11-32.
305. Gerard L. G. Sleijpen and Jasper van den Eshof. Accurate Conjugate Gradient methods for families of shifted systems. Applied Numerical Mathematics 2004; 49:17-37.
306. Gerard L. G. Sleijpen and Jasper van den Eshof. Inexact Krylov subspace methods for linear systems. SIAM Journal on Matrix Analysis and Applications 2004; 26:125-153.
307. Gerard L. G. Sleijpen, Jasper van den Eshof, and Martin B. van Gijzen. Iterative linear solvers with approximate matrix-vector products. In QCD and Numerical Analysis III, Proceedings of the Third International Workshop on Numerical Analysis and Lattice QCD, Edinburgh, June-July 2003, Boriçi A, Frommer A, Joó B, Kennedy A, Pendleton B (eds). Lecture Notes in Computational Science and Engineering, vol. 47. Springer: Berlin, Heidelberg, 2005; 133-141.
308. Gerard L. G. Sleijpen, Jasper van den Eshof, and Martin B. van Gijzen. Relaxation strategies for nested Krylov methods. Journal of Computational and Applied Mathematics 2005; 177:347-365.
309. Gerard L. G. Sleijpen, Jasper van den Eshof, and Martin B. van Gijzen. Restarted GMRES with inexact matrix-vector products. In Numerical Analysis and Its Applications: Third International Conference, NAA 2004, Rousse, Bulgaria, 29 June-3 July 2004, Li Z, Vulkov L, Wazniewski J (eds). Lecture Notes in Computer Science, vol. 3401. Springer: Heidelberg, 2005; 494-502.
310. Gerard L. G. Sleijpen and Henk A. van der Vorst. Maintaining convergence properties of BiCGstab methods in finite precision arithmetic. Numerical Algorithms 1995; 10:203-223.
311. Gerard L. G. Sleijpen, Henk A. van der Vorst, and Diederik R. Fokkema. BiCGStab(ℓ) and other hybrid Bi-CG methods. Numerical Algorithms 1994; 7:75-109.
312. Gerard L. G. Sleijpen, Henk A. van der Vorst, and Jan Modersitzki. Differences in the effects of founding errors in Krylov solvers for symmetric indefinite linear systems. SIAM Journal on Matrix Analysis and Applications 2000; 22:726-751.
313. Barry F. Smith, Petter E. Bjørstad, and William D. Gropp. Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations. Cambridge University Press: Cambridge, New York, Melbourne, 1996.
314. Peter Sonneveld. CGS: a fast Lanczos-type solver for nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing 1989; 10:36-52.
315. Danny C. Sorensen. Implicit application of polynomial filters in a k-step Arnoldi method. SIAM Journal on Matrix Analysis and Applications 1992; 13:357-385.
316. Gerhard Starke. Field-of-values analysis of preconditioned iterative methods for nonsymmetric elliptic problems. Numerische Mathematik 1997; 78:103-117.
317. Gerhard Starke and Richard S. Varga. A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations. Numerische Mathematik 1993; 64:213-240.
318. G. W. (Pete) Stewart. Backward error bounds for approximate Krylov subspaces. Linear Algebra and its Applications 2002; 340:81-86.
319. Josef Stoer. Solution of large linear systems of equations by Conjugate Gradient type methods. In Mathematical Programming The State of the Art. Proceedings of the 11th International Symposium on Mathematical Programming, University of Bonn, Bonn, 23-27 August 1982, Bachem A, Gröstchel M, Korte B (eds). Springer: Berlin, New York, 1983; 540-565.
320. Josef Stoer and Roland W. Freund. On the solution of large linear systems of equations by Conjugate Gradient algorithms. In Computer Methods in Applied Science and Engineering-V, Glowinski R, Lions J-L (eds). North-Holland: Amsterdam, 1982; 35-53.
321. Zdeněk Strakoš and Petr Tichý. On error estimation in the Conjugate Gradient method and why it works in finite precision computations. Electronic Transactions on Numerical Analysis 2002; 13:56-80.
322. Zdeněk Strakošand Petr Tichý. Error estimation in preconditioned Conjugate Gradients. BIT Numerical Mathematics 2005; 45:789-817.
323. Daniel B. Szyld and Judith A. Vogel. A flexible quasi-minimal residual method with inexact preconditioning. SIAM Journal on Scientific Computing 2001; 23:363-380.
324. Daniel B. Szyld and Olof B. Widlund. Variational analysis of some Conjugate Gradient methods. East-West Journal of Numerical Mathematics 1993; 1:51-74.
325. Françoise Tisseur and Karl Meerbergen. The quadratic eigenvalue problem. SIAM Review 2001; 43:235-286.
326. Kim-Chuan Toh. GMRES vs. ideal GMRES. SIAM Journal on Matrix Analysis and Applications 1997; 18:30-36.
327. Andrea Toselli and Olof B. Widlund. Domain Decomposition Methods - Algorithms and Theory. Springer Series in Computational Mathematics, vol. 34. Springer: Berlin, Heidelberg, 2005.
328. Lloyd N. Trefethen. Approximation theory and numerical linear algebra. In Algorithms for Approximation II. Papers from the Second International Conference held at the Royal Military College of Science, Shrivenham, 12-15 July 1988, Mason JC, Cox MG (eds). Chapman & Hall: London, 1990; 336-360.
329. Lloyd N. Trefethen and Mark Embree. Spectra and Pseudospectra. Princeton University Press: Princeton, Oxford, 2005.
330. Ulrich Trottenberg, Cornelis W. Oosterlee, and Anton A. Schüller. Multigrid. Academic Press: San Diego, London, 2001.
331. Kathryn Turner and Homer F. Walker. Efficient high accuracy solutions with GMRES(m). SIAM Journal on Scientific and Statistical Computing 1992; 13:815-825.
332. Abraham van der Sluis and Henk A. van der Vorst. The rate of convergence of Conjugate Gradients. Numerische Mathematik 1986; 48:543-560.
333. Henk A. van der Vorst. Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM Journal on Scientific Computing 1992; 13:631-644.
334. Henk A. van der Vorst. Iterative Krylov Methods for Large Linear Systems. Cambridge University Press: Cambridge, New York, Melbourne, 2003.
335. Henk A. van der Vorst and Jan B. M. Melissen. A Petrov-Galerkin type method for solving Ax = b, where A is symmetric complex. IEEE Transaction on Magnetics 1990; 26:706-708.
336. Henk A. van der Vorst and C. (Kees) Vuik. GMRESR: a family of nested GMRES methods. Numerical Linear Algebra with Applications 1994; 1:369-386.
337. Sabine Van Huffel and Joos Vandewalle. The Total Least Squares Problem, Computational Aspects and Analysis. Frontiers in Applied Mathematics, vol. 9. SIAM: Philadelphia, PA, 1991.
338. Judith A. Vogel. Flexible BiCG and flexible Bi-CGSTAB for nonsymmetric linear systems. Applied Mathematics and Computations, in press.
339. C. (Kees) Vuik. Further experiences with GMRESR. Supercomputer 1993; 55:13-27.
340. C. (Kees) Vuik. New insights in GMRES-like methods with variable preconditioners. Journal of Computational and Applied Mathematics 1995; 61:189-204.
341. C. (Kees) Vuik and Henk A. van der Vorst. A comparison of some GMRES-like methods. Linear Algebra and its Applications 1990; 160:131-162.
342. Homer F. Walker. Residual smoothing and peak/plateau behaviour in Krylov subspace methods. Applied Numerical Mathematics 1995; 19:279-286.
343. Homer F. Walker and Lu Zhou. A simpler GMRES. Numerical Linear Algebra with Applications 1994; 1:571-581.
344. James S. Warsa, Michele Benzi, Todd A. Wareing, and Jim E. Morel. Preconditioning a mixed discontinuous finite element method for radiation diffusion. Numerical Linear Algebra with Applications 2004; 11:377-389.
345. James S. Warsa, Todd A. Wareing, Jim E. Morel, John M. McGhee, and Richard B. Lehoucq. Krylov subspace iterations for deterministic k-eigenvalue calculations. Nuclear Science and Engineering 2004; 147:26-42.
346. Rüdiger Weiss. Error-minimizing Krylov subspace methods. SIAM Journal on Scientific Computing 1994; 15:511-527.
347. Rüdiger Weiss. Parameter-Free Iterative Linear Solvers. Mathematical Research Series, vol. 97. Akademie-Verlag: Berlin, 1996.
348. Olof B. Widlund. A Lanczos method for a class of nonsymmetric systems of linear equations. SIAM Journal on Numerical Analysis 1978; 15:801-812.
349. Jinchao Xu and Xiao-Chuan Cai. A preconditioned GMRES method for nonsymmetric or indefinite problems. Mathematics of Computations 1992; 59:311-319.
350. Ilyia Zavorin, Howard C. Elman, and Dianne P. O'Leary. Complete stagnation of GMRES. Linear Algebra and its Applications 2003; 367:165-183.
351. Shao-Liang Zhang. GPBi-CG: generalized product-type methods based on Bi-CG for solving nonsymmetric linear systems. SIAM Journal on Scientific Computing 1997; 18:537-551.
352. Baojiang Zhong and Ronald B. Morgan. Complementary cycles of restarted GMRES. Technical Report, Department of Mathematics, Baylor University, Waco, Texas, 2004.
353. Lou Zhou and Homer F. Walker. Residual smoothing techniques for iterative methods. SIAM Journal on Scientific Computing 1994; 15:297-312.