Parallel hybrid preconditioning: Incomplete factorization with selective sparse approximate inversion

SIAM Journal on Scientific Computing

Volumn 32, Issue 3, 2010, Pages 1323-1345

  Raghavan, Padma ^a   Teranishi, Keita ^a,b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b CRAY INC   (United States)

Author keywords

Numerical linear algebra; Parallel computing; Preconditioning; Sparse matrix computation

Indexed keywords

FACTORIZATION; LINEAR SYSTEMS; MATRIX ALGEBRA;

APPROXIMATE INVERSION; INCOMPLETE FACTORIZATION; LARGE SPARSE LINEAR SYSTEMS; NUMERICAL LINEAR ALGEBRA; PARALLEL COM- PUTING; PARALLEL HYBRIDS; PARALLEL PRECONDITIONING; PRECONDITIONERS; PRECONDITIONING; SPARSE MATRIX COMPUTATIONS;

PARALLEL PROCESSING SYSTEMS;

EID: 77953852422     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/080739987     Document Type: Article

References (67)

1. P. R. Amestoy, I. S. Duff, and J.-Y. L'Excellent, Multifrontal parallel distributed symmetric and unsymmetric sparse solvers, Comput. Methods Appl. Mech. Engrg., (2000), pp. 501-520.
2. C. Ashcraft, S. C. Eisenstat, and J. W. H. Liu, A fan-in algorithm for distributed sparse numerical factorization, SIAM J. Sci. Statist. Comput., 11 (1990), pp. 593-599.
3. H. Avron, D. Chen, G. Shklarski, and S. Toledo, Combinatorial preconditioners for scalar elliptic finite-element problems, SIAM J. Matrix Anal. Appl., 31 (2009), pp. 694-720.
4. O. Axelsson, Iterative Solution Methods, Cambridge University Press, Cambridge, UK, 1994.
5. S. Balay, W. D. Gropp, L. C. McInnes, and B. F. Smith, Efficient management of parallelism in object oriented numerical software libraries, in Modern Software Tools in Scientific Computing, E. Arge, A. M. Bruaset, and H. P. Langtangen, eds., Birkhäuser, Boston, 1997, pp. 163-202.
6. S. Balay, W. D. Gropp, L. C. McInnes, and B. F. Smith, PETSc Users Manual, Tech. Rep. ANL-95/11-Revision 2.1.1, Argonne National Laboratories, Argonne, IL, 2002.
7. R. Barrett, M.W. 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.
8. M. Benzi, C. D. Meyer, and M. Tůma, A sparse approximate inverse preconditioner for the conjugate gradient method, SIAM J. Sci. Comput., 17 (1996), pp. 1135-1149.
9. M. Bollhöfer and Y. Saad, ILUPACK-Preconditioning Software Package, Release V1.0, 2004; available online from http://www.math.tu-berlin.de/ilupack/.
10. M. Brezina, C. Tong, and R. Becker, Parallel algebraic multigrids for structural mechanics, SIAM J. Sci. Comput., 27 (2006), pp. 1534-1554.
11. W. L. Briggs, V. E. Henson, and S. F. McCormick, A Multigrid Tutorial, 2nd ed., SIAM, Philadelphia, PA, 2000.
12. R. Chandra, S. Eisenstat, and M. Schultz, The modified conjugate residual method for partial differential equations, in Advances in Computer Methods for Partial Differential Equations. II, R. Vichnevetsky, ed., IMACS, New Brunswick, NJ, 1977, pp. 13-19.
13. E. Chow and Y. Saad, Robust Preconditioning for Sparse Linear Systems, Ph.D. thesis, Department of Computer Science, University of Minnesota, Minneapolis, MN, 1997.
14. E. Chow, ParaSails User's Guide, Tech. Rep. UCRL-MA-137863, Lawrence Livermore National Laboratory, Livermore, CA, 2000.
15. E. Chow, Parallel implementation and practical use of sparse approximate inverse preconditioners with a priori sparsity patterns, Int. J. High Perf. Comput. Appl., 15 (2001), pp. 56-74.
16. E. Chow, R. D. Falgout, J. J. Hu, R. S. Tuminaro, and U. M. Yang, A survey of parallelization techniques for multigrid solvers, in Parallel Processing for Scientific Computing, M. A. Heroux, P. Raghavan, and H. D. Simon, eds., SIAM, Philadelphia, PA, 2006, pp. 179-201.
17. E. Chow and Y. Saad, Approximate inverse preconditioners via sparse-sparse iterations, SIAM J. Sci. Comput., 19 (1998), pp. 995-1023.
18. A. J. Cleary, R. D. Falgout, V. E. Henson, J. E. 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 (2000), pp. 1886-1908.
19. P. Concus, G. Golub, and D. O'leary, A generalized conjugate gradient method for the numerical solution of elliptic partial differential equations, in Sparse Matrix Computations, J. R. Bunch and D. J. Rose, eds., Academic Press, New York, 1976, pp. 309-332.
20. J. D. F. Cosgrove, J. C. Diaz, and A. Griewank, Approximate inverse preconditionings for sparse linear systems, Internat. J. Comput. Math., 44 (1992), pp. 91-110.
21. T. Davis, University of Florida Sparse Matrix Collection, http://www.cise.ufl.edu/research/ sparse/matrices/.
22. J. Demmel, S. C. Eisenstat, J. R. Gilbert, X. S. Li, and J. W. H. Liu, A Supernodal Approach to Sparse Partial Pivoting, Tech. Rep. CSL-94-114, Xerox Palo Alto Research Center, Palo Alto, CA, 1995.
23. J. W. Demmel, Applied Numerical Linear Algebra, SIAM, Philadelphia, PA, 1997.
24. H. De Sterck, U. M. Yang, and J. J. Heys, Reducing complexity in parallel algebraic multigrid preconditioners, SIAM J. Matrix Anal. Appl., 27 (2006), pp. 1019-1039.
25. 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.
26. I. S. Duff, A. M. Erisman, and J. K. Reid, Direct Methods for Sparse Matrices, Oxford University Press, Oxford, UK, 1986.
27. S. C. Eisenstat, M. T. Heath, C. S. Henkel, and C. H. Romine, Modified cyclic algorithms for solving triangular systems on distributed-memory multiprocessors, SIAM J. Sci. Statist. Comput., 9 (1988), pp. 589-600.
28. A. Ern, V. Giovangigli, D. E. Keyes, and M. D. Smooke, Towards polyalgorithmic linear system solvers for nonlinear elliptic problems, SIAM J. Sci. Comput., 15 (1994), pp. 681-703.
29. R. D. Falgout and U. M. Yang, Hypre: A Library of High Performance Preconditioners, in Computational Science -ICCS 2002, Part III, P. Sloot, C. Tan, J. Dongarra, and A. Hoekstra, eds., Lecture Notes in Comput. Sci. 2331, Springer-Verlag, Berlin, 2002, pp. 632-641.
30. A. George, Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal., 10 (1973), pp. 345-363.
31. A.George, M. T. Heath, J. Liu, and E. Ng, Sparse Cholesky factorization on a local-memory multiprocessor, SIAM J. Sci. Statist. Comput., 9 (1988), pp. 327-340.
32. A. George and J. W. H. Liu, The evolution of the minimum degree ordering algorithm, SIAM Rev., 31 (1989), pp. 1-19.
33. A. George and J. W. H. Liu, An automatic nested dissection algorithm for irregular finite element problems, SIAM J. Numer. Anal., 15 (1978), pp. 1053-1069.
34. A. George and J. W.-H. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
35. G. Golub and C. Van Loan, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996.
36. G. H. Golub and D. P. O'Leary, Some history of the conjugate gradient and Lanczos methods: 1948-1976, SIAM Rev., 31 (1989), pp. 50-102.
37. A. Grama, A. Gupta, G. Karypis, and V. Kumar, Introduction to Parallel Computing, 2nd ed., Addison-Wesley, Reading, MA, 2003.
38. A. Greenbaum and Z. Strakos, Predicting the behavior of finite precision Lanczos and conjugate gradient computations, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 121-137.
39. M. J. Grote and T. Huckle, Parallel preconditioning with sparse approximate inverses, SIAM J. Sci. Comput., 18 (1997), pp. 838-853.
40. V. Henson and U. Yang, BoomerAMG: A parallel algebraic multigrid solver and preconditioner, Appl. Numer. Math., 41 (2002), pp. 151-177.
41. M. R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Standards, 49 (1952), pp. 409-436.
42. M. Jones and P. Plassmann, The efficient parallel iterative solution of large sparse linear systems, in Graph Theory and Sparse Matrix Computations, A. George, J. R. Gilbert, and J. W. H. Liu, eds., IMA Vol. Math. Appl. 56, Springer-Verlag, New York, 1994, pp. 229-245.
43. M. T. Jones and P. E. Plassmann, Blocksolve95 Users Manual: Scalable Library Software for the Parallel Solution of Sparse Linear Systems, Tech. Rep. ANL-95/48, Argonne National Laboratory, Argonne, IL, 1995.
44. G. Karypis and V. Kumar, ParMETIS: Parallel Graph Partitioning and Sparse Matrix Ordering Library, Tech. Rep. TR 97-1060, Department of Computer Science, University of Minnesota, 1997.
45. L. Y. Kolotilina and A. Y. Yeremin, Factorized sparse approximate inverse preconditionings I. Theory, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 45-58.
46. R. J. Lipton, D. J. Rose, and R. E. Tarjan, Generalized nested dissection, SIAM J. Numer. Anal., 16 (1979), pp. 346-358.
47. J. W. H. Liu, E. G. Ng, and B. W. Peyton, On finding supernodes for sparse matrix computation, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 242-252.
48. D. Luenberger, Introduction to Linear and Nonlinear Programming, 2nd ed., Addison-Wesley, Reading, MA, 1984.
49. K. Malkowski and P. Raghavan, Multi-pass mapping schemes for parallel sparse matrix computation, in Proceedings of the 5th International Conference of Computational Science (ICCS2005), V. S. Sunderam, G. D. van Albada, P. M. A. Sloot, and J. J. Dongarra, eds., Lecture Notes in Comput. Sci. 3514, Springer-Verlag, Berlin, 2005, pp. 245-255.
50. T. A. Manteuffel, An incomplete factorization technique for positive definite linear systems, Math. Comp., 34 (1980), pp. 473-497.
51. 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. Comp., 31 (1977), pp. 148-162.
52. N. Munksgaard, Solving sparse symmetric sets of linear equations by preconditioned conjugate gradients, ACM Trans. Math. Software, 6 (1980), pp. 206-219.
53. K. Nakajima, Parallel iterative solvers of geofem with selective blocking preconditioning for nonlinear contact problems on the earth simulator, in Proceedings of SC2003: High Performance Networking and Computing, 2003; http://www.sc-conference.org/sc2003/.
54. E. Ng, B. Peyton, and P. Raghavan, A blocked incomplete Cholesky preconditioner for hierarchical-memory computers, in Proceedings of the 4th IMACS International Symposium on Iterative Methods in Scientific Computation, D. R. Kincaid and A. C. Elster, eds., IMACS Ser. Comput. Appl. Math. 5, 1999, pp. 211-221.
55. E. G. Ng and B. W. Peyton, Block sparse Cholesky algorithms on advanced uniprocessor computers, SIAM J. Sci. Comput., 14 (1993), pp. 1034-1056.
56. E. G. Ng and P. Raghavan, Towards a scalable hybrid sparse solver, Concurrency: Practice and Experience, 12 (2000), pp. 1-16.
57. A. Pothen and C. Sun, A mapping algorithm for parallel sparse Cholesky factorization, SIAM J. Sci. Comput., 14 (1993), pp. 1253-1257.
58. P. Raghavan, Efficient parallel triangular solution using selective inversion, Parallel Process. Lett., 9 (1998), pp. 29-40.
59. P. Raghavan, DSCPACK: Domain-Separator Codes for Solving Sparse Linear Systems, Tech. Rep. CSE-02-004, Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA, 2002.
60. P. Raghavan, K. Teranishi, and E. G. Ng, A latency tolerant hybrid sparse solver using incomplete Cholesky factorization, Numer. Linear Algebra Appl., 10 (2003), pp. 541-560.
61. Y. Saad, ILUT: A dual threshold incomplete factorization, Numer. Linear Algebra. Appl., 1 (1994), pp. 387-402.
62. Y. Saad, Iterative Method for Sparse Linear Systems, 2nd ed., SIAM, Philadelphia, PA, 2003.
63. A. V. D. Sluis and H. A. van der Vorst, The rate of convergence of conjugate gradients, Numer. Math., 48 (1986), pp. 543-560.
64. K. Teranishi, Scalable Hybrid Sparse Linear Solvers, Ph.D. thesis, Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA, 2004.
65. K. Teranishi, P. Raghavan, and E. Ng, A new data-mapping scheme for latency-tolerant distributed sparse triangular solution, in Proceedings of the 2002 ACM/IEEE Conference on Supercomputing, 2002, pp. 238-247.
66. R. Tuminaro, M. Heroux, S. Hutchinson, and J. Shadid, Official Aztec User's Guide: Version 2.1, Tech. Rep. SAND99-8801, Sandia National Laboratories, 1999.
67. Z. Zlatev, Use of iterative refinement in the solution of sparse linear systems, SIAM J.Numer. Anal., 19 (1982), pp. 381-399.