Preconditioners for the dual-primal FETI methods on nonmatching grids: Numerical study

Cited 4 time in webofscience Cited 0 time in scopus
  • Hit : 463
  • Download : 2
DC FieldValueLanguage
dc.contributor.authorChang, YWko
dc.contributor.authorKim, HHko
dc.contributor.authorLee, Chang-Ockko
dc.date.accessioned2009-02-16T09:02:19Z-
dc.date.available2009-02-16T09:02:19Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2006-03-
dc.identifier.citationCOMPUTERS & MATHEMATICS WITH APPLICATIONS, v.51, no.5, pp.697 - 712-
dc.identifier.issn0898-1221-
dc.identifier.urihttp://hdl.handle.net/10203/8502-
dc.description.abstractThe FETI-DP method is a substructuring method that uses Lagrange multipliers to match the continuity condition on the subdomain boundaries. For the FETI-DP method on nonmatching grids, two different formulations are known with respect to how to employ the mortar matching condition. Keeping step with the developments of the FETI-DP methods, a variety of preconditioners for the FETI-DP operator have been developed. However, there has not been any numerical study for the FETI-DP method, which compares those preconditioners on nonmatching grids while there have been a few papers for numerical study on the comparison of FETI preconditioners. Therefore, we present the numerical study of four different preconditioners for two-dimensional elliptic problems. The numerical results confirm the superiority of the preconditioner by Kim and Lee [1] for noncomparably nonmatching grids, while the superiority of the preconditioner by Dryja and Widlund [2] is confirmed for matching grids and comparably nonmatching grids. (C) 2006 Elsevier Ltd. All rights reserved.-
dc.description.sponsorshipThis work was partially supported by KRF-2001-041-D00038 and KOSEF R01-2000-00008.en
dc.languageEnglish-
dc.language.isoen_USen
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD-
dc.titlePreconditioners for the dual-primal FETI methods on nonmatching grids: Numerical study-
dc.typeArticle-
dc.identifier.wosid000238000600003-
dc.identifier.scopusid2-s2.0-33745949007-
dc.type.rimsART-
dc.citation.volume51-
dc.citation.issue5-
dc.citation.beginningpage697-
dc.citation.endingpage712-
dc.citation.publicationnameCOMPUTERS & MATHEMATICS WITH APPLICATIONS-
dc.embargo.liftdate9999-12-31-
dc.embargo.terms9999-12-31-
dc.contributor.localauthorLee, Chang-Ock-
dc.contributor.nonIdAuthorChang, YW-
dc.contributor.nonIdAuthorKim, HH-
dc.type.journalArticleArticle; Proceedings Paper-
dc.subject.keywordAuthorFETI-DP-
dc.subject.keywordAuthornonmatching grids-
dc.subject.keywordAuthormortar matching condition-
dc.subject.keywordAuthorpreconditioner-
dc.subject.keywordPlusDOMAIN DECOMPOSITION METHOD-
dc.subject.keywordPlusSUBSTRUCTURING METHOD-
dc.subject.keywordPlusELLIPTIC PROBLEMS-
dc.subject.keywordPlusCONVERGENCE-
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