Iterative solution of linear systems in the 20th century

Journal of Computational and Applied Mathematics

Volumn 123, Issue 1-2, 2000, Pages 1-33

  Saad, Yousef ^a   Van Der Vorst, Henk A ^b  

^a University of Minnesota   (United States)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

ADI; Krylov subspace methods; Multigrid; Polynomial acceleration; Preconditioning; Relaxation methods; SOR; Sparse approximate inverse

Indexed keywords

ALGORITHMS; INVERSE PROBLEMS; LINEAR ALGEBRA; LINEAR SYSTEMS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; RELAXATION PROCESSES;

KRYLOV SUBSPACE METHODS; MULTIGRID; POLYNOMIAL ACCELERATION; RELAXATION METHODS; SPARSE APPROXIMATE INVERSE;

ITERATIVE METHODS;

EID: 0039179703     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(00)00412-X     Document Type: Article

References (208)

1. Anderson E.C., Saad Y. Solving sparse triangular systems on parallel computers. Internat. J. High Speed Comput. 1:1989;73-96.
2. Arnoldi W.E. The principle of minimized iteration in the solution of the matrix eigenvalue problem. Quart. Appl. Math. 9:1951;17-29.
3. Axelsson O. A generalized SSOR method. BIT. 12:1972;443-467.
4. O. Axelsson, Solution of linear systems of equations: iterative methods, in: V.A. Barker (Ed.), Sparse Matrix Techniques, Springer, Berlin, 1977, Copenhagen, 1976, pp. 1-51.
5. Axelsson O. Conjugate gradient type-methods for unsymmetric and inconsistent systems of linear equations. Linear Algebra Appl. 29:1980;1-16.
6. Axelsson O. A general incomplete block-factorization method. Linear Algebra Appl. 74:1986;179-190.
7. Axelsson O. Iterative Solution Methods. 1994;Cambridge University Press, New York.
8. Axelsson O., Lindskog G. On the eigenvalue distribution of a class of preconditioning methods. Numer. Math. 48:1986;479-498.
9. Axelsson O., Vassilevski P. Algebraic multilevel preconditioning methods, I. Numer. Math. 56:1989;157-177.
10. Axelsson O., Vassilevski P. Algebraic multilevel preconditioning methods, II. SIAM J. Numer. Anal. 27(6):1990;1569-1590.
11. Axelsson O., Vassilevski P.S. A black box generalized conjugate gradient solver with inner iterations and variable-step preconditioning. SIAM J. Matrix Anal. Appl. 12(4):1991;625-644.
12. Bank R.E., Chan T.F. An analysis of the composite step biconjugate gradient method. Numer. Math. 66:1993;295-319.
13. Barrett R., Berry M., Chan T.F., Demmel J., Donato J., Dongarra J., Eijkhout V., Pozo R., Romine C., van der Vorst H. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. 1994;SIAM, Philadelphia, PA.
14. T. Barth, T. Manteuffel, Variable metric conjugate gradient methods, in: Advances in Numerical Methods for Large Sparse Sets of Linear Equations, Number 10, Matrix Analysis and Parallel Computing, PCG 94, Keio University, Yokohama, Japan, 1994, pp. 165-188.
15. D. Baxter, J. Saltz, M.H. Schultz, S.C. Eisenstat, K. Crowley, An experimental study of methods for parallel preconditioned Krylov methods, in: Proceedings of the 1988 Hypercube Multiprocessors Conference, Pasadena, CA, January 1988, pp. 1698-1711.
16. Benson M.W., Frederickson P.O. Iterative solution of large sparse linear systems arising in certain multidimensional approximation problems. Utilitas Math. 22:1982;127-140.
17. M. Benzi, J. Marín, M. Tůma, A two-level parallel preconditioner based on sparse approximate inverses, in: D.R. Kincaid, A.C. Elster (Eds.), Iterative Methods in Scientific Computation, II, IMACS, New Brunswick, NJ, 1999, pp. 167-178.
18. Benzi M., Meyer C.D., Tůma M. A sparse approximate inverse preconditioner for the conjugate gradient method. SIAM J. Sci. Comput. 17:1996;1135-1149.
19. Benzi M., Szyld D.B., van Duin A. Orderings for incomplete factorization preconditioning of nonsymmetric problems. SIAM J. Sci. Comput. 20:1999;1652-1670.
20. Berryman H., Saltz J., Gropp W., Mirchandaney R. Krylov methods preconditioned with incompletely factored matrices on the CM-2. J. Partial Distrib. Comput. 8:1990;186-190.
21. Birkhoff G. Solving elliptic problems: 1930-1980. Schultz M.H. Elliptic Problem Solver. 1981;17-38 Academic Press, New York.
22. Björck A., Elfving T. Accelerated projection methods for computing pseudo-inverse solutions of systems of linear equations. BIT. 19:1979;145-163.
23. Bodewig E. Matrix Calculus. 1956;North-Holland, Amsterdam.
24. Bodewig E. Matrix Calculus (second revised and enlarged edition). 1959;North-Holland, Amsterdam.
25. Bramley R., Sameh A. Row projection methods for large nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 13:1992;168-193.
26. A. Brandt, Multi-level adaptive technique (MLAT) for fast numerical solutions to boundary problems, in: H. Cabannes, R. Temam (Eds.), Proceedings of the Third International Conference on Numerical Methods in Fluid Mechanics, Paris, 1972, Springer, Berlin, 1973, pp. 82-89.
27. Brandt A. Multi-level adaptive solutions to boundary value problems. Math. Comp. 31:1977;333-390.
28. Brezinski C. Padé-Type Approximation and General Orthogonal Polynomials. 1980;Birkhäuser, Basel.
29. Brezinski C. Projection Methods for Systems of Equations. 1997;North-Holland, Amsterdam.
30. Brezinski C., Redivo-Zaglia M. Look-ahead in bicgstab and other product methods for linear systems. BIT. 35:1995;169-201.
31. Brezinski C., Redivo-Zaglia M., Sadok H. Avoiding breakdown and near-breakdown in Lanczos type algorithms. Numer. Algorithms. 1:1991;261-284.
32. Brezinski C., Redivo-Zaglia M., Sadok H. A breakdown-free Lanczos' type algorithm for solving linear systems. Numer. Math. 63:1992;29-38.
33. Briggs W.L. A Multigrid Tutorial. 1987;SIAM, Philadelphia, PA.
34. Brown P.N. A theoretical comparison of the Arnoldi and GMRES algorithms. SIAM J. Sci. Statist. Comput. 12:1991;58-78.
35. Broyden G.C. A new method of solving nonlinear simultaneous equations. Comput. J. 12:1969;94-99.
36. N.I. Buleev, A numerical method for the solution of two-dimensional and three-dimensional equations of diffusion, Math. Sb. 51 (1960) 227-238 (in Russian).
37. Cesari L. Sulla risoluzione dei sistemi di equazioni lineari per approssimazioni successive. Atti Accad. Naz. Lincei. Rend. Cl. Sci. Fis. Mat. Nat. Ser. 6a. 25:1937;422-428.
38. Chan T.F., Gallopoulos E., Simoncini V., Szeto T., Tong C.H. A quasi-minimal residual variant of the Bi-CGSTAB algorithm for nonsymmetric systems. SIAM J. Sci. Comput. 15:1994;338-347.
39. Chan T.F., Goovaerts D. A note on the efficiency of domain decomposed incomplete factorizations. SIAM J. Sci. Statist. Comput. 11:1990;794-803.
40. T.F. Chan, D. Resasco, A framework for the analysis of domain decomposition preconditioners, in: Proceedings of the First International Symposium on Domain Decomposition Methods for Partial Differential Equations, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1988, pp. 217-230.
41. Chazan D., Miranker M. Chaotic relaxation. Linear Algebra Appl. 2:1969;199-222.
42. Chow E., Saad Y. Approximate inverse techniques for block-partitioned matrices. SIAM J. Sci. Comput. 18:1997;1657-1675.
43. Chow E., Saad Y. Approximate inverse preconditioners via sparse-sparse iterations. SIAM J. Sci. Comput. 19:1998;995-1023.
44. Cimmino G. Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari. Ric. Sci. Progr. Tecn. Econom. Naz. 9:1938;326-333.
45. Concus P., Golub G.H. A generalized conjugate gradient method for nonsymmetric systems of linear equations. Glowinski R., Lions J.L. Computing Methods in Applied Sciences and Engineering. 1976;56-65 Springer, New York.
46. Concus P., Golub G.H., Meurant G. Block preconditioning for the conjugate gradient method. SIAM J. Sci. Statist. Comput. 6:1985;220-252.
47. Concus P., Golub G.H., O'Leary D.P. A generalized conjugate gradient method for the numerical solution of elliptic partial differential equations. Bunch J.R., Rose D.J. Sparse Matrix Computations. 1976;309-332 Academic Press, New York.
48. Cosgrove J.D.F., Díaz J.C., Griewank A. Approximate inverse preconditioning for sparse linear systems. Internat. J. Comput. Math. 44:1992;91-110.
49. Cullum J., Greenbaum A. Relations between Galerkin and norm-minimizing iterative methods for solving linear systems. SIAM J. Matrix Anal. Appl. 17:1996;223-247.
50. Daniel J.W. The conjugate gradient method for linear and nonlinear operator equations. SIAM J. Numer. Anal. 4:1967;10-26.
51. Daniel J.W. The Approximate Minimization of Functionals. 1971;Prentice-Hall, Englewood Cliffs, NJ.
52. D'Azevedo E.F., Forsyth F.A., Tang W.P. Ordering methods for preconditioned conjugate gradient methods applied to unstructured grid problems. SIAM J. Matrix Anal. Appl. 13:1992;944-961.
53. D'Azevedo E.F., Forsyth F.A., Tang W.P. Towards a cost effective ILU preconditioner with high level fill. BIT. 31:1992;442-463.
54. de Boor C., Rice J.R. Extremal polynomials with applications to Richardson iteration for indefinite systems. SIAM J. Sci. Statist. Comput. 3:1982;47-57.
55. Dedekind R. Gauss in seiner Vorlesung über die Methode der kleisten Quadrate. Gesammelte Math. Werke. 2:1901;293-306.
56. DeLong M.A., Ortega J.M. SOR as a preconditioner. Appl. Numer. Math. 18:1995;431-440.
57. Dongarra J.J., Duff I.S., Sorensen D.C., van der Vorst H.A. Numerical Linear Algebra for High-Performance Computers. 1998;SIAM, Philadelphia, PA.
58. Dubois P.F., Greenbaum A., Rodrigue G.H. Approximating the inverse of a matrix for use on iterative algorithms on vectors processors. Computing. 22:1979;257-268.
59. Duff I.S., Meurant G.A. The effect of ordering on preconditioned conjugate gradients. BIT. 29:1989;635-657.
60. Dupont T., Kendall R., Rachford H. An approximate factorization procedure for solving self-adjoint elliptic difference equations. SIAM J. Numer. Anal. 5:1968;559-573.
61. Eirola T., Nevanlinna O. Accelerating with rank-one updates. Linear Algebra Appl. 121:1989;511-520.
62. Eisenstat S.C., Elman H.C., Schultz M.H. Variational iterative methods for nonsymmetric systems of linear equations. SIAM J. Numer. Anal. 20:1983;345-357.
63. Elman H.C. A stability analysis of incomplete LU factorizations. Math. Comp. 47:1986;191-217.
64. Elman H.C. Relaxed and stabilized incomplete factorizations for non-self-adjoint linear systems. BIT. 29:1989;890-915.
65. Elman H.C., Golub G.H. Line iterative methods for cyclically reduced discrete convection-diffusion problems. SIAM J. Sci. Statist. Comput. 13:1992;339-363.
66. Elman H.C., Saad Y., Saylor P. A hybrid Chebyshev Krylov subspace algorithm for solving nonsymmetric systems of linear equations. SIAM J. Sci. Statist. Comput. 7:1986;840-855.
67. M. Embree, Convergence of Krylov subspace methods for non-normal matrices, Ph.D. Thesis, Oxford University Computing Laboratory, Oxford, UK, 1999.
68. M. Engeli, Overrelaxation and related methods, Refined Iterative Methods for Computation of the Solution and the Eigenvalues of Self-Adjoint Boundary Value Problems, Institute of Applied Mathematics, Zürich, Birkhäuser, Basel, 1959, pp. 79-107.
69. M. Engeli, T. Ginsburg, H. Rutishauser, E. Stiefel, Refined Iterative Methods for Computation of the Solution and the Eigenvalues of Self-Adjoint Boundary Value Problems, Birkhäuser, Basel, 1959.
70. Evans D.J. The use of pre-conditioning in iterative methods for solving linear equations with symmetric positive definite matrices. J. Inst. Math. Appl. 4:1968;295-314.
71. Faber V., Manteuffel T. Necessary and sufficient conditions for the existence of a conjugate gradient method. SIAM J. Numer. Anal. 21:1984;352-361.
72. D.K. Faddeev, V.N. Faddeeva, Computational Methods of Linear Algebra, Freeman and Company, San Francisco, 1963.
73. Fedorenko R.P. On the speed of convergence of an iteration process. USSR Comput. Math. Math. Phys. 4:1964;227-235.
74. Fischer B., Reichel L. A stable Richardson iteration method for complex linear systems. Numer. Math. 54:1988;225-241.
75. Flanders D.A., Shortley G. Numerical determination of fundamental modes. J. Appl. Phys. 21:1950;1322-1328.
76. Fletcher R. Conjugate gradient methods for indefinite systems. Watson G.A. Proceedings of the Dundee Biennal Conference on Numerical Analysis. 1974 :1975;73-89 Springer, New York.
77. Fokkema D.R., Sleijpen G.L.G., van der Vorst H.A. Generalized conjugate gradient squared. J. Comput. Appl. Math. 71:1994;125-146.
78. Frankel S. Convergence rates of iterative treatments of partial differential equations. MTAC. 1950;65-75.
79. Freund R.W. A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems. SIAM J. Sci. Comput. 14(2):1993;470-482.
80. R.W. Freund, N.M. Nachtigal, An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, Part 2, Technical Report 90.46, RIACS, NASA Ames Research Center, 1990.
81. Freund R.W., Nachtigal N.M. QMR: a quasi-minimal residual method for non-Hermitian linear systems. Numer. Math. 60:1991;315-339.
82. Gallivan K., Sameh A., Zlatev Z. A parallel hybrid sparse linear system solver. Comput. Systems Eng. 1(2-4):1990;183-195.
83. Gastinel N. Analyse Numérique Linéaire. 1966;Hermann, Paris.
84. Gauss C.F. Werke, Band IX. 1903;Teubner, Leipzig.
85. M.K. Gavurin, Application of the best approximation polynomial to improving the convergence of iterative methods, Uspehi Mat. Nauk. 5(3) (1950) 156-160 (in Russian).
86. Golub G.H., O'Leary D.P. Some history of the conjugate gradient and Lanczos algorithms: 1948 - 1976 SIAM Rev. 31:1989;50-102.
87. Golub G.H., Varga R.S. Chebyshev semi iterative methods successive overrelaxation iterative methods and second order Richardson iterative methods. Numer. Math. 3:1961;147-168.
88. Greenbaum A. Iterative Methods for Solving Linear Systems. 1997;SIAM, Philadelphia, PA.
89. Greenbaum A., Strakos Z. Predicting the behavior of finite precision Lanczos and conjugate gradient computations. SIAM J. Matrix Anal. Appl. 13:1992;121-137.
90. Greenbaum A., Strakos Z. Matrices that generate the same Krylov residual spaces. Golub G., Luskin M., Greenbaum A. Recent Advances in Iterative Methods. IMA Volumes in Mathematics and Its Applications. Vol. 60:1994;95-119 Springer, New York.
91. Greenbaum A., Ptak V., Strakoš Z. Any nonincreasing convergence curve is possible for GMRES. SIAM J. Matrix Anal. Appl. 17:1996;465-469.
92. Grote M., Huckle T. Parallel preconditioning with sparse approximate inverses. SIAM J. Sci. Comput. 18:1997;838-853.
93. Grote M., Simon H.D. Parallel preconditioning and approximate inverses on the connection machine. Sincovec R.F., Keyes D.E., Petzold L.R., Reed D.A. Parallel Processing for Scientific Computing, Vol. 2. 1992;519-523 SIAM, Philadelphia, PA.
94. Gustafsson I. A class of first order factorization methods. BIT. 18:1978;142-156.
95. Gutknecht M.H. A completed theory of the unsymmetric Lanczos process and related algorithms, Part I. SIAM J. Matrix Anal. Appl. 13:1992;594-639.
96. Hackbusch W. Multi-Grid Methods and Applications. 1985;Springer, New York.
97. Hackbusch W. Iterative Solution of Large Linear Systems of Equations. 1994;Springer, New York.
98. Hageman A.L., Young D.M. Applied Iterative Methods. 1981;Academic Press, New York.
99. Hayes R.M. Iterative methods of solving linear systems on Hilbert space. National Bureau of Standards, Appl. Math. Ser. 39:1954;71-103.
100. M.R. Hestenes, The conjugate-gradient method for solving linear systems, in: Sympos. Appl. Math., Numerical Analysis, Vol. VI, McGraw-Hill, New York, 1956, pp. 83-102.
101. Hestenes M.R., Stiefel E.L. Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Standards Section B. 49:1952;409-436.
102. Householder A.S. Theory of Matrices in Numerical Analysis. 1964;Blaisdell Publishing Company, Johnson, CO.
103. Jea K.C., Young D.M. Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods. Linear Algebra Appl. 34:1980;159-194.
104. Johnson O.G., Micchelli C.A., Paul G. Polynomial preconditionings for conjugate gradient calculations. SIAM J. Numer. Anal. 20:1983;362-376.
105. W.D. Joubert, Generalized conjugate gradient and Lanczos methods for the solution of nonsymmetric systems of linear equations, Ph.D. Thesis, University of Texas, Austin, Center for Numerical Analysis, Austin, TX, 1990.
106. Kaczmarz S. Angenäherte Auflösung von Systemen linearer Gleichungen. Bull. Internat. Acad. Pol. Sci. Lett. A. 35:1937;355-357.
107. W. Kahan, Gauss-Seidel methods of solving large systems of linear equations, Ph.D. Thesis, University of Toronto, 1958.
108. Kamath C., Sameh A. A projection method for solving nonsymmetric linear systems on multiprocessors. Parallel Comput. 9:1988; / 89 291-312.
109. Kaniel S. Estimates for some computational techniques in linear algebra. Math. Comp. 20:1966;369-378.
110. L. Kantorovitch, On an efficient method for solving optimization problems for quadratic functionals, DAN SSSR 48(7) (1945) 7-8 (in Russian).
111. Karush W. Convergence of a method of solving linear problems. Proc. Amer. Math. Soc. 3:1952;839-851.
112. Khabaza I.M. An iterative least-square method suitable for solving large sparse matrices. Comput. J. 6:1963;202-206.
113. Kolotilina L.Yu., Yeremin A.Yu. On a family of two-level preconditionings of the incomplete block factorization type. Soviet J. Numer. Anal. Math. Modelling. 1:1986;293-320.
114. Kolotilina L.Yu., Yeremin A.Yu. Factorized sparse approximate inverse preconditionings I, Theory. SIAM J. Matrix Anal. Appl. 14:1993;45-58.
115. Lanczos C. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Nat. Bur. Standards. 45:1950;255-282.
116. Lanczos C. Chebyshev polynomials in the solution of large-scale linear systems. Toronto Symposium on Computing Techniques. 1952;124-133.
117. Lanczos C. Solution of systems of linear equations by minimized iterations. J. Res. Nat. Bur. Standards. 49:1952;33-53.
118. Liebmann H. Die angenäherte harmonischer Funktionen und konformer Abbildungen (nach Ideen von Boltzmann und Jacobi). S. B. Math. Nat. Kl. Bayerischen Akad. Wiss. München. 1918;385-416.
119. Luenberger D.G. Hyperbolic pairs in the method of conjugate gradients. SIAM J. Appl. Math. 17:1979;1263-1267.
120. Magolu M.M. Modified block-approximate factorization strategies. Numer. Math. 61:1992;91-110.
121. Magolu M.M. Ordering strategies for modified block incomplete factorizations. SIAM J. Sci. Comput. 16:1995;378-399.
122. Manteuffel T.A. The Tchebychev iteration for nonsymmetric linear systems. Numer. Math. 28:1977;307-327.
123. Manteuffel T.A. Adaptive procedure for estimation of parameter for the nonsymmetric Tchebychev iteration. Numer. Math. 28:1978;187-208.
124. Mc Cormick (Ed.) S.F. Multigrid Methods. 1987;SIAM, Philadelphia, PA.
125. Meijerink J.A., van der Vorst H.A. An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix. Math. Comp. 31(137):1977;148-162.
126. Meijerink J.A., van der Vorst H.A. Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems. J. Comput. Phys. 44:1981;134-155.
127. Meurant G. Computer Solution of Large Linear Systems. 1999;North-Holland, Amsterdam.
128. Miellou J.C. Algorithmes de relaxation chaotiques á retard. RAIRO. R-1:1975;55-82.
129. Nachtigal N.M., Reddy S.C., Trefethen L.N. How fast are nonsymmetric matrix iterations? SIAM J. Matrix Anal. Appl. 13:1992;778-795.
130. P.A. Nekrasov, Determining unknowns using the least squares method when the number of unknowns is large, Mat. Sb. 12 (1884) 189-204 (in Russian).
131. Notay Y. DRIC: a dynamic version of the RIC method. Numer. Linear Algebra Appl. 1:1994;511-532.
132. Oliphant T.A. An extrapolation process for solving linear systems. Quart. Appl. Math. 20:1962;257-267.
133. Oosterlee C.W., Washio T. An evaluation of parallel multigrid as a solver and a preconditioner for singularly perturbed problems. SIAM J. Sci. Statist. Comput. 19:1991;87-110.
134. Osterby O., Zlatev Z. Direct Methods for Sparse Matrices. 1983;Springer, New York.
135. Ostrowski A.M. Uber die Determinanten mit überwiegender Hauptdiagonale. Comment. Math. Helv. 10:1937;69-96.
136. Ostrowski A.M. On the linear iteration procedures for symmetirc matrices. Rend. Mat. Appl. 14:1954;140-163.
137. Paige C.C., Saunders M.A. Solution of sparse indefinite systems of linear equations. SIAM J. Numer. Anal. 12:1975;617-629.
138. Paige C.C., Saunders M.A. LSQR: an algorithm for sparse linear equations and sparse least squares. ACM Trans. Math. Software. 8:1982;43-71.
139. Parlett B.N. Reduction to tridiagonal form and minimal realizations. SIAM J. Matrix Anal. Appl. 13:1992;567-593.
140. Parlett B.N., Taylor D.R., Liu Z.S. A look-ahead Lanczos algorithm for nonsymmetric matrices. Math. Comp. 44:1985;105-124.
141. Peaceman D., Rachford H. The numerical solution of elliptic and parabolic differential equations. J. SIAM. 3:1955;28-41.
142. C. Pommerell, Solution of large unsymmetric systems of linear equations, Ph.D. Thesis, Swiss Federal Institute of Technology, Zürich, 1992.
143. Radicati di Brozolo G., Robert Y. Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric systems on a vector multiprocessor. Parallel Comput. 11:1989;223-239.
144. Reich E. On the convergence of the classical iterative method of solving linear simultaneous equations. Ann. Math. Statist. 20:1949;448-451.
145. Reid J.K. On the method of conjugate gradients for the solution of large sparse systems of linear equations. Reid J.K. Large Sparse Sets of Linear Equations. 1971;231-254 Academic Press, New York.
146. Richardson L.F. The approximate arithmetical solution by finite differences of physical problems involving differential equations with an application to the stresses to a masonry dam. Philos. Trans. Roy. Soc. London Ser. A. 210:1910;307-357.
147. Robert F. Contraction en norme vectorielle: convergence d'itérations chaotiques. Linear Algebra Appl. 13:1976;19-35.
148. Robert F., Charnay M., Musy F. Iterations chaotiques série-parallèle pour les équations non linéaires de point fixe. Apl. Math. 20:1975;1-38.
149. A. Ruge, K. Stüben, Algebraic multigrid, in: S. McCormick (Ed.), Multigrid Methods, Frontiers in Applied Mathematics, Vol. 3, SIAM, Philadelphia, PA, 1987 (Chapter 4).
150. H. Rutishauser, Theory of gradient methods, Refined Iterative Methods for Computation of the Solution and the Eigenvalues of Self-Adjoint Boundary Value Problems, Institute of Applied Mathematics, Zurich, Birkhäuser, Basel, 1959, pp. 24-49.
151. Saad Y. Practical use of polynomial preconditionings for the conjugate gradient method. SIAM J. Sci. Statist. Comput. 6:1985;865-881.
152. Saad Y. Least squares polynomials in the complex plane and their use for solving sparse nonsymmetric linear systems. SIAM J. Numer. Anal. 24:1987;155-169.
153. Saad Y. Preconditioning techniques for indefinite and nonsymmetric linear systems. J. Comput. Appl. Math. 24:1988;89-105.
154. Saad Y. Krylov subspace methods on supercomputers. SIAM J. Sci. Statist. Comput. 10:1989;1200-1232.
155. Saad Y. A flexible inner-outer preconditioned GMRES algorithm. SIAM J. Sci. Statist. Comput. 14:1993;461-469.
156. Saad Y. Highly parallel preconditioners for general sparse matrices. Golub G., Luskin M., Greenbaum A. Recent Advances in Iterative Methods, IMA Volumes in Mathematics and Its Applications, Vol. 60. 1994;165-199 Springer, New York.
157. Saad Y. Iterative Methods for Sparse Linear Systems. 1996;PWS Publishing, New York.
158. Saad Y., Schultz M.H. GMRES: a generalized minimal residual algorithm for solving a nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 7:1986;856-869.
159. Saltz J., Mirchandaney R., Crowley K. Run-time paralellization and scheduling of loops. IEEE Trans. Comput. 40:1991;603-612.
160. Saylor P.E., Smolarski D.C. Computing the roots of complex orthogonal kernel polynomials. SIAM J. Sci. Statist. Comput. 9:1988;1-13.
161. Sheldon J.W. On the numerical solution of elliptic difference equations. MTAC. 9:1955;101-112.
162. Shortley G.H. Use of Tschebyscheff-polynomial operators in the solution of boundary value problems. J. Appl. Phys. 24:1953;392-396.
163. H.D. Simon, Incomplete LU preconditioners for conjugate gradient type iterative methods, in: Proceedings of the SPE 1985 Reservoir Simulation Symposium, Dallas, TX, Society of Petroleum Engineers of AIME, Paper No 13533, 1988, pp. 302-306.
164. Simon H.D. Direct sparse matrix methods. Almond J.C., Young D.M. Modern Numerical Algorithms for Supercomputers, Center for High Performance Computing. 1989;325-344 The University of Texas, Austin.
165. Sleijpen G.L.G., Fokkema D.R. BICGSTAB(. ℓ ) for linear equations involving unsymmetric matrices with complex spectrum ETNA. 1:1993;11-32.
166. Sonnoveld P. CGS: a fast Lanczos-type solver for nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 10:1989;36-52.
167. Southwell R.V. Stress calculation in frameworks by the method of systematic relaxation of constraints. Proc. Roy. Soc. London Ser. A. 151:1935;56-95.
168. W. Spakman, G. Nolet, Imaging algorithms, accuracy and resolution in delay time tomography, in: N.J. Vlaar, N. Nolet, M. Wortel, S. Cloetingh (Eds.), Mathematical Geophysics: A Survey of Recent Developments in Seismology and Geodynamics, Reidel, Dordrecht, 1987, pp. 155-188.
169. Stein P., Rosenberg R.L. On the solution of linear simultaneous equations by iteration. J. London Math. Soc. 23:1948;111-118.
170. Stiefel E.L. Kernel polynomials in linear algebra and their applications. U.S. Nat. Bur. Standards Appl. Math. Ser. 49:1958;1-24.
171. Stone H.L. Iterative solution of implicit approximations of multidimensional partial differential equations. SIAM J. Numer. Anal. 5:1968;530-558.
172. Strakoš Z. On the real convergence rate of the conjugate gradient method. Linear Algebra Appl. 154 / 156:1991;535-549.
173. K.H. Tan, Local coupling in domain decomposition, Ph.D. Thesis, Utrecht University, Utrecht, The Netherlands, 1995.
174. Tanabe K. Projection method for solving a singular system of linear equations and its applications. Numer. Math. 17:1971;203-214.
175. Tang W.P. Generalized Schwarz splitting. SIAM J. Sci. Statist. Comput. 13:1992;573-595.
176. R.R. Underwood, An approximate factorization procedure based on the block Cholesky factorization and its use with the conjugate gradient method, Technical Report Tech Report, General Electric, San Jose, CA, 1976.
177. A. van der Ploeg, Preconditioning for sparse matrices with applications, Ph.D. Thesis, Department of Mathematics, University of Groningen, 1995.
178. van der Ploeg A., Botta E.F.F., Wubs F.W. Nested grids ILU-decomposition (NGILU). J. Comput. Appl. Math. 66:1996;515-526.
179. van der Sluis A., van der Vorst H.A. The rate of convergence of conjugate gradients. Numer. Math. 48:1986;543-560.
180. Voevodin V.V. The problem of a non-selfadjoint generalization of the conjugate gradient method has been closed. USSR Comput. Math. Math. Phys. 23:1983;143-144.
181. van der Vorst H.A. Iterative solution methods for certain sparse linear systems with a non-symmetric matrix arising from PDE-problems. J. Comput. Phys. 44:1981;1-19.
182. van der Vorst H.A. A vectorizable variant of some ICCG methods. SIAM J. Statist. Sci. Comput. 3:1982;350-356.
183. van der Vorst H.A. Large tridiagonal and block tridiagonal linear systems on vector and parallel computers. Parallel Comput. 5:1987;45-54.
184. van der Vorst H.A. High performance preconditioning. SIAM J. Sci. Statist. Comput. 10:1989;1174-1185.
185. H.A. van der Vorst, ICCG and related method for 3-D problems on vector computers, in: D. Truhlar (Ed.), Workshop on Practical Iterative Methods for Large Scale Computations, Minneaopolis, MN, October 23-25, 1988, Comput. Phys. Comm. 53 (1989).
186. van der Vorst H.A. Bi-CDSTAB: a fast and smoothly converging variant of Bi-CG for the solution of non-symmetric linear systems. SIAM J. Sci. Statist. Comput. 13:1992;631-644.
187. van der Vorst H.A., Vuik C. GMRESR: a family of nested GMRES methods. Numer. Linear Algebra Appl. 1:1994;369-386.
188. Varga R.S. Matrix Iterative Analysis. 1962;Prentice-Hall, Englewood Cliffs, NJ.
189. Varga R.S. Factorization and normalized iterative methods. Langer R.E. Boundary Problems in Differential Equations. 1960;121-142 University of Wisconsin Press, Madison.
190. P.K.W. Vinsome, ORTHOMIN: an iterative method solving sparse sets of simultaneous linear equations, Proceedings of the Fourth Symposium on Reservoir Simulation, Society of Petroleum Engineers of AIME, 1976, pp. 149-159.
191. Vuik C., van der Vorst H.A. A comparison of some GMRES-like methods. Linear Algebra Appl. 160:1992;131-162.
192. Wachspress E.L. CURE, a generalized two-space-dimension multigroup coding for the IBM-704, Technical Report KAPL-1724, Knolls Atomic Power Laboratory. 1957;Schenectady, New York.
193. Wachspress E.L. Iterative Solution of Elliptic Systems and Applications to the Neutron Equations of Reactor Physics. 1966;Prentice-Hall, Englewood Cliffs, NJ.
194. Washio T., Hayami K. Parallel block preconditioning based on SSOR and MILU. Numer. Linear Algebra Appl. 1:1994;533-553.
195. Watts III J.W. A conjugate gradient truncated direct method for the iterative solution of the reservoir simulation pressure equation. Soc. Petroleum Eng. J. 21:1981;345-353.
196. Weiss R. Error-minimixing Krylov subspace methods. SIAM J. Sci. Comput. 15:1994;511-527.
197. R. Weiss, A theoretical overview of Krylov subspace methods, in: W. Schönauer, R. Weiss (Eds.), Special Issue on Iterative Methods for Linear Systems, Applied Numerical Methods, 1995, pp. 33-56.
198. Weiss R. Parameter-Free Iterative Linear Solvers. 1996;Akademie, Berlin.
199. Wesseling P. An Introduction to Multigrid Methods. 1992;Wiley, Chichester.
200. Widlund O. A Lanczos method for a class of nonsymmetric systems of linear equations. SIAM J. Numer. Anal. 15:1978;801-812.
201. Wilkinson J.H. The Algebraic Eigenvalue Problem. 1965;Clarendon Press, Oxford.
202. Wilkinson J.H., Reinsch C. Handbook of Automatic Computation, Linear Algebra, Vol. II. 1971;Springer, New York.
203. D.M. Young, Iterative methods for solving partial differential equations of elliptic type, Ph.D. Thesis, Harvard University, Cambridge, MA, USA, 1950.
204. Young D.M. On Richardson's method for solving linear systems with positive definite matrices. J. Math. Phys. 32:1954;243-255.
205. Young D.M. Iterative Solution of Large Linear Systems. 1971;Academic Press, New York.
206. Young D.P., Melvin R.G., Johnson F.T., Bussoletti J.E., Wigton L.B., Samant S.S. Application of sparse matrix solvers as effective preconditioners. SIAM J. Sci. Statist. Comput. 10:1989;1186-1199.
207. Zhang S.-L. GPBi-CG: generalized product-type methods based on Bi-CG for solving nonsymmetric linear systems. SIAM J. Sci. Comput. 18:1997;537-551.
208. Zlatev Z. Use of iterative refinement in the solution of sparse linear systems. SIAM J. Numer. Anal. 19:1982;381-399.