Preconditioning techniques for large linear systems: A survey

Journal of Computational Physics

Volumn 182, Issue 2, 2002, Pages 418-477

  Benzi, Michele ^a  

^a EMORY UNIVERSITY   (United States)

Author keywords

Algebraic preconditioners; Block algorithms; Incomplete factorizations; Iterative methods; Linear systems; Multilevel methods; Orderings; Parallel computing; Sparse approximate inverses; Sparse matrices; Unstructured grids

Indexed keywords

FACTORIZATION; ITERATIVE METHODS; MATRIX ALGEBRA; PARALLEL PROCESSING SYSTEMS;

ALGEBRAIC PRECONDITIONER; BLOCK ALGORITHM; INCOMPLETE FACTORIZATION; MULTILEVEL METHOD; ORDERING; PARALLEL COM- PUTING; PRECONDITIONING TECHNIQUES; SPARSE APPROXIMATE INVERSE; SPARSE MATRICES; UNSTRUCTURED GRID;

LINEAR SYSTEMS;

EID: 0036867930     PISSN: 00219991     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcph.2002.7176     Document Type: Article

References (296)

1. C. H. Ahn, W. C. Chew, J. S. Zhao, and E. Michielssen, Numerical study of approximate inverse preconditioner for two-dimensional engine inlet problems, Electromagnetics 19, 131 (1999).
2. M. A. Ajiz and A. Jennings, A robust incomplete Choleski-conjugate gradient algorithm, Int. J. Numer. Methods Eng. 20, 949 (1984).
3. G. Alléon, M. Benzi, and L. Giraud, Sparse approximate inverse preconditioning for dense linear systems arising in computational electromagnetics, Numer. Algorithms 16, 1 (1997).
4. P. Amestoy, T. A. Davis, and I. S. Duff, An approximate minimum degree ordering algorithm, SIAM J. Matrix Anal. Appl. 17, 886 (1996).
5. P. Amestoy, I. S. Duff, J.-Y. L'Excellent, and J. Koster, A fully asynchronous multifrontal solver using distributed dynamic scheduling, SIAM J. Matrix Anal. Appl. 23, 15 (2001).
6. S. F. Ashby, P. N. Brown, M. R. Dorr, and A. C. Hindmarsh, A linear algebraic analysis of diffusion synthetic acceleration for the Boltzmann transport equation, SIAM J. Numer. Anal. 32, 179 (1995).
7. S. F. Ashby, T. A. Manteuffel, and P. E. Saylor, Adaptive polynomial preconditioning for hermitian indefinite linear systems, BIT 29, 583 (1989).
8. C. Ashcraft, Compressed graphs and the minimum degree algorithm, SIAM J. Sci. Comput. 16, 1404 (1995).
9. O. Axelsson, A generalized SSOR method, BIT 13, 443 (1972).
10. O. Axelsson, A survey of preconditioned iterative methods for linear systems of algebraic equations, BIT 25, 166 (1985).
11. O. Axelsson, A general incomplete block matrix factorization method, Linear Algebra Its Appl. 74, 179 (1986).
12. O. Axelsson, Iterative Solution Methods (Cambridge Univ. Press, Cambridge, 1994).
13. O. Axelsson, S. Brinkkemper, and V. P. Il'in, On some versions of incomplete block matrix factorization iterative methods, Linear Algebra Its Appl. 58, 3 (1984).
14. O. Axelsson and V. Eijkhout, Vectorizable preconditioners for elliptic difference equations in three space dimensions, J. Comput. Appl. Math. 27, 299 (1991).
15. O. Axelsson and L. Yu. Kolotilina, Diagonally compensated reduction and related preconditioning methods, Numer. Linear Algebra Appl. 1, 155 (1994).
16. O. Axelsson and P. S. Vassilevski, Algebraic multilevel preconditioning methods, I, Numer. Math. 56, 157 (1989).
17. O. Axelsson and P. S. Vassilevski, Algebraic multilevel preconditioning methods, II, SIAM J. Numer. Anal. 27, 1569 (1990).
18. S. Balay, K. Buschelman, W. Gropp, D. Kaushik, M. Knepley, L. C. McInnes, B. Smith, and H. Zhang, PETSc User's Manual, Report ANL 95/11, Revision 2.2.3 (Argonne National Laboratory, Argonne, IL, 2002).
19. R. N. Banerjee and M. W. Benson, An approximate inverse based multigrid approach to the biharmonic problem, Int. J. Comput. Math. 40, 201 (1991).
20. R. E. Bank and R. K. Smith, The incomplete factorization multigraph algorithm, SIAM J. Sci. Comput. 20, 1349 (1999).
21. R. E. Bank and R. K. Smith, An algebraic multilevel multigraph algorithm, SIAM J. Sci. Comput. 23, 1572 (2002).
22. R. E. Bank and C. Wagner, Multilevel ILU decomposition, Numer. Math. 82, 543 (1999).
23. S. T. Barnard, L. M. Bernardo, and H. D. Simon, An MPI implementation of the SPAI preconditioner on the T3E, Int. J. High Perform. Comput. Appl. 13, 107 (1999).
24. S. T. Barnard and R. L. Clay, A portable MPI implementation of the SPAI preconditioner in ISIS++, in Proceedings of the Eight SIAM Conference on Parallel Processing for Scientific Computing, edited by M. Heath et al. (SIAM, Philadelphia, PA, 1997 [CD-ROM]).
25. S. T. Barnard and M. J. Grote, A block version of the SPAI preconditioner, in Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, edited by B. A. Hendrickson et al. (SIAM, Philadelphia, PA, 1999 [CD-ROM]).
26. R. Barrett, M. Berry, T. F. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. van der Vorst, Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods (SIAM, Philadelphia, PA, 1994).
27. G. A. Behie and P. A. Forsyth, Comparison of fast iterative methods for symmetric systems, IMA J. Numer. Anal. 3, 41 (1983).
28. M. W. Benson, Iterative Solution of Large Scale Linear Systems, M.Sc. thesis (Lakehead University, Thunder Bay, Ontario, 1973).
29. M. W. Benson, Frequency domain behavior of a set of parallel multigrid smoothing operators, Int. J. Comput. Math. 36, 77 (1990).
30. M. W. Benson, An approximate inverse based multigrid approach to thin domain problems, Util. Math. 45, 39 (1994).
31. M. W. Benson and P. O. Frederickson, Iterative solution of large sparse linear systems arising in certain multidimensional approximation problems, Util. Math. 22, 127 (1982).
32. M. Benzi, J. K. Cullum, and M. Tůma, Robust approximate inverse preconditioning for the conjugate gradient method, SIAM J. Sci. Comput. 22, 1318 (2000).
33. M. Benzi, J. C. Haws, and M. Tůma, Preconditioning highly indefinite and nonsymmetric matrices, SIAM J. Sci. Comput. 22, 1333 (2000).
34. M. Benzi, W. D. Joubert, and G. Mateescu, Numerical experiments with parallel orderings for ILU preconditioners, Electron. Trans. Numer. Anal. 8, 88 (1999).
35. M. Benzi, R. Kouhia, and M. Tůma, An assessment of some preconditioning techniques in shell problems, Commun. Numer. Methods Eng. 14, 897 (1998).
36. M. Benzi, R. Kouhia, and M. Tůma, Stabilized and block approximate inverse preconditioners for problems in solid and structural mechanics, Comput. Methods Appl. Mech. Eng. 190, 6533 (2001).
37. M. Benzi, J. Marín, and M. Tůma, A two-level parallel preconditioner based on sparse approximate inverses, in Iterative Methods in Scientific Computation IV, edited by D. R. Kincaid and A. C. Elster, IMACS Series in Computational and Applied Mathematics, Vol. 5, p. 167. (IMACS, New Brunswick, NJ, 1999).
38. M. Benzi, C. D. Meyer, and M. Tůma, A sparse approximate inverse preconditioner for the conjugate gradient method, SIAM J. Sci. Comput. 17, 1135 (1996).
39. M. Benzi, D. B. Szyld, and A. van Duin, Orderings for incomplete factorization preconditioning of nonsymmetric problems, SIAM J. Sci. Comput. 20, 1652 (1999).
40. M. Benzi and M. Tůma, A sparse approximate inverse preconditioner for nonsymmetric linear systems, SIAM J. Sci. Comput. 19, 968 (1998).
41. M. Benzi and M. Tůma, Numerical experiments with two approximate inverse preconditioners, BIT 38, 234 (1998).
42. M. Benzi and M. Tůma, A comparative study of sparse approximate inverse preconditioners, Appl. Numer. Math. 30, 305 (1999).
43. M. Benzi and M. Tůma, Orderings for factorized approximate inverse preconditioners, SIAM J. Sci. Comput. 21, 1851 (2000).
44. M. Benzi and M. Tůma, A robust incomplete factorization preconditioner for positive definite matrices, Numer. Linear Algebra Appl., in press.
45. M. Benzi and M. Tůma, A parallel solver for large-scale Markov chains, Appl. Numer. Math. 41, 135 (2002).
46. L. Bergamaschi, G. Pini, and F. Sartoretto, Approximate inverse preconditioning in the parallel solution of sparse eigenproblems, Numer. Linear Algebra Appl. 7, 99 (2000).
47. L. Bergamaschi, G. Pini, and F. Sartoretto, Parallel preconditioning of a sparse eigensolver, Parallel Comput. 27, 963 (2001).
48. A. Berman and R. J. Plemmons, Nonnegative Matrices in the Mathematical Sciences, 3rd ed. (Academic Press, New York, 1979; reprinted by SIAM, Philadelphia, PA, 1994).
49. M. Bern, J. R. Gilbert, B. Hendrickson, N. Nguyen, and S. Toledo, Support graph preconditioners, submitted for publication.
50. E. Bodewig, Matrix Calculus, 2nd ed. (Interscience, New York/North-Holland, Amsterdam, 1959).
51. M. Bollhöfer, A robust ILU with pivoting based on monitoring the growth of the inverse factors, Linear Algebra Its Appl. 338, 201 (2001).
52. M. Bollhöfer, A robust and efficient ILU that incorporates the growth of the inverse triangular factors, submitted for publication.
53. M. Bollhöfer and V. Mehrmann, Algebraic multilevel methods and sparse approximate inverses, SIAM J. Matrix Anal. Appl. 24, 191 (2002).
54. M. Bollhöfer and Y. Saad, A factored approximate inverse preconditioner with pivoting, SIAM J. Matrix Anal. Appl. 23, 692 (2002).
55. M. Bollhöfer and Y. Saad, On the relations between ILUs and factored approximate inverses, SIAM J. Matrix Anal. Appl, 24, 219 (2002).
56. E. G. Boman, D. Chen, B. Hendrickson, and S. Toledo, Maximum-weigbt-basis preconditioners, submitted for publication.
57. Y. Y. Botros and J. L. Volakis, Preconditioned generalized minimal residual iterative scheme for perfectly matched layer terminated applications, IEEE Microwave Guided Wave Lett. 9, 45 (1999).
58. E. F. F. Botta and F. W. Wubs, Matrix renumbering ILU: An effective algebraic multilevel ILU preconditioner for sparse matrices, SIAM J. Matrix Anal. Appl. 20, 1007 (1999).
59. J. H. Bramble, Multigrid Methods (Longman Scientific & Technical, Harlow, UK, 1993).
60. C. W. Brand, An incomplete factorization preconditioning using repeated red/black ordering, Numer. Math. 61, 433 (1992).
61. A. Brandt, Multi-level adaptive solutions to boundary-value problems, Math. Comput. 31, 333 (1977).
62. A. Brandt, S. McCormick, and J. Ruge, Algebraic multigrid (AMG) for sparse matrix equations, in Sparsity and Its Applications, edited by D. J. Evans, p. 257 (Cambridge Univ. Press, Cambridge, UK, 1985).
63. C. Brezinski, Projection Methods for Systems of Equations, Studies in Computational Mathematics, Vol. 27 (North-Holland, Amsterdam, 1997).
64. R. Bridson and W.-P. Tang, Ordering, anisotropy and factored sparse approximate inverses, SIAM J. Sci. Comput. 21, 867 (1999),
65. R. Bridson and W.-P. Tang, A structural diagnosis of some IC orderings, SIAM J. Sci. Comput. 22, 1527 (2000).
66. R. Bridson and W.-P. Tang, Refining an approximate inverse, J. Comput. Appl. Math. 22, 1527 (2000).
67. R. Bridson and W.-P. Tang, Multiresolution approximate inverse preconditioners, SIAM J. Sci. Comput. 23, 463 (2001),
68. W. L. Briggs, V. E. Henson, and S. F. McCormick, A Multigrid Tutorial, 2nd ed. (SIAM, Philadelphia, PA, 2000).
69. O. Bröker and M. J. Grote. Sparse approximate inverse smoothers for geometric and algebraic multigrid, Appl. Numer. Math, 41, 61 (2002).
70. O. Bröker, M. J. Grote, C. Mayer, and A. Reusken, Robust parallel smoothing for multigrid via sparse approximate inverses, SIAM J. Sci. Comput. 23, 1395 (2001).
71. A. M. Bruaset, A Survey of Preconditioned Iterative Methods (Longman Scientific & Technical, Harlow, UK, 1995).
72. N. I. Buleev, A numerical method for solving two dimensional diffusion equations, At. Energ. 6, 338 (1959) [in Russian].
73. N. I. Buleev, A numerical method for solving two- and three-dimensional diffusion equations, Mat. Sb. 51, 227 (1960) [in Russian].
74. B. Carpentieri, I. S. Duff, and L. Giraud, Sparse pattern selection strategies for robust Frobenius-norm minimization preconditioners in electromagnetics, Numer. Linear Algebra Appl. 7, 667 (2000).
75. B. Carpentieri, I. S. Duff, L. Giraud, and M. Magolu monga Made, Sparse Symmetric Preconditioners for Dense Linear Systems in Electromagnetics, CERFACS Technical Report TR/PA/01/35 (Toulouse, France, 2001).
76. B. Carpentieri, I. S. Duff, L. Giraud, and G. Sylvand, Combining fast multipole techniques and approximate inverse preconditioners for large calculations in electromagnetism, in Activity Report of the Parallel Algorithms Project at CERFACS, January 2001-December2001, CERFACS Tecnical Report TR/PA/01/105 (Toulouse, France, 2001).
77. L. Cesari, Sulla risoluzione dei sistemi di equazioni lineari per approssimazioni successive, Atti Accad. Nazionale Lincei R. Classe Sci. Fis. Mat. Nat. 25, 422 (1937).
78. M. Challacombe, A simplified density matrix minimization for linear scaling self-consistent field theory, J. Chem. Phys. 110, 2332 (1999).
79. M. Challacombe, A general parallel sparse-blocked matrix multiply for linear scaling SCF theory, Comput. Phys. Commun. 128, 93 (2000).
80. T. F. Chan, W.-P. Tang, and W.-L. Wan, Wavelet sparse approximate inverse preconditioners, BIT 37, 644 (1997).
81. T. F. Chan and H. A. van der Vorst, Approximate and incomplete factorizations, in Parallel Numerical Algorithms, edited by D. E. Keyes, A. Sameh, and V. Venkatakrishnan, ICASE/LaRC Interdisciplinary Series in Science and Engineering, Vol. 4, p. 167 (Kluwer Academic, Dordrecht, 1997).
82. A. Chapman, Y. Saad, and L. Wigton, High-order ILU preconditioners for CFD problems, Int. J. Numer. Methods Fluids 33, 767 (2000).
83. D. Chen and S. Toledo, Vaidya's preconditioners: implementation and experimental study, submitted for publication.
84. K. Chen, On a class of preconditioning methods for dense linear systems from boundary elements, SIAM J. Sci. Comput. 20, 684 (1998).
85. K. Chen, Discrete wavelet transforms accelerated sparse preconditioners for dense boundary element systems, Electron. Trans. Numer. Anal. 8, 138 (1999).
86. K. Chen, An analysis of sparse approximate inverse preconditioners for boundary integral equations, SIAM J. Matrix Anal. Appls. 22, 1058 (2001).
87. M. P. Chernesky, On preconditioned Krylov subspace methods for discrete convection-diffusion problems, Numer. Methods Partial Differential Equations 13, 321 (1997).
88. H. Choi and D. B. Szyld, Application of threshold partitioning of sparse matrices to Markov chains, in Proceedings of the IEEE International Computer Performance and Dependability Symposium, IPDS'96, p. 158 (IEEE Computer Soc. Press, Los Alamitos, CA, 1996).
89. R. Choquet and V. Perrier, Fast wavelet iterative solvers applied to the Neumann problem, Aerospace Sci. Technol. 4, 135 (2000).
90. E. Chow, A priori sparsity patterns for parallel sparse approximate inverse preconditioners, SIAM J. Sci. Comput. 21, 1804 (2000).
91. E. Chow, Parallel implementation and performance characteristics of sparse approximate inverse preconditioners with a priori sparsity patterns, Int. J. High-Perform. Comput. Appl. 15, 56 (2001).
92. E. Chow and M. A. Heroux, An object-oriented framework for block preconditioning, ACM Trans. Math. Software 24, 159 (1998).
93. E. Chow and Y. Saad, Approximate inverse techniques for block-partitioned matrices, SIAM J. Sci. Comput. 18, 1657 (1997).
94. E. Chow and Y. Saad, Experimental study of ILU preconditioners for indefinite matrices, J. Comput. Appl. Math. 86, 387 (1997).
95. E. Chow and Y. Saad, ILUS: An incomplete ILU preconditioner in sparse skyline format, Int. J. Numer. Methods Fluids 25, 739 (1997).
96. E. Chow and Y. Saad, Approximate inverse preconditioners via sparse-sparse iterations, SIAM J. Sci. Comput. 19, 995 (1998).
97. A. J. Cleary, R. D. Falgout, V. E. Henson, J. J. Jones, T A. Manteuffel, S. F. McCormick, G. N. Miranda, and J. W. Ruge, Robustness and scalability of algebraic multigrid, SIAM J. Sci. Comput. 21, 1886 (2000).
98. S. S. Clift and W.-P. Tang, Weighted graph based ordering techniques for preconditioned conjugate gradient methods, BIT 35, 30 (1995).
99. A. Cohen and R. Masson, Wavelet methods for second-order elliptic problems, preconditioning, and adaptivity, SIAM J. Sci. Comput. 21, 1006 (1999).
100. P. Concus, G. H. Golub, and G. Meurant, Block preconditioning for the conjugate gradient method, SIAM J. Sci. Stat. Comput. 6, 220 (1985).
101. P. Concus, G. H. Golub, and D. P. O'Leary, A generalized conjugate gradient method for the numerical solution of elliptic partial differential equations, in Sparse Matrix Computations, edited by J. R. Bunch and D. J, Rose, p. 309 (Academic Press, New York, 1976).
102. J. D. F. Cosgrove, J. C. Díaz, and A. Griewank, Approximate inverse preconditioning for sparse linear systems, Int. J. Comput. Math. 44, 91 (1992).
103. E. Cuthill, Several strategies for reducing the bandwidth of matrices, in Sparse Matrices and Their Applications, p. 157, edited by D. J. Rose and R. A. Willoughby (Plenum, New York, 1972).
104. W. Dahmen and L. Elsner, Algebraic multigrid methods and the Schur complement, in Robust MultiGrid Methods (Kiel 1988), Notes in Numerical Fluid Mechanics 23, p. 58 (Vieweg, Braunschweig, 1989).
105. E. Darve, The fast multipole method. I. Error analysis and asymptotic complexity, SIAM J. Numer. Anal. 38, 98 (2000).
106. E. Darve, The fast multipole method: Numerical implementation, J. Comput. Phys. 160, 195 (2000).
107. T. A. Davis, University of Florida Sparse Matrix Collection, NA Digest, Vol. 92, No. 42, October 16, 1994; NA Digest, Vol. 96, No. 28, July 23, 1996; and NA Digest, Vol. 97, No. 23, June 7, 1997, available at http://www.cise.ufl.edu/research/sparse/matrices, ftp://ftp.cise.ufl.edu/pub/faculty/davis/matrices.
108. E. F. D'Azevedo, P. A. Forsyth, and W.-P. Tang, Ordering methods for preconditioned conjugate gradient methods applied to unstructured grid problems, SIAM J. Matrix Anal. Appl. 13, 944 (1992).
109. E. F. D'Azevedo, P. A. Forsyth, and W.-P. Tang, Two variants of minimum discarded fill ordering, in Iterative Methods in Linear Algebra, edited by R. Beauwens and P. de Groen, p. 603 (Elsevier Science, North-Holland, 1992).
110. J. E. Dendy, Black box multigrid, J. Comput. Phys. 48, 366 (1980).
111. E. de Doncker and A. K. Gupta, Coarse grain preconditioned conjugate gradient solver for large sparse systems, in Proceedings of the Seventh SIAM Conference on Parallel-Processing for Scientific Computing, edited by J. Lewis, p. 472 (SIAM, Philadelphia, PA, 1995).
112. S. Demko, W. F. Moss, and P. W. Smith, Decay rates for inverses of band matrices, Math. Comput. 43, 491 (1984).
113. J. C. Díaz and K. Komara, Incomplete multilevel Cholesky factorizations, SIAM J. Matrix Anal. Appl. 22, 895 (2000).
114. S. Doi, On parallelism and convergence of incomplete LU factorizations, Appl. Numer. Math. 7, 417 (1991).
115. S. Doi and T. Washio, Ordering strategies and related techniques to overcome the trade-off between parallelism and convergence in incomplete factorizations, Parallel Comput. 25, 1995 (1999).
116. J. J. Dongarra, I. S. Duff, D. C. Sorensen, and H. A. van der Vorst, Numerical Linear Algebra for High-Performance Computers (SIAM, Philadelphia, PA, 1998).
117. J. Douglas, Jr., and H. H. Rachford, Jr., On the numerical solution of heat conduction problems in two or three space variables, Trans. Am. Math. Soc. 82,421 (1956).
118. J. Drkošová, A. Greenbaum, M. Rozložnik, and Z. Strakoš, Numerical stabilty of GMRES, BIT 35, 309 (1995).
119. P. F. Dubois, A. Greenbaum, and G. H. Rodrigue, Approximating the inverse of a matrix for use in iterative algorithms on vector processors, Computing 22, 257 (1979).
120. I. S. Duff, A. M. Erisman, C. W. Gear, and J. K. Reid, Sparsity structure and Gaussian elimination, SIGNUM Newsl. 23, 2 (1988).
121. I. S. Duff, A. M. Erisman, and J. K. Reid, Direct Methods for Sparse Matrices (Clarendon, Oxford, 1986).
122. I. S. Duff, R. G. Grimes, and J. G. Lewis, The Rutherford-Boeing Sparse Matrix Collection, Technical Report RAL-TR-97-031 (Rutherford Appleton Laboratory, Chilton, UK, 1997).
123. I. S. Duff and J. Koster, The design and use of algorithms for permuting large entries to the diagonal of sparse matrices, SIAM J. Matrix Anal. Appl. 20, 889 (1999).
124. I. S. Duff and J. Koster, On algorithms for permuting large entries to the diagonal of a sparse matrix, SIAM J. Matrix Anal. Appl. 22, 973 (2001).
125. I. S. Duff and G. Meurant, The effect of ordering on preconditioned conjugate gradients, BIT 29, 635 (1989).
126. T. Dupont, R. P. Kendall, and H. H. Rachford, Jr., An approximate factorization procedure for solving self-adjoint elliptic difference equations, SIAM J. Numer. Anal. 5, 559 (1968).
127. L. C. Dutto, The effect of ordering on preconditioned GMRES algorithm, for solving the compressible Navier-Stokes equations, Int. J. Numer. Methods Eng. 36, 457 (1993).
128. V. Eijkhout, Analysis of parallel incomplete point factorizations, Linear Algebra Its Appl. 154, 723 (1991).
129. V. Eijkhout, Beware of unperturbed modified incomplete factorizations, in Iterative Methods in Linear Algebra, edited by R. Beauwens and P. de Groen, p. 583 (Elsevier Science, North-Holland, 1992).
130. S. Eisenstat, Efficient implementation of a class of conjugate gradient methods, SIAM J. Sci. Stat. Comput. 2, 1 (1981).
131. H. C. Elman, A stability analysis of incomplete LU factorizations, Math. Comput. 47, 191 (1986).
132. H. C. Elman and M. P. Chernesky, Ordering effects on relaxation methods applied to the discrete one-dimensional convection-diffusion equation, SIAM J. Numer. Anal. 30, 1268 (1993).
133. M. Engeli, Th. Ginsburg, H. Rutishauser, and E. Stiefel, Refined Iterative Methods for Computation of the Solution and the Eigenvalues of Self-Adjoint Boundary Value Problems (Birkhäuser, Basel/Stuttgart, 1959).
134. D. J. Evans, The use of pre-conditioning in iterative methods for solving linear systems with symmetric positive definite matrices, J. Inst. Math. Its Appl. 4, 295 (1968).
135. C. Farhat and F.-X. Roux, A method of finite-element tearing and interconnecting and its parallel solution algorithm, Int. J. Numer. Methods Eng. 32, 1205 (1991).
136. C. Farhat, J. Mandel, and F.-X. Roux, Optimal convergence properties of the FETI domain decomposition method, Comput. Methods Appl. Mech. Eng. 115, 365 (1994).
137. C. Farhat and J. Mandel, The two-level FETI method for static and dynamic plate problems. Part I: An optimal iterative solver for biharmonic systems, Comput. Methods Appl. Mech. Eng. 155, 129 (1998).
138. R. P. Fedorenko, A relaxation method for solving elliptic difference equations, USSR Comput. Math. Math. Phys. 1, 1092 (1961).
139. R. P. Fedorenko, The speed of convergence of one iterative process, USSR Comput. Math. Math. Phys. 4, 227 (1964).
140. M. R. Field, An Efficient Parallel Preconditioner for the Conjugate Gradient Algorithm, Hitachi Dublin Laboratory Technical Report HDL-TR-97-175 (Dublin, Ireland, 1997).
141. M. R. Field, Improving the Performance of Factorised Sparse Approximate Inverse Preconditioner, Hitachi Dublin Laboratory Technical Report HDL-TR-98-199 (Dublin, Ireland, 1998).
142. B. Fischer, Polynomial Based Iteration Methods for Symmetric Linear Systems (Wiley-Teubner, Chichester, 1996).
143. R. Fletcher, Conjugate gradient methods for indefinite systems, in Numerical Analysis Dundee 1975, edited by G. A. Watson, p. 73, Lecture Notes in Mathematics No. 506 (Springer, Berlin, 1976).
144. L. Fox L, H. D. Huskey, and J. H. Wilkinson, Notes on the solution of algebraic linear simultaneous equations, Q. J. Mech. Appl. Math. 1, 149 (1948).
145. P. O. Frederickson, Fast Approximate Inversion of Large Sparse Linear Systems, Math. Report 7 (Lakehead University, Thunder Bay, Ontario, 1975).
146. R. Freund, A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems, SIAM J. Sci. Comput. 14, 470 (1993).
147. R. Freund, G. H. Golub, and N. M. Nachtigal, Iterative solution of linear systems, Acta Numer. 1, 57 (1991).
148. R. Freund and N. M. Nachtigal, QMR: A quasi-minimal residual method for non-Hermitian linear systems, Numer. Math. 60, 315 (1991).
149. A. George, Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal. 10, 345 (1973).
150. A. George and J. W. Liu, Computer Solution of Large Sparse Positive Definite Systems (Prentice-Hall, Englewood Cliffs, NJ, 1981).
151. A. George and J. W. Liu, The evolution of the minimum degree algorithm, SIAM Rev. 31, 1 (1989).
152. N. E. Gibbs, W. G. Poole, Jr., and R K. Stockmeyer, An algorithm for reducing the bandwidth and profile of a sparse matrix, SIAM J. Numer. Anal. 13, 236 (1976).
153. J. R. Gilbert, Predicting structure in sparse matrix computations, SIAM J. Matrix Anal. Appl. 15, 62 (1994).
154. P. E. Gill, W. Murray, and M. H. Wright, Practical Optimization (Academic Press, London, 1981).
155. G. H. Golub and D. P. O'Leary, Some history of the conjugate gradient and Lanczos methods: 1948-1976, SIAM Rev. 31, 50 (1989).
156. G. H. Golub and C. F. van Loan, Matrix Computations, 3rd ed. (Johns Hopkins Press, Baltimore, 1996).
157. G. H. Golub and Q. Ye, Inexact preconditioned conjugate-gradient method with inner-outer iteration, SIAM J. Sci. Comput. 21, 1305 (1999).
158. N. I. M. Gould and J. A. Scott, Sparse approximate-inverse preconditioners using norm-minimization techniques, SIAM J. Sci. Comput. 19, 605 (1998).
159. A. Greenbaum, Analysis of a multigrid method as an iterative method for solving linear systems, SIAM J. Numer. Anal. 21, 473 (1984).
160. A. Greenbaum, Iterative Methods for Solving Linear Systems (SIAM, Philadelphia, PA, 1997).
161. A. Greenbaum, V. Pák, and Z. Strakoš, Any nonincreasing convergence curve is possible for GMRES, SIAM J. Matrix Anal. Appl. 17, 465 (1996).
162. A. Greenbaum and Z. Strakoš, Predicting the behavior of finite precision Lanczos and conjugate gradient computations, SIAM J. Matrix Anal. Appl. 13, 121 (1992).
163. M. Grote and T. Huckle, Parallel preconditioning with sparse approximate inverses, SIAM J. Sci. Comput. 18, 838 (1997).
164. I. Gustafsson, A class of first order factorization methods, BIT 18, 142 (1978).
165. G. Haase, Parallel incomplete Cholesky preconditioners based on the nonoverlapping data distribution, Parallel Comput. 24, 1685 (1998).
166. W. Hackbusch, Multi-Grid Methods and Applications (Springer-Verlag, Berlin, 1985).
167. W. Hackbusch, Iterative Solution of Large Sparse Systems of Equations (Springer-Verlag, New York, 1994).
168. A. L. Hageman and D. M. Young, Applied Iterative Methods (Academic Press, New York, 1981).
169. M. Heniche, Y. Secretan, and M. Leclerc, Efficient ILU preconditioning and inexact-Newton-GMRES to solve the 2D steady shallow water equations, Commun. Numer. Methods Eng. 17, 69 (2001).
170. V. E. Henson and U. M. Yang, BoomerAMG: A parallel algebraic multigrid solver and preconditioner, Appl. Numer. Math, 41, 155 (2002).
171. M. R. Hestenes and E. L. Stiefel, Methods of conjugate gradients for solving linear systems, J. Res. Natl. Bur. Stand. 49, 409 (1952).
172. I, Hladík, M. B. Reed, and G. Swoboda, Robust preconditioners for linear elasticity FEM analyses, Int. J. Numer. Methods Eng. 40, 2109 (1997).
173. A. S. Householder, The Theory of Matrices in Numerical Analysis (Blaisdell, New York, 1964).
174. T. Huckle, Approximate sparsity patterns for the inverse of a matrix and preconditioning, Appl. Numer. Math. 30, 291 (1999).
175. T. Huckle, Factorized sparse approximate inverses for preconditioning and smoothing, Selčuk J, Appl. Math, 1, 63 (2000).
176. T. Huckle, Factorized sparse approximate inverses for preconditioning, in Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2001), (CSREA Press, Las Vegas, Nevada, 2001).
177. D. Hysom, New Sequential and Scalable Parallel Algorithms for Incomplete Factor Preconditioning, Ph.D, thesis (Dep. Computer Science, Old Dominion Univ., Norfolk, VA, 2001).
178. D. Hysom and A. Pothen, A scalable parallel algorithm for incomplete factor preconditioning, SIAM J. Sci. Comput. 22, 2194 (2001).
179. V. P. Il'in, Iterative Incomplete Factorization Methods (World Scientific, Singapore, 1992).
180. C. G. J. Jacobi, Über eine neue Aufiösungsart der bei der Methode der kleinsten Quadrate vorkornmenden linearen Gleichungen, Astron. Nachrichten 22, 297 (1845).
181. O. G. Johnson, C. A. Micchelli, and G. Paul, Polynomial preconditioning for conjugate gradient calculations, SIAM J. Numer. Anal. 20, 362 (1983).
182. M. T. Jones and P. E. Plassmann, Scalable iterative solution of sparse linear systems, Parallel Comput. 20, 753 (1994).
183. M. T. Jones and P. E. Plassmann, An improved incomplete Cholesky factorization, ACM Trans. Math. Software, 21, 5 (1995).
184. M. T. Jones and P. E. Plassmann, Algorithm 740: Fortran subroutines to compute improved incomplete Cholesky factorizations, ACM Trans. Math. Software 21, 18 (1995).
185. I. E. Kaporin, New convergence results and preconditioning strategies for the conjugate gradient method, Numer. Linear Algebra Appl. 1, 179 (1994).
186. T U decomposition, Numer. Linear Algebra Appl. 5, 483 (1998).
187. I. E. Kaporin and I. N. Konshin, A parallel block overlap preconditioning with inexact submatrix inversion for linear elasticity problems, Numer. Linear Algebra Appl. 9, 141 (2002).
188. G. Karypis and V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Comput. 20, 359 (1998).
189. G. Karypis and V. Kumar, Parallel Threshold-Based ILU Factorization, Technical Report 061 (Dep. Computer Science/Army HPC Research Center, Univ. Minnesota, Minneapolis, 1998).
190. D. S. Kershaw, The incomplete Cholesky conjugate gradient method for the iterative solution of systems of linear equations, J. Comput. Phys. 26, 43 (1978).
191. S. A. Kharchenko, L. Yu. Kolotilina, A. A. Nikishin, and A. Yu. Yeremin, A robust AINV-type method for constructing sparse approximate inverse preconditioners in factored form, Numer. Linear Algebra Appl. 8, 165 (2001).
192. A. W. Knyazev, Preconditioned eigensolvers-an oxymoron? Electron. Trans. Numer. Anal. 7, 104 (1998).
193. L. Yu. Kolotilina, Explicit preconditioning of systems of linear algebraic equations with dense matrices, J. Sov. Math. 43, 2566 (1988).
194. L. Yu. Kolotilina, A. A. Nikishin, and A. Yu, Yeremin, Factorized sparse approximate inverse preconditionings. IV: Simple approaches to rising efficiency, Numer. Linear Algebra Appl. 6, 515 (1999).
195. L. Yu. Kolotilina and A. Yu. Yeremin, On a family of two-level preconditionings of the incomplete block factorization type, Sov. J. Numer. Anal. Math. Model. 1, 293 (1986).
196. L. Yu. Kolotilina and A. Yu. Yeremin, Factorized sparse approximate inverse preconditioning. I. Theory, SIAM J. Matrix Anal. Appl. 14, 45 (1993).
197. L. Yu. Kolotilina and A. Yu. Yeremin, Factorized sparse approximate inverse preconditioning. II: Solution of 3D FE systems on massively parallel computers, Int. J. High Speed Comput. 7, 191 (1995).
198. A. Krechen and K. Stüben, Parallel algebraic multigrid based on subdomain blocking, Parallel Comput. 27, 1009 (2001).
199. C. Lanczos, Solutions of systems of linear equations by minimized iterations, J. Res. Natl. Bur. Stand. 49, 33 (1952).
200. E. W. Larsen, Unconditionally stable diffusion-synthetic acceleration methods for the slab geometry discrete ordinates equations. Part I: Theory, Nucl. Sci. Eng. 82, 47 (1982).
201. S. Le Borne, Ordering techniques for two- and three-dimensional convection-dominated elliptic boundary value problems, Computing 64, 123 (2000).
202. S. L. Lee, Krylov Methods for the Numerical Solution of Initial-Value Problems in Differential-Algebraic Equations, Ph.D. thesis and Technical Report UIUCDS-R-93-1814 (Dep. Computer Science, Univ. Illinois at Urbana-Champaign, 1993).
203. N. Li, Y. Saad, and M. Sosonkina, pARMS: A Parallel Version of the Algebraic Recursive Multilevel Solver, Technical Report UMSI-2001-100 (Minnesota Supercomputer Institute, Univ. Minnesota, Minneapolis, 2001).
204. C.-J. Lin and J. J. Moré, Incomplete Cholesky factorizations with limited memory, SIAM J. Sci. Comput. 21, 24 (1999).
205. C.-J. Lin and R. Saigal, An incomplete Cholesky factorization for dense symmetric positive definite matrices, BIT 40, 536 (2000).
206. R. J. Lipton, D. J. Rose, and R. E. Tarjan, Generalized nested dissection, SIAM J. Numer. Anal. 16, 346 (1979).
207. J. W. H. Liu, Modification of the minimum degree algorithm by multiple elimination, ACM Trans. Math. Software 11, 141 (1985).
208. J. W. H. Liu, E. G. Ng, and B. W. Peyton, On finding supernodes for sparse matrix computations, SIAM J. Matrix Anal. Appl. 14, 242 (1993).
209. M. Magolu monga Made, Incomplete factorization based preconditionings, for solving the Helmholtz equation, Int. J. Numer. Methods Eng. 50, 1077 (2001).
210. M. Magolu monga Made, R. Beauwens, and G. Warzée, Preconditioning of discrete Helmholtz operators perturbed by a diagonal complex matrix, Commun. Numer. Methods Eng. 16, 801 (2000).
211. M. Magolu monga Made and B. Polman, Experimental comparison of three-dimensional point and line modified incomplete factorization, Numer. Algorithms 23, 51 (2000).
212. M. Magolu monga Made and H. A. van der Vorst, Parallel incomplete factorizations with pseudooverlapping subdomains, Parallel Comput. 27, 989 (2001).
213. T. A. Manteuffel, An incomplete factorization technique for positive definite linear systems, Math. Comput. 34, 473 (1980).
214. D. R. McCoy and E. W. Larsen, Unconditionally stable diffusion-synthetic acceleration methods for the slab geometry discrete ordinates equations. Part II: Numerical results, Nucl. Sci. Eng. 82, 64 (1982).
215. J. A. Meijerink and H. A. van der Vorst, An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix, Math. Comput. 31, 148 (1977).
216. G. A. Meurant, A review of the inverse of symmetric tridiagonal and block tridiagonal matrices, SIAM J. Matrix Anal. Appl. 13, 707 (1992).
217. G. A. Meurant, Computer Solution of Large Linear Systems, Studies in Mathematics and Its Applications, Vol. 28 (North-Holland, Amsterdam, 1999).
218. G. A. Meurant, A multilevel AINV preconditioner, Numer. Algorithms 29,107 (2002).
219. G. A. Meurant, Numerical experiments with algebraic multilevel preconditioners, Electron. Trans. Numer. Anal. 12, 1 (2001).
220. O. Yu. Milyukova, Parallel approximate factorization method for solving discrete elliptic equations, Parallel Comput. 27, 1365 (2001).
221. R. B. Morgan, Preconditioning eigenvalues and some comparison of solvers, J. Comput. Appl. Math. 123, 101 (2000).
222. V. A. Mousseau, D. A. Knoll, and W. J. Rider, Physics-based preconditioning and the Newton-Krylov method for non-equilibrium radiation diffusion, J. Comput. Phys. 160, 743 (2000).
223. M. F. Murphy, G. H. Golub, and A. J. Wathen, A note on preconditioning for indefinite linear systems, SIAM J. Sci. Comput. 21, 1969 (2000).
224. S. G. Nash, Ed., A History of Scientific Computing (Addison-Wesley, Reading, MA, 1990).
225. National Institute of Standards, Matrix Market, available online at http://math.nist.gov/MatrixMarket.
226. E. Ng, B. W. Peyton, and P. Raghavan, A blocked incomplete Cholesky preconditioner for hierarchical-memory computers, in Iterative Methods in Scientific Computation IV, edited by D. R. Kincaid and A. C. Elster, IMACS Series in Computational and Applied Mathematics, Vol. 5, 211 (IMACS, New Brunswick, NJ, 1999).
227. Y. Notay, Using approximate inverses in algebraic multilevel methods, Numer. Math. 80, 397 (1998).
228. Y. Notay, A multilevel block incomplete factorization preconditioning, Appl. Numer. Math. 31, 209 (1999).
229. Y. Notay, Optimal order preconditioning of finite difference matrices, SIAM J. Sci. Comput. 21, 1991 (2000).
230. Y. Notay, Flexible conjugate gradient, SIAM J. Sci. Comput. 22, 1444 (2000).
231. T. A. Oliphant, An extrapolation process for solving linear systems, Q. Appl. Math. 20, 257 (1962).
232. M. Olschowka and A. Neumaier, A new pivoting strategy for Gaussian elimination, Linear Algebra Its Appl. 240, 131 (1996).
233. J. O'Neil and D. B. SzyId, A block ordering method for sparse matrices, SIAM J. Sci. Stat. Comput. 11, 811 (1990).
234. H. L. Ong, Fast approximate solution of large scale sparse linear systems, J. Comput. Appl. Math. 10, 45 (1984).
235. A. Padiy, O. Axelsson, and B. Polman, Generalized augmented matrix preconditioning approach and its application to iterative solution of ill-conditioned algebraic systems, SIAM J. Matrix Anal. Appl. 22, 793 (2001).
236. C. C. Paige and M. A. Saunders, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal. 12, 617 (1975).
237. D. W. Peaceman and H. H. Rachford, Jr., The numerical solution of parabolic and elliptic differential equations, J. Soc. Ind. Appl. Math. 3, 28 (1955).
238. E. L. Poole and J. M. Ortega, Multicolor ICCG methods for vector computers, SIAM J. Numer. Anal. 24, 1394 (1987).
239. Y. Qu and J. Fish, Global-basis two-level method for indefinite systems. Part 2: Computational issues, Int. J. Numer. Methods Eng. 49, 461 (2000).
240. A. Quarteroni and A. Valli, Domain Decomposition Methods for Partial Differential Equations (Clarendon, Oxford, 1999).
241. J. K. Reid, On the method of conjugate gradients for the solution of large sparse systems of linear equations, in Large Sparse Sets of Linear Equations, edited by J. K. Reid, p. 231 (Academic Press, New York, 1971).
242. A. Reusken, A multigrid method based on incomplete Gaussian elimination, Numer. Linear Algebra Appl. 3, 369 (1996).
243. Y. Robert, Regular incomplete factorizations of real positive definite matrices, Linear Algebra Its Appl. 48, 105 (1982).
244. J. W. Ruge and K. Stüben, Algebraic multigrid, in Multigrid Methods, edited by S. F. McCormick, p. 73 (SIAM, Philadelphia, PA, 1987).
245. Y. Saad, Preconditioning techniques for nonsymmetric and indefinite linear systems, J. Comput. Appl. Math. 24, 89 (1988).
246. Y. Saad, Krylov subspace methods on supercomputers, SIAM J. Sci. Stat. Comput. 10, 1200 (1989).
247. Y. Saad, A flexible inner-outer preconditioned GMRES algorithm, SIAM J. Sci. Comput. 14, 461 (1993).
248. Y. Saad, ILUT: A dual threshold incomplete LU factorization, Numer. Linear Algebra Appl. 1, 387 (1994).
249. Y. Saad, Highly parallel preconditioners for general sparse matrices, in Recent Advances in Iterative Methods, edited by G. H. Golub, R. M. Luskin, and A. Greenbaum, p. 165, IMA Volumes in Mathematics and Its Applications, Vol. 60 (Springer-Verlag, New York, 1994).
250. Y. Saad, ILUM: A multi-elimination ILU preconditioner for general sparse matrices, SIAM J. Sci. Comput. 17, 830 (1996).
251. Y. Saad, Iterative Methods for Sparse Linear Systems (PWS Publishing, Boston, 1996).
252. Y. Saad, Finding Exact and Approximate Block Structures for ILU Preconditioning, Technical Report UMSI- 2001-93 (Minnesota Supercomputer Institute, Univ. Minnesota, Minneapolis, 2001).
253. Y. Saad and M. H. Schultz, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Stat. Comput. 7, 856 (1986).
254. Y. Saad and B. Suchomel, ARMS: An algebraic recursive multilevel solver for general sparse linear systems, Numer. Linear Algebra Appl. 9, 359 (2002).
255. Y. Saad and H. A. van der Vorst, Iterative solution of linear systems in the 20th century, J. Comput. Appl. Math. 123, 1 (2000).
256. Y. Saad and J. Zhang, BILUM: Block versions of multielimination and multilevel preconditioner for general sparse linear systems, SIAM J. Sci. Comput. 20, 2103 (1999).
257. Y. Saad and J. Zhang, BILUTM: A domain-based multilevel block ILUT preconditioner for general sparse matrices, SIAM J. Matrix Anal. Appl. 21, 279 (1999).
258. P. Saint-Georges, G. Warzee, Y. Notay, and R. Beauwens, High-performance PCG solvers for FEM structural analyses, Int. J. Numer. Methods Eng. 39, 1133 (1996).
259. P. Saint-Georges, G. Warzee, Y. Notay, and R. Beauwens, Problem-dependent preconditioners for iterative solvers in FE elastostatics, Comput. Struct. 73, 33 (1999).
260. R. B. Schnabel and E. Eskow, A new modified Cholesky factorization, SIAM J. Sci. Stat. Comput. 11, 1136 (1990).
261. J. W. Sheldon, On the numerical solution of elliptic difference equations, Math. Tables Other Aids Comput. 9, 101 (1955).
262. G. L. G. Sleijpen and F. W. Wubs, Exploiting Multilevel Preconditioning Techniques in Eigenvalue Computations, Preprint nr. 1117 (Dep. Mathematics, Univ. Utrecht, Utrecht, The Netherlands, 1999; revised version 2001).
263. S. W. Sloan, An algorithm for profile and wavefront reduction of sparse matrices, Int. J. Numer. Methods Eng. 23, 239 (1986).
264. B. F. Smith, P. E. Bjørstad, and W. D. Gropp, Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations (Cambridge Univ. Press, Cambridge/New York/Melbourne, 1996).
265. R. D. Smith, J. K. Dukowicz, and R. C. Malone, Parallel ocean general circulation modeling, Phys. D 60, 38 (1992).
266. K. Stüben, Algebraic multigrid (AMG): Experiences and comparisons, Appl. Math. Comput. 13, 419 (1983).
267. K. Stüben, A review of algebraic multigrid, J. Comput. Appl. Math. 128, 281 (2001).
268. M. Suaijana and K. H. Law, A robust incomplete factorization based on value and space constraints, Int. J. Numer. Methods Eng. 38, 1703 (1995).
269. D. B. Szyld and J. Vogel, FQMR: A flexible quasi-minimal residual method with inexact preconditioning, SIAM J. Sci. Comput. 23, 363 (2001).
270. W.-P. Tang and W.-L. Wan, Sparse approximate inverse smoother for multigrid, SIAM J. Matrix Anal. Appl. 21, 1236 (2000).
271. M. Tismenetsky, A new preconditioning technique for solving large sparse linear systems, Linear Algebra Its Appl. 154-156, 331 (1991).
272. L. N. Trefethen and D. Ban, III, Numerical Linear Algebra (SIAM, Philadelphia, PA, 1997).
273. U. Trottenberg, C. W. Oosterlee, and A. Schüller, Multigrid (Academic Press, London, 2000).
274. A. M. Turing, Rounding-off errors in matrix processes, Q. J. Mech. Appl. Math. 1, 287 (1948).
275. R. Underwood, An Approximate Factorization Procedure Based on the Block Cholesky Decomposition and Its Use with the Conjugate Gradient Method, Report NEDO- 11386 (General Electric Co., Nuclear Energy Div., San José, CA, 1976).
276. A. van der Ploeg, E. F. F. Botta, and F. W. Wubs, Nested grids ILU-decomposition (NGILU), J. Comput. Appl. Math. 66, 515 (1996).
277. H. A. van der Vorst, Iterative solution methods for certain sparse linear systems with a nonsymmetric matrix arising from PDE-problems, J. Comput. Phys. 44, 1 (1981).
278. H. A. van der Vorst, Large tridiagonal and block tridiagonal linear systems on vector and parallel computers, Parallel Comput. 5, 45 (1987).
279. H. A. van der Vorst, The convergence behaviour of preconditioned CG and CGS in the presence of rounding errors, in Preconditioned Conjugate Gradient Methods, edited by O. Axelsson and L. Yu. Kolotilina, p. 126, Lecture Notes in Mathematics, Vol. 1457 (Springer-Verlag, Berlin, 1990).
280. H. A. van der Vorst, Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of non-symmetric linear systems, SIAM J. Sci. Star. Comput. 12, 631 (1992).
281. R. S. Varga, Factorizations and normalized iterative methods, in Boundary Problems in Differential Equations, edited by R. E. Langer, p. 121 (Univ. Wisconsin Press, Madison, 1960).
282. R. S. Varga, Matrix Iterative Analysis (Prentice-Hall, Englewood Cliffs, NJ, 1962).
283. R. S. Varga, E. B. Saff, and V. Mehrmann, Incomplete factorizations of matrices and connections with H-matrices, SIAM J. Numer. Anal. 17, 787 (1980).
284. P. S. Vassilevski, A block-factorization (algebraic) formulation of multigrid and Schwarz methods, East-West J. Numer. Math. 6, 65 (1998).
285. C. Vuik, R. P. van Nooyen, and P. Wesseling, Parallelism in ILU-preconditioned GMRES, Parallel Comput. 24, 1927 (1998).
286. E. Wachspress, Iterative Solution of Elliptic Systems and Applications to the Neutron Diffusion Equations of Reactor Physics (Prentice-Hall, Englewood Cliffs, NJ, 1966).
287. 1 equations in two-dimensional Cartesian geometry with two-level preconditioning, SIAM J. Sci. Comput., in press.
288. J. W. Watts, III, A conjugate gradient truncated direct method for the iterative solution of the reservoir simulation pressure equation, Soc. Petrol. Eng. J. 21, 345 (1981).
289. R. Weiss, Parameter-Free Iterative Linear Solvers, Mathematical Research, Vol. 97 (Akademie, Berlin, 1996).
290. G. Wittum, On the robustness of ILU-smoothing, SIAM J. Sci. Stat. Comput. 10, 699 (1989).
291. P. H. Worley, Limits on parallelism in the numerical solution of linear PDEs, SIAM J. Sci. Stat. Comput. 12, 1 (1991),
292. K. Wu, Y. Saad, and A. Stathopoulos, Inexact Newton preconditioning techniques for large symmetric eigenvalue problems, Electron. Trans. Numer. Anal. 7, 202 (1998).
293. D. M. Young, Iterative Methods for Solving Partial Difference Equations of Elliptic Type, Ph.D. thesis (Harvard University, Cambridge, MA, 1950).
294. D. M. Young, Iterative Solution of Large Linear systems (Academic Press, New York, 1971).
295. J. Zhang, Sparse approximate inverse and multilevel block ILU preconditioning techniques for general sparse matrices, Appl. Numer. Math. 35, 67 (2000).
296. J. Zhang, A multilevel dual reordering strategy for robust incomplete LU factorization of indefinite matrices, SIAM J. Matrix Anal. Appl. 22, 925 (2001).