Convergence Analysis for the Multiplicative Schwarz Preconditioned Inexact Newton Algorithm

Lulu Liu, David E. Keyes

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

The multiplicative Schwarz preconditioned inexact Newton (MSPIN) algorithm, based on decomposition by field type rather than by subdomain, was recently introduced to improve the convergence of systems with unbalanced nonlinearities. This paper provides a convergence analysis of the MSPIN algorithm. Under reasonable assumptions, it is shown that MSPIN is locally convergent, and desired superlinear or even quadratic convergence can be obtained when the forcing terms are picked suitably.
Original languageEnglish (US)
Pages (from-to)3145-3166
Number of pages22
JournalSIAM Journal on Numerical Analysis
Volume54
Issue number5
DOIs
StatePublished - Oct 26 2016

Fingerprint Dive into the research topics of 'Convergence Analysis for the Multiplicative Schwarz Preconditioned Inexact Newton Algorithm'. Together they form a unique fingerprint.

Cite this