带罚混合问题在C^0－分片线性元逼近下多重网格法求解

Multi-grid Algorithm for Mixed Problems with Penalty by C￣0-piecewise Linear Element Approximation

对带罚混合问题的Ｃ０－分片线性元逼近提出了一个多重网格算法，并证明算法具有一个与网格步长无关的小于１的收盘率．为方便起见，我们仅对Ｊａｃｏｂｉ松弛作为先折算子进行讨论．

In this paper we describe a multigrid algorithm for mixed problems with penalty by the linear finite element approximation.It is proved that the convergence rate of the algoritlun is bounded away from 1 independently of the meshsize.For convenience,we only discuss Jacobi relaxation as smoothing operator in detail.