In this work, we propose an enhanced implementation of balancing Neumann–Neumann (BNN) preconditioning together with a detailed numerical comparison against the balancing domain decomposition by constraints (BDDC) preconditioner. As model problems, we consider the Poisson and linear elasticity problems. On one hand, we propose a novel way to deal with singular matrices and pseudo‐inverses appearing in local solvers. It is based on a kernel identification strategy that allows us to efficiently compute the action of the pseudo‐inverse via local indefinite solvers. We further show how, identifying a minimum set of degrees of freedom to be fixed, an equivalent definite system can be solved instead, even in the elastic case. On the other hand, we propose a simple implementation of the algorithm that reduces the number of Dirichlet solvers to only one per iteration, leading to similar computational cost as additive methods. After these improvements of the BNN preconditioned conjugate gradient algorithm, we compare its performance against that of the BDDC preconditioners on a pair of large‐scale distributed‐memory platforms. The enhanced BNN method is a competitive preconditioner for three‐dimensional Poisson and elasticity problems and outperforms the BDDC method in many cases.

H. Kanayama, M. Ogino, S. Sugimoto, K. Yodo, H. Zheng. On the Coarse Matrix Solver of Preconditioners for Magnetostatic Domain Decomposition Analysis. IEEJ Trans. PE 137(3) DOI 10.1541/ieejpes.137.179

S. Badia, A. Martín, J. Principe. Implementation and Scalability Analysis of Balancing Domain Decomposition Methods. Arch Computat Methods Eng 20(3) (2013) DOI 10.1007/s11831-013-9086-4