Society for Industrial and Applied Mathematics, SIAM Journal on Numerical Analysis, 5(54), p. 3145-3166
DOI: 10.1137/15m1028182
Full text: Download
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.