A multi-grid algorithm for mixed problems with penalty

Summary In this paper we describe a multi-grid algorithm for the finite element approximation of mixed problems with penalty by the MINI-element. It is proved that the convergence rate of the algorithm is bounded away from 1 independently of the meshsize and of the penalty parameter. For convenience, we only discuss Jacobi relaxation as smoothing operator in detail.The paper was written during the author's stay at the Ruhr-Universität Bochum and revised by D. Braess after the author's return to China