Abstract
We consider a second order elliptic boundary value problem in the variational form: find u ∗ ∈ H 0 1(Ω), for a given polygonal (polyhedral) domain \(\varOmega \subset \mathbb{R}^{d},\,d = 2,3\) and a source term f ∈ L 2(Ω), such that
The Bank–Holst parallel adaptive meshing paradigm [1–3] is utilised to solve (1) in a combination of domain decomposition and adaptivity.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
R.E. Bank, Some variants of the Bank-Holst parallel adaptive meshing paradigm. Comput. Vis. Sci. 9(3), 133–144 (2006)
R.E. Bank, M. Holst, A new paradigm for parallel adaptive meshing algorithms. SIAM J. Sci. Comput. 22(4), 1411–1443 (2000) (electronic)
R.E. Bank, M. Holst, A new paradigm for parallel adaptive meshing algorithms. SIAM Rev. 45(2), 291–323 (2003) (electronic). Reprinted from SIAM J. Sci. Comput. 22(4), 1411–1443 (2000) [MR1797889]
R.E. Bank, P.K. Jimack, S.A. Nadeem, S.V. Nepomnyaschikh, A weakly overlapping domain decomposition preconditioner for the finite element solution of elliptic partial differential equations. SIAM J. Sci. Comput. 23(6), 1817–1841 (2002) (electronic)
M. Dryja, O.B. Widlund, Domain decomposition algorithms with small overlap. SIAM J. Sci. Comput. 15(3), 604–620 (1994). Iterative methods in numerical linear algebra (Copper Mountain Resort, CO, 1992)
S. Loisel, H. Nguyen, An optimal schwarz preconditioner for a class of parallel adaptive finite elements (submitted)
G. Meurant, The Lanczos and Conjugate Gradient Algorithms. Software, Environments, and Tools, vol. 19 (Society for Industrial and Applied Mathematics, Philadelphia, PA, 2006). From theory to finite precision computations
A. Toselli, O. Widlund, Domain Decomposition Methods—Algorithms and Theory. Springer Series in Computational Mathematics, vol. 34 (Springer, Berlin, 2005)
Acknowledgements
This work was supported by the Numerical Algorithms and Intelligent Software Centre funded by the UK EPSRC grant EP/G036136 and the Scottish Funding Council.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Loisel, S., Nguyen, H. (2016). A Comparison of Additive Schwarz Preconditioners for Parallel Adaptive Finite Elements. In: Dickopf, T., Gander, M., Halpern, L., Krause, R., Pavarino, L. (eds) Domain Decomposition Methods in Science and Engineering XXII. Lecture Notes in Computational Science and Engineering, vol 104. Springer, Cham. https://doi.org/10.1007/978-3-319-18827-0_34
Download citation
DOI: https://doi.org/10.1007/978-3-319-18827-0_34
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18826-3
Online ISBN: 978-3-319-18827-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)