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. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1007/s00607-013-0293-5 | Computing |
Keywords | Field | DocType |
Parallel algorithms,Domain decomposition,Iterative substructuring,BDDC,Adaptive constraints,Multilevel algorithms | BDDC,FETI-DP,Mathematical optimization,Preconditioner,LOBPCG,Computer science,Parallel algorithm,Adaptive algorithm,Domain decomposition methods,Scalability | Journal |
Volume | Issue | ISSN |
95 | 12 | Computing, 95(12):1087-1119, 2013 |
Citations | PageRank | References |
9 | 0.73 | 16 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
bedřich sousedik | 1 | 28 | 5.50 |
Jakub Sístek | 2 | 30 | 4.42 |
Jan Mandel | 3 | 444 | 69.36 |