full
search.png

Search

close.png

Cancel

arrow
Volume 16, Issue 2
A Parallel Iterative Domain Decomposition Algorithm for Elliptic Problems

Daoqi Yang

J. Comp. Math., 16 (1998), pp. 141-151.

Published online: 1998-04

Preview Full PDF 2712 25616

Cited by

google scholar semantic scholar
Export citation
  • Abstract

An iterative nonoverlapping domain decomposition procedure is proposed and analyzed for linear elliptic problems. At the interface of two subdomains, one subdomain problem requires that Dirichlet data be passed to it from the previous iteration level, while the other subdomain problem requires that Neumann data be passed to it. This procedure is suitable for parallel processing. A convergence analysis is established. Standard and mixed finite element methods are employed to give discrete versions of this domain decomposition algorithm. Numerical experiments are conducted to show the effectiveness of the method.

  • Keywords

Domain decomposition methods, finite element methods, parallel computing.

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-16-141, author = {Yang , Daoqi}, title = {A Parallel Iterative Domain Decomposition Algorithm for Elliptic Problems}, journal = {Journal of Computational Mathematics}, year = {1998}, volume = {16}, number = {2}, pages = {141--151}, abstract = {

An iterative nonoverlapping domain decomposition procedure is proposed and analyzed for linear elliptic problems. At the interface of two subdomains, one subdomain problem requires that Dirichlet data be passed to it from the previous iteration level, while the other subdomain problem requires that Neumann data be passed to it. This procedure is suitable for parallel processing. A convergence analysis is established. Standard and mixed finite element methods are employed to give discrete versions of this domain decomposition algorithm. Numerical experiments are conducted to show the effectiveness of the method.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9148.html} }
TY - JOUR T1 - A Parallel Iterative Domain Decomposition Algorithm for Elliptic Problems AU - Yang , Daoqi JO - Journal of Computational Mathematics VL - 2 SP - 141 EP - 151 PY - 1998 DA - 1998/04 SN - 16 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/9148.html KW - Domain decomposition methods, finite element methods, parallel computing. AB -

An iterative nonoverlapping domain decomposition procedure is proposed and analyzed for linear elliptic problems. At the interface of two subdomains, one subdomain problem requires that Dirichlet data be passed to it from the previous iteration level, while the other subdomain problem requires that Neumann data be passed to it. This procedure is suitable for parallel processing. A convergence analysis is established. Standard and mixed finite element methods are employed to give discrete versions of this domain decomposition algorithm. Numerical experiments are conducted to show the effectiveness of the method.

Yang , Daoqi. (1998). A Parallel Iterative Domain Decomposition Algorithm for Elliptic Problems. Journal of Computational Mathematics. 16 (2). 141-151. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard