pith. sign in

arxiv: 1301.0191 · v1 · pith:GED62N2Cnew · submitted 2013-01-02 · 🧮 math.NA

Adaptive-Multilevel BDDC and its parallel implementation

classification 🧮 math.NA
keywords bddcmethodadaptiveproblemsadaptive-multilevelalgorithmdecompositionimplementation
0
0 comments X
read the original abstract

We combine the adaptive and multilevel approaches to the BDDC and formulate a method which allows an adaptive selection of constraints on each decomposition level. We also present a strategy for the solution of local eigenvalue problems in the adaptive algorithm using the LOBPCG method with a preconditioner based on standard components of the BDDC. The effectiveness of the method is illustrated on several engineering problems. It appears that the Adaptive-Multilevel BDDC algorithm is able to effectively detect troublesome parts on each decomposition level and improve convergence of the method. The developed open-source parallel implementation shows a good scalability as well as applicability to very large problems and core counts.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.