Adaptive amg with coarsening based on compatible weighted matching

Computing and Visualization in Science

Volumn 16, Issue 2, 2013, Pages 59-76

  D’Ambra, Pasqua ^a   Vassilevski, Panayot S ^b  

^a CNR   (Italy)

^b LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

Author keywords

Adaptive AMG; Compatible relaxation; Strength of connection; Weighted matching

Indexed keywords

COARSENING; GRAPH ALGORITHMS; LINEAR SYSTEMS; OSTWALD RIPENING; PARTIAL DIFFERENTIAL EQUATIONS;

ADAPTIVE AMG; COMPATIBLE RELAXATION; ELLIPTIC PARTIAL DIFFERENTIAL EQUATION; FINITE-ELEMENT DISCRETIZATION; STRENGTH OF CONNECTION; SYMMETRIC POSITIVE DEFINITE LINEAR SYSTEMS; SYSTEMS OF LINEAR EQUATIONS; WEIGHTED MATCHING;

ALGEBRA;

EID: 84914704576     PISSN: 14329360     EISSN: 14330369     Source Type: Journal    
DOI: 10.1007/s00791-014-0224-9     Document Type: Article

References (30)

1. Baker, A.H., Falgout, R.D., Kolev, T.V., Yang, U.M.: Multigrid smoothers for ultra-parallel computing. SIAM J. Sci. Comput. 33, 2864–2887 (2011)
2. Brandt, A.: General highly accurate algebraic coarsening. Elect. Trans. Num. Anal. 10, 1–20 (2000)
3. Brandt, A.: Multiscale scientific computation: review 2001. In: Barth, T.J., Chan, T.F., Haimes, R. (eds.) Multiscale and Multires-olution Methods: Theory and Applications, pp. 1–96. Springer, Heidelberg (2001)
4. Brandt, A., Brannick, J., Kahl, K., Livshitz, I.: Bootstrap AMG. SIAM J. Sci. Comput. 33, 612–632 (2011)
5. Brandt, A., McCormick, S., Ruge, J.: Algebraic multigrid (AMG) for sparse matrix equations. In: D. J. Evans (ed.) Sparsity and its Applications (1984)
6. Brannick, J., Falgout, R.D.: Compatible relaxation and coarsening in algebraic multigrid. SIAMJ. Sci. Comput.32, 1393–1416 (2010)
7. Brannick, J., Chen, Y., Kraus, J., Zikatanov, L.: Algebraic multilevel preconditioners for the graph Laplacian based on matching in graphs. SIAM J. Num. Anal. 51, 1805–1827 (2013)
8. Brezina, M., Falgout, R.D., MacLachlan, S., Manteuffel, T., McCormick, S., Ruge, J.: Adaptive smoothed aggregation α SA multigrid. SIAM Rev. 47, 317–346 (2005)
9. Brezina, M., Falgout, R.D., MacLachlan, S., Manteuffel, T., McCormick, S., Ruge, J.: Adaptive algebraic multigrid. SIAM J. Sci. Comput. 27, 1261–1286 (2006)
10. Diestel R.: Graph Theory. Springer, Heidelberg, GTM 173, 4th ed. (2010)
11. Drake, D.E., Hougardy, S.: A linear time approximation algorithm for weighted matchings in graphs. ACM Trans. Algorit. 11, 107–122 (2005)
12. Duff, I.S., Koster, J.: On algorithms for permuting large entries to the diagonal of a sparse matrix. SIAM J. Matrix Anal. Appl. 22, 973–996 (2001)
13. Duff, I.S., Uçar, B.: Combinatorial Problems in Solving Linear Systems, Rutherford Appleton Laboratory Technical Report RAL-TR-2008-014 and TR/PA/08/26, CERFACS, Toulouse
14. Falgout, R.D., Vassilevski, P.S.: On generalizing the AMG framework. SIAM J. Num. Anal. 42, 1669–1693 (2004)
15. Halappanavar, M., Feo, J., Villa, O., Tumeo, A., Pothen, A.: Approximate weighted matching on emerging manycore and multithreaded architectures. Int. J. High Perform. Comput. Appl. first published on August 9, 2012 as doi:10.1177/1094342012452893
16. HSL(2011). A Collection of Fortran Codes for Large Scale Scientific Computation. http://www.hsl.rl.ac.uk
17. Hypre: High Performance Preconditioners.http://www.llnl.gov/ CASC/hypre/
18. Karypis, G.: METIS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices, Ver. 5.1.0, University of Minnesota, (2013)
19. Kolev, T. V., Vassilevski, P. S.: Parallel Auxiliary Space AMG for H(curl) problem. J. Comput. Math. 27, 604–623 (2009). Special issue on Adaptive and Multilevel Methods in Electromagnetics. UCRL-JRNL-237306
20. Lashuk, I., Vassilevski, P.S.: On some versions of the element agglomeration AMGe method. Num. Linear Alg. Appl. 15, 595–620 (2008)
21. Livne, O.E.: Coarsening by compatible relaxation. Num. Linear Alg. Appl. 11, 205–227 (2004)
22. Manne, F., Bisseling, R.H.: A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem, in PPAM 2007, LNCS, vol. 4967, pp. 708–717. Springer, Berlin (2008)
23. Nägel, A., Falgout, R.D., Wittum, G.: Filtering algebraic multigrid and adaptive strategies. Comput. Vis. Sci. 11, 150–167 (2008)
24. Notay, Y.:An aggregation-based algebraic multigrid method. Elect. Trans. Num. Anal. 37, 123–146 (2010)
25. Napov, A., Notay, Y.: An algebraic multigrid method with guaranteed convergence rate. SIAM J. Sci. Comput. 34, A1079–A1109 (2012)
26. Olschowka, M., Neumaier, A.: A new pivoting strategy for Gaussian elimination. Linear Alg. Appl. 240, 131–151 (1996)
27. Parter, S.: The use of linear graphs in Gaussian elimination. SIAM Rev. 3, 119–130 (1961)
28. Preis, R.: Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs, in STACS’99. LNCS vol. 1563, pp 259–269. Springer, Berlin (1999)
29. Vaneˇk, P., Mandel, J., Brezina, M.: Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems. Computing 56, 179–196 (1996)
30. Vassilevski, P.S.: Multilevel Block Factorization Preconditioners, Matrix-based Analysis and Algorithms for Solving Finite Element Equations. Springer, New York, NY (2008)