Globalization of nonlinear FETI-DP domain decomposition methods using an SQP approach
Newton-type methods (49M15) PDE constrained optimization (numerical aspects) (49M41) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10) Numerical optimization and variational techniques (65K10) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Quadratic programming (90C20)
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.
- New nonlinear FETI-DP methods based on a partial nonlinear elimination of variables
- Nonlinear FETI-DP and BDDC methods: a unified framework and parallel results
- Nonlinear FETI-DP and BDDC methods
- A Nonlinear FETI-DP Method with an Inexact Coarse Problem
- A highly scalable implementation of inexact nonlinear FETI-DP without sparse direct solvers
- A globally convergent method for nonlinear programming
- A nonlinear elimination preconditioned inexact Newton method for heterogeneous hyperelasticity
- Additive and hybrid nonlinear two-level Schwarz methods and energy minimizing coarse spaces for unstructured grids
- An Inexact SQP Method for Equality Constrained Optimization
- Computational homogenization with million-way parallelism using domain decomposition methods
- FETI-DP: A dual-prime unified FETI method. I: A faster alternative to the two-level FETI method
- scientific article; zbMATH DE number 5774819 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 2098241 (Why is no real title available?)
- scientific article; zbMATH DE number 2113718 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Inexact FETI-DP methods
- Linear and nonlinear programming.
- Nonlinear FETI-DP and BDDC methods
- Nonlinear FETI-DP and BDDC methods: a unified framework and parallel results
- Nonlinear preconditioning: how to use a nonlinear Schwarz method to precondition Newton's method
- Nonlinearly Preconditioned Inexact Newton Algorithms
- On an adaptive coarse space and on nonlinear domain decomposition
- Robust FETI-DP methods for heterogeneous three dimensional elasticity problems
- Substructured formulations of nonlinear structure problems -- influence of the interface condition
This page was built for publication: Globalization of nonlinear FETI-DP domain decomposition methods using an SQP approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2081571)
