2021
DOI: 10.1002/nme.6799
|View full text |Cite
|
Sign up to set email alerts
|

A dual‐primal finite element tearing and interconnecting method for nonlinear variational inequalities utilizing linear local problems

Abstract: We propose a novel dual‐primal finite element tearing and interconnecting method for nonlinear variational inequalities. The proposed method is based on a particular Fenchel–Rockafellar dual formulation of the target problem, which yields linear local problems despite the nonlinearity of the target problem. Since local problems are linear, each iteration of the proposed method can be done very efficiently compared with usual nonlinear domain decomposition methods. We prove that the proposed method is linearly … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 8 publications
(1 citation statement)
references
References 43 publications
0
1
0
Order By: Relevance
“…Such an idea of acceleration can be applied to not only linear problems but also nonlinear problems. There have been some recent works on the acceleration of domain decomposition methods for several kinds of nonlinear problems: nonlinear elliptic problems [12], variational inequalities [17], and mathematical imaging problems [15,16,19]. In particular, in the author's previous work [22], an accelerated additive Schwarz method that can be applied to the general convex optimization (1.1) was considered.…”
mentioning
confidence: 99%
“…Such an idea of acceleration can be applied to not only linear problems but also nonlinear problems. There have been some recent works on the acceleration of domain decomposition methods for several kinds of nonlinear problems: nonlinear elliptic problems [12], variational inequalities [17], and mathematical imaging problems [15,16,19]. In particular, in the author's previous work [22], an accelerated additive Schwarz method that can be applied to the general convex optimization (1.1) was considered.…”
mentioning
confidence: 99%