A dual iterative substructuring method with a penalty term in three dimensions

Cited 4 time in webofscience Cited 0 time in scopus
  • Hit : 682
  • Download : 15
DC FieldValueLanguage
dc.contributor.authorLee, Chang-Ockko
dc.contributor.authorPark, Eun-Heeko
dc.date.accessioned2013-03-12T19:57:03Z-
dc.date.available2013-03-12T19:57:03Z-
dc.date.created2012-12-10-
dc.date.created2012-12-10-
dc.date.created2012-12-10-
dc.date.issued2012-11-
dc.identifier.citationCOMPUTERS & MATHEMATICS WITH APPLICATIONS, v.64, no.9, pp.2787 - 2805-
dc.identifier.issn0898-1221-
dc.identifier.urihttp://hdl.handle.net/10203/103354-
dc.description.abstractThe FETI-DP method is one of the most advanced dual substructuring methods, which introduces Lagrange multipliers to enforce the pointwise matching condition on the interface. In our previous work for two dimensional problems, a dual iterative substructuring method was proposed, which is a variant of the FETI-DP method based on the way to deal with the continuity constraint on the interface. The proposed method imposes the continuity not only by the pointwise matching condition on the interface but also by using a penalty term which measures the jump across the interface. In this paper, a dual substructuring method with a penalty term is extended to three dimensional problems. A penalty term with a penalization parameter eta is constructed by focusing on the geometric complexity of an interface in three dimensions caused by the coupling among adjacent subdomains. For a large eta, it is shown that the condition number of the resultant dual problem is bounded by a constant independent of both subdomain size H and mesh size h. From the implementational viewpoint of the proposed method, the difference from the FETI-DP method is to solve subdomain problems which contain a penalty term with a penalization parameter eta. To prevent a large penalization parameter from making subdomain problems ill-conditioned, special attention is paid to establish an optimal preconditioner with respect to a penalization parameter eta. Finally, numerical results are presented. Published by Elsevier Ltd-
dc.languageEnglish-
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD-
dc.titleA dual iterative substructuring method with a penalty term in three dimensions-
dc.typeArticle-
dc.identifier.wosid000310717300002-
dc.identifier.scopusid2-s2.0-84867337759-
dc.type.rimsART-
dc.citation.volume64-
dc.citation.issue9-
dc.citation.beginningpage2787-
dc.citation.endingpage2805-
dc.citation.publicationnameCOMPUTERS & MATHEMATICS WITH APPLICATIONS-
dc.identifier.doi10.1016/j.camwa.2012.04.011-
dc.embargo.liftdate9999-12-31-
dc.embargo.terms9999-12-31-
dc.contributor.localauthorLee, Chang-Ock-
dc.contributor.nonIdAuthorPark, Eun-Hee-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorAugmented Lagrangian-
dc.subject.keywordAuthorDual substructuring method-
dc.subject.keywordAuthorFETI-DP-
dc.subject.keywordAuthorPenalty term-
dc.subject.keywordPlusLINEAR MULTIPOINT CONSTRAINTS-
dc.subject.keywordPlusDOMAIN-DECOMPOSITION-
dc.subject.keywordPlusSOLVERS-
dc.subject.keywordPlusFETI-
dc.subject.keywordPlusCONVERGENCE-
dc.subject.keywordPlusALGORITHM-
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 4 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0