Year: 1998
Author: Daoqi Yang
Journal of Computational Mathematics, Vol. 16 (1998), Iss. 2 : pp. 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.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1998-JCM-9148
Journal of Computational Mathematics, Vol. 16 (1998), Iss. 2 : pp. 141–151
Published online: 1998-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 11
Keywords: Domain decomposition methods finite element methods parallel computing.