摘要
对带罚混合问题的变异Ｔａｙｌｏｒ－Ｈｏｏｄ元逼近给出了一种快速迭代过程．基本思想是把带罚混合问题（对称不定问题）转换成一个正定系统，并证明它具有与网格步长和罚项参数无关的有界条件数．采用共轭斜量法迭代求解这个系统，而每步的共轭斜量法迭代需要计算一个（二维）向量形式的Ｐｏｉｓｓｏｎ方程，它由多重网格法来近似计算．此算法对其它的满足ｉｎｆ－ｓｕｐ条件的有限元适用．
in this paper a fast iterative procedure for mixed problems with penalty by Taylor-Hood element approximation is presented. The original indefinite problem can be transformed into an equation involving a symmetric,positive definite, continuous system. It is proved that the condition number of the equation is bounded independently of the meshsize and of the penalty parameter. We use a conjugate gradient method to solve the equation. Each evaluation of one (CG) iterative step requires the solution of two discrete Poisson equations. This is done approximately using a multigrid algorithm. The generalization of the algorithm to the other elements, which satisfy the inf- sup condition, is discussed.
出处
《同济大学学报（自然科学版）》
EI
CAS
CSCD
1996年第2期168-173,共6页
Journal of Tongji University:Natural Science
基金
攀登计划
上海市高校青年教师基金
关键词
T-H元逼近
有限元
快速迭代法
带罚混合问题
Mixed problems with penalty
Taylor-Hood element approximation
Fast iterative procedure
