Parallel multilevel tetrahedral grid refinement

SIAM Journal on Scientific Computing

Volumn 26, Issue 4, 2005, Pages 1261-1288

  Groß, Sven ^a   Reusken, Arnold ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Consistent triangulations; Parallelization; Stable refinement; Tetrahedral grid refinement

Indexed keywords

ALGORITHMS; HIERARCHICAL SYSTEMS;

CONSISTENT TRIANGULATIONS; PARALLELIZATION; STABLE REFINEMENT; TETRAHEDRAL GRID REFINEMENT;

COMPUTATIONAL METHODS;

EID: 23944438942     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827503425237     Document Type: Article

References (35)

1. E. BÄNSCH, Local mesh refinement in 2 and 3 dimensions, Impact Comput. Sci. Engrg., 3 (1991), pp. 181-191.
2. R.E. BANK, PLTMG: A Software Package for Solving Elliptic Partial Differential Equations: Users' Guide 8.0, SIAM, Philadelphia, 1998.
3. R.E. BANK, An adaptive, multi-level method for elliptic boundary value problems, Computing, 26 (1981), pp. 91-105.
4. R.E. BANK, A.H. SHERMAN, AND A. WEISER, Refinement algorithms and data structures for regular local mesh refinement, in Scientific Computing, R. Stepleman, ed., North-Holland, Amsterdam, 1983, pp. 3-17.
5. R.E. BANK, A posteriori error estimates, adaptive local mesh refinement and multigrid iteration, in Multigrid Methods II, Lecture Notes in Math. 1228, Springer-Verlag, Heidelberg, Germany, 1986, pp. 7-23.
6. P. BASTIAN, Parallele Adaptive Mehrgitterverfahren, Teubner, Stuttgart, Germany, 1996.
7. P. BASTIAN, K. BIRKEN, K. JOHANNSEN, S. LANG, N. NEUß, H. RENTZ-REICHERT, AND C. WIENERS, UG - A flexible software toolbox for solving partial differential equations, Cornput. Vis. Sci., 1 (1997), pp. 27-40.
8. P. BASTIAN, Load balancing for adaptive multigrid methods, SIAM J. Sci. Comput., 19 (1998), pp. 1303-1321.
9. P. BASTIAN, K. BIRKEN, K. JOHANNSEN, S. LANG, V. REICHENBERGER, G. WITTUM, AND C. WROBEL, A parallel software-platform for solving problems of partial differential equations using unstructured grids and adaptive multigrid methods, in High Performance Computing in Science and Engineering, E. Krause and W. Jäger, eds., Springer-Verlag, Berlin, 1999, pp. 326-339.
10. P. BASTIAN AND S. LANG, Complex Benchmark Computations with UG, Technical report 2002-31, IWR (SFB 359), University of Heidelberg, Heidelberg, Germany, 2002.
11. J. BEY, Tetrahedral grid refinement, Computing, 55 (1995), pp. 355-378.
12. J. BEY, Finite- Volumen- und Mehrgitterverfahren für Elliptische Randwertprobleme, Ph.D. thesis, Universität Tübingen, Tübingen, Germany, 1997.
13. J. BEY, Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes, Numer. Math., 85 (2000), pp. 1-29.
14. K. BIRKEN, Dynamic Distributed Data (DDD) - A Software Tool for Distributed Memory Parallelization, Documentation, http://cox.iwr.uni- heidelberg.de/~ddd/ (November 1997).
15. K. BIRKEN, Ein Modell zur effizienten Parallelisierung von Algorithmen auf komplexen, dynamischen Datenstrukturen, Ph.D. thesis, University of Stuttgart, Stuttgart, Germany, 1998.
16. B.L. CHAMBERLAIN, Graph Partitioning Algorithms for Distributing Workloads of Parallel Computations, Technical report, University of Washington, Seattle, WA, 1998; also available online from http://www.cs.washington.edu/ homes/brad/cv/pubs/degree/ generals.html.
17. H. FREUDENTHAL, Simplizialzerlegungen von beschränkter Flachheit, Ann. of Math. (2), 43 (1942), pp. 580-582.
18. S. GROß, J. PETERS, V. REICHELT, AND A. REUSKEN, The DROPS Package for Numerical Simulations of Incompressible Flows Using Parallel Adaptive Multigrid Techniques, IGPM Report 211, http://www.igpm.rwth-aachen.de/reports/ html/rep.2002.html (February 2002).
19. S. GROß, Parallelisierung eines adaptiven Verfahrens zur numerischen Lösung partieller Differentialgleichungen, Master thesis, RWTH Aachen, Aachen, Germany, 2002 (in German); also available online from http://www.igpm.rwth-aachen.de/www/diplomarbeiten.html.
20. G. HAASE, Parallelisierung numerischer Algorithmen für partielle Differentialgleichungen, Teubner, Stuttgart, Germany, 1999 (in German).
21. G. KARYPIS, K. SCHLOEGEL, AND V. KUMAR, ParMETIS. Parallel Graph Partitioning and Sparse Matrix Ordering Library, Documentation, University of Minnesota, Army HPC Research Center, Minneapolis, MN, 1998, http://www-users.cs. umn.edu/~karypis/ metis/parmetis/.
22. G. KARYPIS, K. SCHLOEGEL, AND V. KUMAR, Parallel Static and Dynamic Multi-Constraint Graph Partitioning, Supercomputing Institute, University of Minnesota, Minneapolis, MN, 2001.
23. KASKADE, A toolbox for adaptive multilevel codes, http://www.zib.de/ Numerik/numsoft/ kaskade/text.en.html (2003).
24. S. LANG, Parallele numerische Simulation instationärer Probleme mit adaptiven Methoden auf unstrukturierten Gittern, Ph.D. thesis, University of Stuttgart, Stuttgart, Germany, 2001.
25. S. LANG, UG - A parallel software tool for unstructured adaptive multigrids, in Parallel Computing: Fundamentals and Applications, Proceedings of the International Conference ParCo99, E.H. D'Hollancler, J.R. Joubert, F.J. Peters, and H. Sips, eds., Imperial College Press, Delft, The Netherlands, 1999.
26. A. LIU AND B. JOE, Quality local refinement of tetrahedral meshes based on bisection, SIAM J. Sci. Comput., 16 (1995), pp. 1269-1291.
27. A. LIU AND B. JOE, Quality local refinement of tetrahedral meshes based on 8-subtetrahedron subdivision, Math. Comp., 65 (1996), pp. 1183-1200.
28. J.M. MAUBACH, Local bisection refinement for N-simplicial grids generated by reflection, SIAM J. Sci. Comput., 16 (1995), pp. 210-227.
29. MG - A Parallel Multilevel Platform for Unstructured Grids, http://rcswww.urz.tu-dresden. de/~jstiller/projects/mg/ (1998).
30. W.F. MITCHELL, Adaptive refinement for arbitrary finite-element spaces with hierarchical basis, J. Comput. Appl. Math., 36 (1991), pp. 65-78.
31. M.C. RIVARA, Algorithms for refining triangular grids suitable for adaptive and multigrid techniques, Internat. J. Numer. Methods Engrg., 20 (1984), pp. 745-756.
32. C.T. TRAXLER, An algorithm for adaptive mesh refinement in n dimensions, Computing, 59 (1997), pp. 115-137.
33. UG, http://cox.iwr.uni-heidelberg.de/~ug/.
34. C. WALSHAW, M. CROSS, AND M. EVERETT, Parallel dynamic graph partitioning for adaptive unstructured meshes, J. Parallel Distrib. Comput., 47 (1997), pp. 102-108.
35. S. ZHANG, Successive subdivisions of tetrahedra and multigrid methods on tetrahedral meshes, Houston J. Math., 21 (1995), pp. 541-556.