Summary
Partial differential equations in complex domains are very flexibly discretized by finite elements with unstructured meshes. For such problems, the challenging task to construct coarse level spaces for efficient multilevel preconditioners can in many cases be solved by a semi-geometric approach, which is based on a hierarchy of non-nested meshes. In this paper, we investigate the connection between the resulting semi-geometric multigrid methods and the truly geometric variant more closely. This is done by considering a sufficiently simple computational domain and treating the geometric multigrid method as a special case in a family of almost nested settings. We study perturbations of the meshes and analyze how efficiency and robustness depend on a truncation of the interlevel transfer. This gives a precise idea of which results can be achieved in the general unstructured case.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Bibliography
J.H. Bramble, J.E. Pasciak, J. Wang, and J. Xu. Convergence estimates for multigrid algorithms without regularity assumptions. Math. Comput., 57(195):23–45, 1991.
X. Cai. The use of pointwise interpolation in domain decomposition methods with non-nested meshes. SIAM J. Sci. Comput., 16(1):250–256, 1995.
T. Chan, B. Smith, and J. Zou. Overlapping Schwarz methods on unstructured meshes using non-matching coarse grids. Numer. Math., 73(2):149–167, 1996.
T. Chan, J. Xu, and L. Zikatanov. An agglomeration multigrid method for unstructured grids. In J. Mandel et al., editor, Domain Decomposition Methods 10, volume 218 of Contemp. Math., pages 67–81. AMS: Providence, RI, 1998.
T. Dickopf. Multilevel Methods Based on Non-Nested Meshes. PhD thesis, University of Bonn, 2010. http://hss.ulb.uni-bonn.de/2010/2365.
M. Griebel and M.A. Schweitzer. A particle-partition of unity method. Part III: A multilevel solver. SIAM J. Sci. Comput., 24(2):377–409, 2002.
K. Stüben. An introduction to algebraic multigrid. In U. Trottenberg et al., editor, Multigrid, pages 413–532. Academic Press, London, 2001.
A. Toselli and O. Widlund. Domain Decomposition Methods – Algorithms and Theory, volume 34 of Springer Ser. Comput. Math. Springer, 2005.
J. Xu. The auxiliary space method and optimal multigrid preconditioning techniques for unstructured grids. Computing, 56(3):215–235, 1996.
Acknowledgements
This work was supported by the Bonn International Graduate School in Mathematics and by the Iniziativa Ticino in Rete.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dickopf, T., Krause, R. (2013). Numerical Study of the Almost Nested Case in a Multilevel Method Based on Non-nested Meshes. In: Bank, R., Holst, M., Widlund, O., Xu, J. (eds) Domain Decomposition Methods in Science and Engineering XX. Lecture Notes in Computational Science and Engineering, vol 91. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35275-1_65
Download citation
DOI: https://doi.org/10.1007/978-3-642-35275-1_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35274-4
Online ISBN: 978-3-642-35275-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)