Year: 1995
Journal of Computational Mathematics, Vol. 13 (1995), Iss. 4 : pp. 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.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1995-JCM-9271
Journal of Computational Mathematics, Vol. 13 (1995), Iss. 4 : pp. 291–305
Published online: 1995-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 15