2016
DOI: 10.1137/15m1028182
|View full text |Cite
|
Sign up to set email alerts
|

Convergence Analysis for the Multiplicative Schwarz Preconditioned Inexact Newton Algorithm

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
8
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 11 publications
(8 citation statements)
references
References 17 publications
0
8
0
Order By: Relevance
“…where β > 0 is a preselected constant. Then, the subspaces V k b and V k g corresponding to (22) and (23) are defined as…”
Section: Discussion On Different Elimination Strategiesmentioning
confidence: 99%
See 2 more Smart Citations
“…where β > 0 is a preselected constant. Then, the subspaces V k b and V k g corresponding to (22) and (23) are defined as…”
Section: Discussion On Different Elimination Strategiesmentioning
confidence: 99%
“…The subspaces V k b and V k g are defined the same as (22) and (23). Following the idea of restricted elimination, we define the restricted bad subset I k,ε b by excluding some mesh points near the interface, such that I k,ε…”
Section: Discussion On Different Elimination Strategiesmentioning
confidence: 99%
See 1 more Smart Citation
“…A strategy based on the field-splitting of pressure and saturation. This strategy is a right version of left multiplicative nonlinear preconditioning, namely, the multiplicative Schwarz preconditioned inexact Newton (MSPIN) method [33,35], where the subproblems with respect to different physical variables are solved sequentially, similar to a Gauss-Seidel iteration. In the NE context, we perform the subspace correction step (Step 3 in Algorithm 3) in two stages to eliminate alternatively the pressure components and the saturation components.…”
Section: 2mentioning
confidence: 99%
“…The additive Schwarz preconditioned inexact Newton algorithm (ASPIN) [7,23,24,25] belongs to this class, where solutions of nonlinear subdomain problems are solved and then combined together using an additive Schwarz framework. A multiplicative Schwarz version of ASPIN, named MSPIN, was introduced in [33,35] for two-dimensional (2D) incompressible flows and two-phase flows in porous media [36].…”
mentioning
confidence: 99%