A dual iterative substructuring method with a penalty term

Cited 8 time in webofscience Cited 0 time in scopus
  • Hit : 253
  • Download : 0
An iterative substructuring method with Lagrange multipliers is considered for second order elliptic problems, which is a variant of the FETI-DP method. The standard FETI-DP formulation is associated with the saddle-point problem which is induced from the minimization problem with a constraint for imposing the continuity across the interface. Starting from the slightly changed saddle-point problem by addition of a penalty term with a positive penalization parameter eta, we propose a dual substructuring method which is implemented iteratively by the conjugate gradient method. In spite of the absence of any preconditioners, it is shown that the proposed method is numerically scalable in the sense that for a large value of eta, the condition number of the resultant dual problem is bounded by a constant independent of both the subdomain size H and the mesh size h. Computational issues and numerical results are presented.
Publisher
SPRINGER
Issue Date
2009-03
Language
English
Article Type
Article
Citation

NUMERISCHE MATHEMATIK, v.112, no.1, pp.89 - 113

ISSN
0029-599X
DOI
10.1007/s00211-008-0202-6
URI
http://hdl.handle.net/10203/98652
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 8 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0