Matrix reordering using multilevel graph coarsening for ILU preconditioning

SIAM Journal on Scientific Computing

Volumn 37, Issue 1, 2015, Pages A391-A419

  Osei Kuffuor, Daniel ^a   Li, Ruipeng ^b   Saad, Yousef ^b  

^a LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

^b University of Minnesota   (United States)

Author keywords

Algebraic preconditioners; ILU preconditioners; Incomplete factorization preconditioners; Multilevel graph coarsening; Sparse matrix reordering

Indexed keywords

COARSENING; ITERATIVE METHODS; LINEAR SYSTEMS; LOWER-UPPER DECOMPOSITION; OSTWALD RIPENING;

ALGEBRAIC PRECONDITIONER; GRAPH COARSENING; INCOMPLETE FACTORIZATION PRECONDITIONERS; INCOMPLETE LU FACTORIZATION PRECONDITIONER; LU FACTORIZATION; MATRIX REORDERING; MULTILEVEL GRAPH COARSENING; MULTILEVELS; PRECONDITIONERS; SPARSE MATRICES; SPARSE MATRIX REORDERING;

FACTORIZATION;

EID: 84923873648     PISSN: 10648275     EISSN: 10957197     Source Type: Journal    
DOI: 10.1137/130936610     Document Type: Article

References (76)

