@Article{JCM-9-17,
author = {Zhang , Sheng and Huang , Hong-Ci},
title = {Multigrid Multi-Level Domain Decomposition},
journal = {Journal of Computational Mathematics},
year = {1991},
volume = {9},
number = {1},
pages = {17--27},
abstract = {<p style="text-align: justify;">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}}$ .</p>},
issn = {1991-7139},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jcm/9374.html}
}