A Multi-Grid Algorithm for Stokes Problem
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.
About this article
Abstract View
- 33825
Pdf View
- 3608
How to Cite
A Multi-Grid Algorithm for Stokes Problem. (2021). Journal of Computational Mathematics, 13(4), 291-305. https://global-sci.com/JCM/article/view/11184