In this paper we describe a multi-grid algorithm for mixed problems with penalty by the linear finite element approximation. It is proved that the convergence rate of the algorithm is bound ed away from 1 independentl...In this paper we describe a multi-grid algorithm for mixed problems with penalty by the linear finite element approximation. It is proved that the convergence rate of the algorithm is bound ed away from 1 independently of the meshsize. For convenience, we only discuss Jacobi relaxation as smoothing operator in detail.展开更多
基金This work was supported by China State Major Key Project for Basic Researches
文摘In this paper we describe a multi-grid algorithm for mixed problems with penalty by the linear finite element approximation. It is proved that the convergence rate of the algorithm is bound ed away from 1 independently of the meshsize. For convenience, we only discuss Jacobi relaxation as smoothing operator in detail.