Globalization of nonlinear FETI-DP domain decomposition methods using an SQP approach (Q2081571)

The authors analyze the globalization of nonlinear FETI-DP (Dual Primal Finite Element Tearing and Interconnecting) methods by using a Sequential Quadratic Programming (SQP) approach. The nonlinear FETI-DP methods decompose the global problem into local nonoverlapping nonlinear problems, interconnect those using Lagrange multipliers and then linearize them. First, the authors prove standard globalization results for SQP-based globalization of nonlinear FETI-DP, for the case that the elimination set is empty, and then they show how to combine nonlinear elimination and SQP-based globalization. The method can improve solver robustness, and can significantly reduce the number of synchronization points when solving nonlinear finite element problems. In order to carry out some numerical experiments the authors consider a two dimensional quasi-static Neo-Hookean benchmark problem using stiff or almost incompressible inclusions embedded in each subdomain. Some algorithmic details and various numerical outcomes are eventually provided.