Volume 13, Issue 4
A Multi-Grid Algorithm for Stokes Problem

Z. Huang

DOI:

J. Comp. Math., 13 (1995), pp. 291-305

Published online: 1995-08

Preview Full PDF 18 938
Export citation
  • Abstract

In this paper we describe a multi-grid algorithm for the penalty procedure of Stokes problem. It is proved that the convergence rate of the algorithm is bounded away from 1 independently of the meshsize. For convenience, we only discuss Jacobi relaxation as smoothing operator in detail.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-13-291, author = {}, title = {A Multi-Grid Algorithm for Stokes Problem}, journal = {Journal of Computational Mathematics}, year = {1995}, volume = {13}, number = {4}, pages = {291--305}, abstract = { In this paper we describe a multi-grid algorithm for the penalty procedure of Stokes problem. It is proved that the convergence rate of the algorithm is bounded away from 1 independently of the meshsize. For convenience, we only discuss Jacobi relaxation as smoothing operator in detail. }, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9271.html} }
TY - JOUR T1 - A Multi-Grid Algorithm for Stokes Problem JO - Journal of Computational Mathematics VL - 4 SP - 291 EP - 305 PY - 1995 DA - 1995/08 SN - 13 DO - http://dor.org/ UR - https://global-sci.org/intro/article_detail/jcm/9271.html KW - AB - In this paper we describe a multi-grid algorithm for the penalty procedure of Stokes problem. It is proved that the convergence rate of the algorithm is bounded away from 1 independently of the meshsize. For convenience, we only discuss Jacobi relaxation as smoothing operator in detail.
Z. Huang. (1970). A Multi-Grid Algorithm for Stokes Problem. Journal of Computational Mathematics. 13 (4). 291-305. doi:
Copy to clipboard
The citation has been copied to your clipboard