Field-Split Preconditioned Inexact Newton Algorithms

The multiplicative Schwarz preconditioned inexact Newton (MSPIN) algorithm is presented as a complement to additive Schwarz preconditioned inexact Newton (ASPIN). At an algebraic level, ASPIN and MSPIN are variants of the same strategy to improve the convergence of systems with unbalanced nonlinearities; however, they have natural complementarity in practice. MSPIN is naturally based on partitioning of degrees of freedom in a nonlinear PDE system by field type rather than by subdomain, where a modest factor of concurrency can be sacrificed for physically motivated convergence robustness. ASPIN, originally introduced for decompositions into subdomains, is natural for high concurrency and reduction of global synchronization. We consider both types of inexact Newton algorithms in the field-split context, and we augment the classical convergence theory of ASPIN for the multiplicative case. Numerical experiments show that MSPIN can be significantly more robust than Newton methods based on global linearizations...

[1]  Jed Brown,et al.  The Portable Extensible Toolkit for Scientific computing , 2012 .

[2]  Xiao-Chuan Cai,et al.  A Combined Linear and Nonlinear Preconditioning Technique for Incompressible Navier-Stokes Equations , 2004, PARA.

[3]  Xiao-Chuan Cai,et al.  Some parallel linear and nonlinear schwarz methods with applications in computational fluid dynamics , 2004 .

[4]  Y. Saad,et al.  GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .

[5]  Xiao-Chuan Cai,et al.  A parallel nonlinear additive Schwarz preconditioned inexact Newton algorithm for incompressible Navier-Stokes equations , 2005 .

[6]  Homer F. Walker,et al.  Globally Convergent Inexact Newton Methods , 1994, SIAM J. Optim..

[7]  Homer F. Walker,et al.  NITSOL: A Newton Iterative Solver for Nonlinear Systems , 1998, SIAM J. Sci. Comput..

[8]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[9]  V. E. Henson,et al.  BoomerAMG: a parallel algebraic multigrid solver and preconditioner , 2002 .

[10]  David E. Keyes,et al.  Nonlinearly Preconditioned Inexact Newton Algorithms , 2002, SIAM J. Sci. Comput..

[11]  Paul J. Lanzkron,et al.  An Analysis of Approximate Nonlinear Elimination , 1996, SIAM J. Sci. Comput..

[12]  D. Keyes,et al.  Jacobian-free Newton-Krylov methods: a survey of approaches and applications , 2004 .

[13]  Homer F. Walker,et al.  Choosing the Forcing Terms in an Inexact Newton Method , 1996, SIAM J. Sci. Comput..

[14]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[15]  D. Keyes,et al.  Non‐linear additive Schwarz preconditioners and application in computational fluid dynamics , 2002 .

[16]  Matthew G. Knepley,et al.  Composing Scalable Nonlinear Algebraic Solvers , 2015, SIAM Rev..

[17]  W. Hackbusch,et al.  On the nonlinear domain decomposition method , 1997 .

[18]  Hengbin An,et al.  On Convergence of the Additive Schwarz Preconditioned Inexact Newton Method , 2005, SIAM J. Numer. Anal..

[19]  Barbara Wohlmuth,et al.  A multiplicative Schwarz method and its application to nonlinear acoustic-structure interaction , 2009 .

[20]  Leszek Marcinkowski,et al.  Parallel Performance of Some Two-Level ASPIN Algorithms , 2005 .

[21]  William Gropp,et al.  Extensible Toolkit for Scientific Computing , 1996 .

[22]  Xiao-Chuan Cai,et al.  A class of parallel two-level nonlinear Schwarz preconditioned inexact Newton algorithms ☆ , 2007 .