A MULTI-GRID ALGORITHM FOR MIXED PROBLEMS WITH PENALTY BY C°-PIECEWISE LINEAR ELEMENT APPROXIMATION  

作　　者：黄自萍 

出　　处：《Numerical Mathematics A Journal of Chinese Universities(English Series)》1997年第2期121-131,共11页

基　　金：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.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 bounded away from 1 independently of the meshsize. For convenience, we only discuss Jacobi relaxation as smoothing operator in detail.

关 键 词：Multi-grid ALGORITHM MIXED problem problems with PENALTY linear ELEMENT approxi mation. 

分 类 号：O241.5[理学—计算数学]