DC Field | Value | Language |
---|---|---|
dc.contributor.author | KIM, YH | ko |
dc.contributor.author | Cho, Nam-Zin | ko |
dc.date.accessioned | 2013-02-25T00:24:27Z | - |
dc.date.available | 2013-02-25T00:24:27Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1993 | - |
dc.identifier.citation | INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, v.48, no.3-4, pp.203 - 218 | - |
dc.identifier.issn | 0020-7160 | - |
dc.identifier.uri | http://hdl.handle.net/10203/58379 | - |
dc.description.abstract | The parallel Schwarz algorithm for solving partial differential equations in a two-subdomain case and its convergence feature are summarized. Under-relaxation in pseudo-boundary conditions as an acceleration scheme is introduced and its convergence is analyzed in this paper. In addition, several iteration strategies which exploit the attractive feature of the under-relaxation scheme in pseudo-boundary conditions are investigated via numerical experiments. The results show that superlinear speedup can easily be obtained if adequate iteration strategies are adopted. | - |
dc.language | English | - |
dc.publisher | GORDON BREACH SCI PUBL LTD | - |
dc.title | PARALLEL SCHWARZ ALGORITHM WITH UNDER-RELAXED PSEUDO-BOUNDARY CONDITIONS IN DOMAIN DECOMPOSITION METHOD | - |
dc.type | Article | - |
dc.identifier.wosid | A1993MJ42300008 | - |
dc.identifier.scopusid | 2-s2.0-0027848331 | - |
dc.type.rims | ART | - |
dc.citation.volume | 48 | - |
dc.citation.issue | 3-4 | - |
dc.citation.beginningpage | 203 | - |
dc.citation.endingpage | 218 | - |
dc.citation.publicationname | INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | - |
dc.contributor.localauthor | Cho, Nam-Zin | - |
dc.contributor.nonIdAuthor | KIM, YH | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | SAP (SCHWARZ ALTERNATING PROCEDURE) | - |
dc.subject.keywordAuthor | DOMAIN DECOMPOSITION | - |
dc.subject.keywordAuthor | PSEUDO-BOUNDARY UNDERRELAXATION, INNER OUTER ITERATIONS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.