A Note on Adaptive Nonlinear Preconditioning Techniques

Lulu Liu, David E. Keyes, Rolf Krause

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

Nonlinear preconditioning is a globalization technique for Newton’s method applied to systems of equations with unbalanced nonlinearities, in which nonlinear residual norm reduction stagnates due to slowly evolving subsets of the degrees of freedom. Even though the Newton corrections may effectively be sparse, a standard Newton method still requires large ill-conditioned linear systems resulting from global linearizations of the nonlinear residual to be solved at each step. Nonlinear preconditioners may enable faster global convergence by shifting work to where it is most strategic, on subsets of the original system. They require additional computation per outer iteration while aiming for many fewer outer iterations and correspondingly fewer global synchronizations. In this work, we improve upon previous nonlinear preconditioning implementations by introducing parameters that allow turning off nonlinear preconditioning during outer Newton iterations where it is not needed. Numerical experiments show that the adaptive nonlinear preconditioning algorithm has performance similar to monolithically applied nonlinear preconditioning, preserving robustness for some challenging problems representative of several PDE-based applications while saving work on nonlinear subproblems.
Original languageEnglish (US)
Pages (from-to)A1171-A1186
Number of pages1
JournalSIAM Journal on Scientific Computing
Volume40
Issue number2
DOIs
StatePublished - Apr 24 2018

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A Note on Adaptive Nonlinear Preconditioning Techniques'. Together they form a unique fingerprint.

Cite this