DOMAIN DECOMPOSITION ALGORITHMS WITH SMALL OVERLAP

被引：182

作者：

DRYJA, M ^{[1
]}

WIDLUND, OB ^{[1
]}

机构：

[1] NYU,COURANT INST MATH SCI,NEW YORK,NY 10012

来源：

SIAM JOURNAL ON SCIENTIFIC COMPUTING | 1994年 / 15卷 / 03期

关键词：

DOMAIN DECOMPOSITION; ELLIPTIC FINITE ELEMENT PROBLEMS; PRECONDITIONED CONJUGATE GRADIENTS; SCHWARZ METHODS;

D O I：

10.1137/0915040

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Numerical experiments have shown that two-level Schwarz methods often perform very well even if the overlap between neighboring subregions is quite small. This is true to an even greater extent for a related algorithm, due to Barry Smith, where a Schwarz algorithm is applied to the reduced linear system of equations that remains after the variables interior to the subregions have been eliminated. In this paper, a supporting theory is developed.

引用

页码：604 / 620

页数：17

共 62 条

[31] DRYJA M, 1993, 626 NEW YORK U COUR
[32] DRYJA M, 1990, 3RD INT S DOM DEC ME
[33] GLOWINSKI R, 1991, 4TBH INT S DOM DEC M
[34] GLOWINSKI R, 1988, 1ST P INT S DOM DEC
[35] Grisvard P., 1985, ELLIPTIC PROBLEMS NO, V24
[36] GROPP WD, 1992, IN PRESS 6TH P INT S
[37] ILIN VP, 1969, AM MATH SOC TRANSL, V81, P91
[38] Lions JL., 1972, NONHOMOGENEOUS BOUND, V1
[39] SCHWARZ ALTERNATING AND ITERATIVE REFINEMENT METHODS FOR MIXED FORMULATIONS OF ELLIPTIC PROBLEMS .1. ALGORITHMS AND NUMERICAL RESULTS
MATHEW, TP
[J]. NUMERISCHE MATHEMATIK, 1993, 65 (04) : 445 - 468
[40] SCHWARZ ALTERNATING AND ITERATIVE REFINEMENT METHODS FOR MIXED FORMULATIONS OF ELLIPTIC PROBLEMS .2. CONVERGENCE THEORY
MATHEW, TP
[J]. NUMERISCHE MATHEMATIK, 1993, 65 (04) : 469 - 492

← 1 2 3 4 5 6 7 →