Parallel Nesterov Domain Decomposition Method for Elliptic Partial Differential Equations
Keyword(s):
We study a parallel non-overlapping domain decomposition method, based on the Nesterov accelerated gradient descent, for the numerical approximation of elliptic partial differential equations. The problem is reformulated as a constrained (convex) minimization problem with the interface continuity conditions as constraints. The resulting domain decomposition method is an accelerated projected gradient descent with convergence rate [Formula: see text]. At each iteration, the proposed method needs only one matrix/vector multiplication. Numerical experiments show that significant (standard and scaled) speed-ups can be obtained.
2001 ◽
Vol 13
(5)
◽
pp. 327-350
◽
2000 ◽
Vol 113
(2-3)
◽
pp. 111-139
◽
2011 ◽
Vol 235
(17)
◽
pp. 5078-5094
◽
Analysis of a nonoverlapping domain decomposition method for elliptic partial differential equations
1997 ◽
Vol 87
(1)
◽
pp. 11-19
◽
1996 ◽
Vol 33
(6)
◽
pp. 2401-2416
◽
2000 ◽
Vol 40
(2-3)
◽
pp. 177-192
◽
2009 ◽
Vol 33
(11)
◽
pp. 1284-1288
◽
1999 ◽
Vol 37
(10)
◽
pp. 77-93
◽