Multigrid Multi-Level Domain Decomposition

Authors

  • Sheng Zhang
  • Hong-Ci Huang Computing Center, Academia Sinica, Beijing, China

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}}$ .

Published

1991-09-01

Abstract View

  • 35569

Pdf View

  • 3632

Issue

Section

Articles

How to Cite

Multigrid Multi-Level Domain Decomposition. (1991). Journal of Computational Mathematics, 9(1), 17-27. https://www.global-sci.com/index.php/JCM/article/view/11010