PARALLEL SCHWARZ ALGORITHM WITH UNDER-RELAXED PSEUDO-BOUNDARY CONDITIONS IN DOMAIN DECOMPOSITION METHOD

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.
Publisher
GORDON BREACH SCI PUBL LTD
Issue Date
1993
Language
ENG
Citation

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, v.48, no.3-4, pp.203 - 218

ISSN
0020-7160
URI
http://hdl.handle.net/10203/58379
Appears in Collection
NE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 136
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0