1. P. AMESTOY, T. A. DAVIS, AND I. S. DUFF, An approximate minimum degree ordering algorithm, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 886-905.
2. O. AXELSSON, A generalized SSOR method, BIT, 12 (1972), pp. 443-467.
3. O. AXELSSON AND P. VASSILEVSKI, Algebraic multilevel preconditioning methods. I, Numer. Math., 56 (1989), pp. 157-177.
4. R. E. BANK AND C. WAGNER, Multilevel ILU decomposition, Numer. Math., 82 (1999), pp. 543-576.
5. R. E. BANK, Compatible coarsening in the multigraph algorithm, Adv. Engrg. Software, 38 (2007), pp. 287-294.
6. M. BENZI, J. C. HAWS, AND M. TUMA, Preconditioning Highly Indefinite and Nonsymmetric Matrices, SIAM J. Sci. Comput., 22 (2000), pp. 1333-1353.
7. M. BENZI, D. SZYLD, AND A. VAN DUIN, Orderings for incomplete factorization preconditioning of nonsymmetric problems, SIAM J. Sci. Comput., 20 (1999), pp. 1652-1670.
8. M. BOLLHÖFER, A robust ILU with pivoting based on monitoring the growth of the inverse factors, Linear Algebra Appl., 338 (2001), pp. 201-213.
9. M. BOLLHÖFER, M. J. GROTE, AND O. SCHENK, Algebraic multilevel preconditioner for the Helmholtz equation in heterogeneous media, SIAM J. Sci. Comput., 31 (2009), pp. 3781-3805.
10. E. BOTTA, A. PLOEG, AND F. WUBS, Nested grids ILU-decomposition (NGILU), J. Comput. Appl. Math., 66 (1996), pp. 515-526.
11. E. BOTTA AND F. WUBS, Matrix renumbering ILU: An effective algebraic multilevel ILU, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 1007-1026.
12. A. BRANDT, Generally highly accurate algebraic coarsening, Electron. Trans. Numer. Anal., 10 (2000), pp. 1-20.
13. A. BRANDT, S. F. MC CORMICK, AND J. RUGE, Algebraic multigrid (AMQ) for sparse matrix equations, in Sparsity and its Applications, D. J. Evans, ed., Cambridge University Press, Cambridge, 1984.
14. J. BRANNICK, M. BREZINA, S. MACLACHLAN, T. MANTEUFFEL, S. MCCORMICK, AND J. RUGE, An energy-based AMG coarsening strategy, Numer. Linear Algebra Appl., 13 (2006), pp. 133-148.
15. J. BRANNICK, Y. CHEN, J. KRAUS, AND L. ZIKATANOV, Algebraic multilevel preconditioners for the graph Laplacian based on matching in graphs, SIAM J. Numer. Anal., 51 (2013), pp. 1805-1827.
16. J. BRANNICK AND R. FALGOUT, Compatible relaxation and coarsening in algebraic multigrid, SIAM J. Sci. Comput., 32 (2010), pp. 1393-1416.
17. R. BRIDSON AND W.-P. TANG, Ordering, anisotropy, and factored approximate inverses, SIAM J. Sci. Comput., 21 (1999), pp. 867-882.
18. R. BRIDSON AND W.-P. TANG, A structural diagnosis of some IC orderings, SIAM J. Sci. Comput., 22 (2000), pp. 1527-1532.
19. W. L. BRIGGS, V. E. HENSON, AND S. F. MC CORMICK, A Multigrid Tutorial, 2nd ed., SIAM, Philadelphia, 2000.
20. A. M. BRUASET, A. TVEITO, AND R. WINTHER, On the stability of relaxed incomplete LU factorizations, Math. Comput., 54 (1990), pp. 701-719.
21. N. BULEEV, A numerical method for the solution of two-dimensional and three-dimensional equations of diffusion, Math. Sb., 51 (1960), pp. 227-238.
22. K. CHEN, Matrix Preconditioning Techniques and Applications, Cambridge University Press, Cambridge, UK, 2005.
23. T. CHAN AND H. ELMAN, Fourier analysis of iterative methods for elliptic problems, SIAM Rev., 31 (1989), pp. 20-49.
24. J. CHEN AND I. SAFRO, Algebraic distance on graphs, SIAM J. Sci. Comput., 33 (2011), pp. 3468-3490.
25. E. CHOW AND P. S. VASSILEVSKI, Multilevel block factorizations in generalized hierarchical bases, Numer. Linear Algebra Appl., 1 (2002), pp. 1-22.
26. 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 (1992), pp. 944-961.
27. S. DOI AND A. HOSHI, Large numbered multicolor MILU preconditioning on SX- 3/14, Int. J. Comput. Math., 44 (1992), pp. 143-152.
28. I. S. DUFF, A. M. ERISMAN, AND J. K. REID, Direct Methods for Sparse Matrices, Oxford University Press, New York, 1986.
29. I. S. DUFF AND J. KOSTER, On algorithms for permuting large entries to the diagonal of a sparse matrix, SIAM J. Numer. Anal., 22 (2001), pp. 973-996.
30. I. DUFF AND G. MEURANT, The effect of ordering on preconditioned conjugate gradients, BIT, 29 (1989), pp. 635-657.
31. T. DUPONT, R. KENDALL, AND H. RACHFORD, An approximate factorization procedure for solving self-adjoint elliptic difference equations, SIAM J. Numer. Anal., 5 (1968), pp. 559-573.
32. H. C. ELMAN, A stability analysis of incomplete LU factorizations, Math. Comp., 47 (1986), pp. 191-217.
33. R. FALGOUT AND P. VASSILEVSKI, On generalizing the AMG framework, SIAM J. Numer. Anal., 42 (2005), pp. 1669-1693.
34. A. GEORGE, Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal., 10 (1973), pp. 345-363.
35. A. GEORGE AND J. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice- Hall, Englewood Cliffs, NJ, 1981.
36. A. GEORGE AND J. LIU, Evolution of the minimum degree ordering algorithm, SIAM Rev., 31 (1989), pp. 1-19.
37. I. GUSTAFSSON, A class of first order factorization methods, BIT, 18 (1978), pp. 142-156.
38. W. HACKBUSCH, Multi-Grid Methods and Applications, Springer Ser. Comput. Math., Springer-Verlag, Berlin, 1985.
39. Y. F. HU AND R. J. BLAKE, Load Balancing for Unstructured Mesh Applications, Nova Science Publishers, Commack, NY, 2001, pp. 117-148.
40. G. KARYPIS AND V. KUMAR, Multilevel graph partitioning schemes, in Proceedings of the 24th International Conference on Parallel Processing, III, CRC Press, Boca Raton, FL, 1995, pp. 113-122.
41. G. KARYPIS AND V. KUMAR, METIS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices, Version 4.0. 1, University of Minnesota, Army HPC Research Center, Minneapolis, 1998.
42. R. KECHROUD, A. SOULAIMANI, Y. SAAD, AND S. GOWDA, Preconditioning techniques for the solution of the Helmholtz equation by the finite element method, Math. Comput. Simulation, 65 (2004), pp. 303-321.
43. O. LIVNE, Coarsening by compatible relaxation, Numer. Linear Algebra Appl., 11 (2004), pp. 205-227.
44. S. MACLACHLAN, D. OSEI-KUFFUOR, AND Y. SAAD, Modification and compensation strategies for threshold-based incomplete factorizations, SIAM J. Sci. Comput., 34 (2012), pp. 48-75.
45. S. MACLACHLAN AND Y. SAAD, Greedy coarsening strategies for nonsymmetric problems, SIAM J. Sci. Comput., 29 (2007), pp. 2115-2143.
46. S. MACLACHLAN AND Y. SAAD, A greedy strategy for coarse-grid selection, SIAM J. Sci. Comput., 29 (2007), pp. 1825-1853.
47. M. MAGOLU MONGA MADE, R. BEAUWENS, AND G. WARZEE, Preconditioning of discrete Helmholtz operators perturbed by a diagonal complex matrix, Commun. Numer. Methods Engrg., 16 (2000), pp. 801-817.
48. T. A. MANTEUFFEL, Shifted incomplete Cholesky factorization, in Sparse Matrix 1978: Proceedings, SIAM, Philadelphia, 1979, pp. 41-61.
49. 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.
50. MFEM: Modular Parallel Finite Element Methods, Library, http://mfem.googlecode.com.
51. N. MUNKSGAARD, Solving sparse symmetric sets of linear equations by preconditioned conjugate gradient method, ACM Trans. Math. Software, 6 (1980), pp. 206-219.
52. A. C. MURESAN AND Y. NOTAY, Analysis of aggregation-based multigrid, SIAM J. Sci. Comput., 30 (2008), pp. 1082-1103.
53. Y. NOTAY, DRIC: A dynamic version of the RIC method, Numer. Linear Algebra Appl., 1 (1994), pp. 511-532.
54. Y. NOTAY, An aggregation-based algebraic multigrid method, Electron. Trans. Numer. Anal., 37 (2010), pp. 123-146.
55. T. OLIPHANT, An implicit numerical method for solving two-dimensional time-dependent diffusion problems, Quart. Appl. Math., 19 (1961), pp. 221-229.
56. M. OLSCHOWKA AND A. NEUMAIER, A new pivoting strategy for Gaussian elimination, Numer. Linear Algebra Appl., 240 (1996), pp. 131-151.
57. D. OSEI-KUFFUOR AND Y. SAAD, Preconditioning Helmholtz linear systems, Appl. Numer. Math., 60 (2009), pp. 420-431.
58. D. RON, I. SAFRO, AND A. BRANDT, Relaxation-based coarsening and multiscale graph organization, Multiscale Model. Simul., 9 (2011), pp. 407-423.
59. D. J. ROSE, A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, in Graph Theory and Computing, R. C. Read, ed., Academic Press, New York, 1972, pp. 183-217.
60. A. RUGE AND K. STÜBEN, Algebraic multigrid, in Multigrid Methods, S. McCormick, ed., Frontiers Appl. Math. 3, SIAM, Philadelphia, 1987.
61. Y. SAAD, A flexible inner-outer preconditioned GMRES algorithm, SIAM J. Sci. Stat. Comput., 14 (1993), pp. 461-469.
62. Y. SAAD, ILUT: A dual threshold incomplete ILU factorization, Numer. Linear Algebra Appl., 1 (1994), pp. 387-402.
63. Y. SAAD, ILUM: A multi-elimination ILU preconditioner for general sparse matrices, SIAM J. Sci. Comput., 17 (1996), pp. 830-847.
64. Y. SAAD, Iterative Methods for Sparse Linear Systems, 2nd ed., SIAM, Philadelpha, 2003.
65. Y. SAAD, Multilevel ILU with reorderings for diagonal dominance, SIAM J. Sci. Comput., 27 (2005), pp. 1032-1057.
66. Y. SAAD AND B. SUCHOMEL, ARMS: An algebraic recursive multilevel solver for general sparse linear systems, Numer. Linear Algebra Appl., 9 (2002).
67. J. SCHÖBERL, NETGEN An advancing front 2D/3D-mesh generator based on abstract rules, Comput. Vis. Sci., 1 (1997), pp. 41-52.
68. J. SCHÖBERL, J. GERSTMAYR, AND R. GAISBAUER, NETGEN - Automatic 3D Tetrahedral Mesh Generator, http://www.hpfem.jku.at/netgen/ (2003).
69. J. B. SCHRODER, Smoothed aggregation solvers for anisotropic diffusion, Numer. Linear Algebra Appl., 19 (2012), pp. 296-312.
70. W. F. TINNEY AND J. W. WALKER, Direct solution of sparse network equations by optimally ordered triangular factorization, Proc. IEEE, 55 (1967), pp. 1801-1809.
71. U. TROTTENBERG, C. OOSTERLEE, AND A. SCHÜLLER, Multigrid, Academic Press, San Diego, 2001.
72. P. VANĚK, M. BREZINA, AND J. MANDEL, Convergence of algebraic multigrid based on smoothed aggregation, Numer. Math., 88 (2001), pp. 559-579.
73. P. VANĚK, J. MANDEL, AND M. BREZINA, Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems, Computing, 56 (1996), pp. 179-196.
74. H. VAN DER VORST, The convergence behaviour of preconditioned CG and CGS in the presence of rounding errors, in Preconditioned Conjugate Gradient Methods, O. Axelsson and L. Kolotilina, eds., Lecture Notes in Math. 1457, Springer-Verlag, Berlin, 1990.
75. R. VARGA, Factorization and normalized iterative methods, in Boundary Problems in Differential Equations, R. Langer, ed., University of Wisconsin Press, Madison, 1960, pp. 121-142.
76. J. W. WATTS III, A conjugate gradient truncated direct method for the iterative solution of the reservoir simulation pressure equation, Soc. Petroleum Engineers J., 21 (1981), pp. 345-353.