Journal
SIAM JOURNAL ON NUMERICAL ANALYSIS
Volume 54, Issue 5, Pages 3145-3166Publisher
SIAM PUBLICATIONS
DOI: 10.1137/15M1028182
Keywords
nonlinear equations; nonlinear preconditioning; multiplicative Schwarz; local convergence
Categories
Funding
- Extreme Computing Research Center at KAUST
- Aramco KAUST Master Research Agreement ORS [1438]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
