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