Year: 1991
Author: Sheng Zhang, Hong-Ci Huang
Journal of Computational Mathematics, Vol. 9 (1991), Iss. 1 : pp. 17–27
Abstract
The domain decomposition method in this paper is based on PCG (Preconditioned Conjugate Gradient method). If $N$ is the number of subdomains, the number of sub-problems solved parallelly in a PCG step is $\frac{4}{3}(1-\frac{1}{4^{\log N+1}})N$. The condition number of the preconditioned system does not exceed $O(1+\log N)^3$. It is completely independent of the mesh size. The number of iterations required, to decrease the energy norm of the error by a fixed factor, is proportional to $O(1+\log N)^{\frac{3}{2}}$ .
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/1991-JCM-9374
Journal of Computational Mathematics, Vol. 9 (1991), Iss. 1 : pp. 17–27
Published online: 1991-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 11