AMGe - Coarsening strategies and application to the oseen equations

SIAM Journal on Scientific Computing

Volumn 27, Issue 6, 2006, Pages 2077-2097

  Wabro, Markus ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

AMG; AMGe; Convection diffusion equations; Mixed problems; Oseen equations

Indexed keywords

ALGEBRA; DISTRIBUTED COMPUTER SYSTEMS; FINITE ELEMENT METHOD; NUMERICAL METHODS; PROBLEM SOLVING; TOPOLOGY;

ALGEBRAIC MULTIGRID (AMG); ALGEBRAIC MULTIGRID METHOD BASED ON ELEMENT INTERPOLATION (AMGE); CONVECTION-DIFFUSION EQUATIONS; MIXED PROBLEMS; OSEEN EQUATIONS;

NAVIER STOKES EQUATIONS;

EID: 33750712884     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/040610350     Document Type: Article

References (23)

1. D. BRAESS, Finite Elements, 2nd ed., Cambridge University Press, Cambridge, UK, 2001.
2. D. BRAESS AND R. SARAZIN, An efficient smoother for the Stokes problem, Appl. Numer. Math., 23 (1997), pp. 3-20.
3. A. BRANDT, S. MCCORMICK, AND J. RUGE, Algebraic multigrid (AMG) for sparte matrix equations, in Sparsity and Its Applications, D. Evans, ed., Cambridge University Press, Cambridge, UK, 1984, pp. 257-284.
4. M. BREZINA, A. J. CLEARY, R. D. FALGOUT, V. E. HENSON, J. E. JONES, T. A. MANTEUFPEL, S. F. MCCORMICK, AND J. W. RUGE, Algebraic multigrid based on element interpolation (AMGe), SIAM J. Sci. Comput., 22 (2000), pp. 1570-1592.
5. F. BREZZI AND M. FORTIN, Mixed and Hybrid Finite Element Methods, Springer Ser. Comput. Math., Springer, New York, 1991.
6. M. FORTIN, An analysis of the convergence of mixed finite element methods, RAIRO Anal. Numér., 11 (1977), pp. 341-354.
7. V. HENSON AND P. S. VASSILEVSKI, Element-free AMGe: General algorithms for computing interpolation weights in AMG, SIAM J. Sci. Comput., 23 (2001), pp. 629-650.
8. J. E. JONES AND P. S. VASSILEVSKI, AMGe based on element agglomeration, SIAM J. Sci. Comput., 23 (2001), pp. 109-133.
9. G. KARYPIS AND V. KUMAR, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Comput., 20 (1998), pp. 359-392.
10. G. KARYPIS AND V. KUMAR, METIS - A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices, University of Minnesota, 1998; also available online from www-users.cs.umn.edu/karypis/metis/.
11. I. MOULITSAS AND G. KARYPIS, MGridGen/ParMGridGen - Serial/Parallel Library for Generating Coarse Grids for Multigrid Methods, University of Minnesota, 2001; also available online at www-users.cs.umn.edu/~moulitsa/ software.html.
12. I. MOULITSAS AND G. KARYPIS, Multilevel algorithms for generating coarse grids for multigrid methods, in Conference Proceedings of Supercomputing 2001, 2001.
13. O. PIRONNEAU, Finite Element Methods for Fluids, John Wiley & Sons, Chichester, UK, 1989.
14. J. W. RUGE AND K. STÜBEN, Algebraic multigrid, in Multigrid Methods, Frontiers Appl. Math. 5, S. McCormick, ed., SIAM, 1987, pp. 73-130.
15. J. SCHÖBERL AND W. ZULEHNER, On Schwarz-type smoothers for saddle point problems, Numer. Math., 95 (2003), pp. 377-399.
16. K. STÜBEN, A review of algebraic multigrid, Comput. Appl. Math., 128 (2001), pp. 281-309.
17. P. VANEK, J. MANDEL, AND M. BREZINA, Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems, Computing, 56 (1996), pp. 179-196.
18. S. VANKA, Block-implicit multigrid calculation of two-dimensional recirculating flows, Comput. Methods Appl. Mech. Engrg., 59 (1986), pp. 29-48.
19. M. WABRO, Algebraic Multigrid Methods for the Numerical Solution of the Incompressible Navier-Stokes Equations, Ph.D. thesis, University of Linz, Linz, Austria, 2003.
20. M. WABRO, Coupled algebraic multigrid methods for the Oseen problem, Comput. Vis. Sci., 7 (2004), pp. 141-151.
21. G. WITTUM, Multi-grid methods for Stokes and Navier-Stokes equations, Numer. Math., 54 (1989), pp. 543-563.
22. G. WITTUM, On the convergence of multi-grid methods with transforming smoothers, Numer. Math., 57 (1990), pp. 15-38.
23. W. ZULEHNER, A class of smoothers for saddle point problems, Computing, 65 (2000), pp. 227-246.