A Domain Decomposition Based Two-Level Newton Scheme for Nonlinear Problems
نویسندگان
چکیده
One can refer to the paper by Keyes [1992] and the book by Smith et al. [1996] for in-depth reviews of domain decomposition (DD) methods. Of particular interest here are non-overlapping schemes such as iterative substructuring (Bjørstad et al. [2001]) and FETI methods (Farhat et al. [2001]). When solving non-linear boundary value problems (BVPs) via domain decomposition it is common to use Newton type algorithms and then to apply existing DD approaches to the ensuing linearized problems (Knoll and Keyes [2002]). The NK-Schwarz scheme (Keyes [1995]) as the name suggests, uses a Krylov scheme equipped with a Schwarz preconditioner to solve this linear update equation. If the non-linear effects are unbalanced, i.e., the nonlinearity has a significant spatial variation, then the Jacobian becomes ill-conditioned and hence the NK-Schwarz scheme is not effective cf. Cai and Keyes [2002]. A scheme that proves effective for problems with unbalanced nonlinearities is the multi level Newton Schwarz (MLN-Schwarz) scheme that was originally introduced to solve multi-physics problems (Bächtold et al. [1995], Aluru and White [1999]). Kim et al. [2003] implemented a serial version of the MLN-Schwarz to solve fluid-structure interaction problems which had the flavor of a multiplicative Schwarz approach. The scheme employs a global consistency equation in
منابع مشابه
Solving systems of nonlinear equations using decomposition technique
A systematic way is presented for the construction of multi-step iterative method with frozen Jacobian. The inclusion of an auxiliary function is discussed. The presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of Newton multi-step method. The auxiliary function provides us the way to overcome the singul...
متن کاملNonlinear Preconditioning: How to Use a Nonlinear Schwarz Method to Precondition Newton's Method
For linear problems, domain decomposition methods can be used directly as iterative solvers, but also as preconditioners for Krylov methods. In practice, Krylov acceleration is almost always used, since the Krylov method finds a much better residual polynomial than the stationary iteration, and thus converges much faster. We show in this paper that also for non-linear problems, domain decomposi...
متن کاملDomain decomposition method for nonlinear multiscale analysis of structures
In this presentation we consider efficient numerical strategies designed to compute the evolution of large structures undergoing localized nonlinear phenomena such as plasticity, damage, cracking or microbuckling. Despite Newton-Schur-Krylov strategies which associate both Newton type solvers and domain decomposition methods (and especially non-overlapping ones [1,2]) provide an efficient frame...
متن کاملSuperlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کاملA Nonlinearly Preconditioned Inexact Newton Algorithm for Steady State Lattice Boltzmann Equations
Most existing methods for calculating the steady state solution of the lattice Boltzmann equations are based on pseudo time stepping, which often requires a large number of time steps especially for high Reynolds number problems. To calculate the steady state solution directly without the time integration, in this paper we propose and study a nonlinearly preconditioned inexact Newton algorithm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004