Abstract | ||
---|---|---|
Abstract The adaptive BDDC method is extended to the selection of face constraints in three dimensions. A new implementation of the BDDC method is presented based on a global formulation without an explicit coarse problem, with massive parallelism provided by a multifrontal solver. Constraints are implemented by a projection and sparsity of the projected operator is preserved by a generalized change of variables. The effectiveness of the method is illustrated on several engineering problems. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1016/j.matcom.2011.03.014 | Mathematics and Computers in Simulation |
Keywords | Field | DocType |
Parallel algorithms,Domain decomposition,Iterative substructuring,BDDC,Adaptive constraints | Change of variables,BDDC,FETI-DP,Mathematical optimization,Massively parallel,Parallel algorithm,Operator (computer programming),Solver,Domain decomposition methods,Mathematics | Journal |
Volume | Issue | ISSN |
82 | 10 | 0378-4754 |
Citations | PageRank | References |
3 | 0.44 | 13 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jan Mandel | 1 | 444 | 69.36 |
bedřich sousedik | 2 | 28 | 5.50 |
Jakub Sístek | 3 | 30 | 4.42 |