Convergence Analysis for the Multiplicative Schwarz Preconditioned Inexact Newton Algorithm

Handle URI:
http://hdl.handle.net/10754/621850
Title:
Convergence Analysis for the Multiplicative Schwarz Preconditioned Inexact Newton Algorithm
Authors:
Liu, Lulu ( 0000-0002-0357-1322 ) ; Keyes, David E. ( 0000-0002-4052-7224 )
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.
KAUST Department:
Applied Mathematics and Computational Science Program; Extreme Computing Research Center
Citation:
Liu L, Keyes DE (2016) Convergence Analysis for the Multiplicative Schwarz Preconditioned Inexact Newton Algorithm. SIAM Journal on Numerical Analysis 54: 3145–3166. Available: http://dx.doi.org/10.1137/15M1028182.
Publisher:
Society for Industrial & Applied Mathematics (SIAM)
Journal:
SIAM Journal on Numerical Analysis
Issue Date:
26-Oct-2016
DOI:
10.1137/15M1028182
Type:
Article
ISSN:
0036-1429; 1095-7170
Sponsors:
This work was supported by the Extreme Computing Research Center at KAUST and by the Aramco KAUST Master Research Agreement ORS 1438
Additional Links:
http://epubs.siam.org/doi/10.1137/15M1028182
Appears in Collections:
Articles; Applied Mathematics and Computational Science Program; Extreme Computing Research Center

Full metadata record

DC FieldValue Language
dc.contributor.authorLiu, Luluen
dc.contributor.authorKeyes, David E.en
dc.date.accessioned2016-11-21T13:49:24Z-
dc.date.available2016-11-21T13:49:24Z-
dc.date.issued2016-10-26en
dc.identifier.citationLiu L, Keyes DE (2016) Convergence Analysis for the Multiplicative Schwarz Preconditioned Inexact Newton Algorithm. SIAM Journal on Numerical Analysis 54: 3145–3166. Available: http://dx.doi.org/10.1137/15M1028182.en
dc.identifier.issn0036-1429en
dc.identifier.issn1095-7170en
dc.identifier.doi10.1137/15M1028182en
dc.identifier.urihttp://hdl.handle.net/10754/621850-
dc.description.abstractThe 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.en
dc.description.sponsorshipThis work was supported by the Extreme Computing Research Center at KAUST and by the Aramco KAUST Master Research Agreement ORS 1438en
dc.publisherSociety for Industrial & Applied Mathematics (SIAM)en
dc.relation.urlhttp://epubs.siam.org/doi/10.1137/15M1028182en
dc.rightsArchived with thanks to SIAM Journal on Numerical Analysisen
dc.subjectnonlinear equationsen
dc.subjectnonlinear preconditioningen
dc.subjectmultiplicative Schwarzen
dc.subjectlocal convergenceen
dc.titleConvergence Analysis for the Multiplicative Schwarz Preconditioned Inexact Newton Algorithmen
dc.typeArticleen
dc.contributor.departmentApplied Mathematics and Computational Science Programen
dc.contributor.departmentExtreme Computing Research Centeren
dc.identifier.journalSIAM Journal on Numerical Analysisen
dc.eprint.versionPublisher's Version/PDFen
kaust.authorLiu, Luluen
kaust.authorKeyes, David E.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.