首页 | 本学科首页   官方微博 | 高级检索  
     


An Adaptive Mesh-Refining Algorithm Allowing for an H1 StableL2 Projection onto Courant Finite Element Spaces
Authors:Carsten?Carstensen  author-information"  >  author-information__contact u-icon-before"  >  mailto:carsten.carstensen@tuwien.ac.at"   title="  carsten.carstensen@tuwien.ac.at"   itemprop="  email"   data-track="  click"   data-track-action="  Email author"   data-track-label="  "  >Email author
Affiliation:(1) Institute for Applied Mathematics and Numerical Analysis, Vienna University of Technology, Wiedner Hauptstrasse 8-10, A-1040 Vienna, Austria
Abstract:Suppose $cal{S}^1({cal T})subset H^1(Omega)$ is the $P_1$-finite elementspace of $cal{T}$-piecewise affine functions based on a regular triangulation $cal{T}$ of a two-dimensional surface$Omega$ into triangles.The $L^2$ projection $Pi$ onto $cal{S}^1(cal{T})$ is $H^1$ stableif $norm{Pi v}{H^1(Omega)}le Cnorm{v}{H^1(Omega)}$ forall $v$ in the Sobolev space $H^1(Omega)$ and if the bound $C$does not depend on the mesh-size in $cal{T}$ or on thedimension of $cal{S}^1(cal{T})$.hskip 1em A red–green–blue refining adaptive algorithm is designed whichrefines a coarse mesh $cal{T}_0$ successively such that each triangle isdivided into one, two, three, or four subtriangles. This is the newest vertex bisection supplemented with possible red refinementsbased on a careful initialization.The resulting finite element space allows for an $H^1$ stable $L^2$ projection.The stabilitybound $C$ depends only on the coarse mesh $cal{T}_0$ through the number ofunknowns, the shapes of the triangles in $cal{T}_0$, and possibleDirichlet boundary conditions. Our arguments alsoprovide a discrete version $norm{h_cal{T}^{-1},Pi v}{L^2(Omega)}le Cnorm{h_cal{T}^{-1},v}{L^2(Omega)}$in $L^2$ norms weighted with the mesh-size $h_T$.
Keywords:Finite element method  L2 Projection  H1 Stability  Adaptive algorithm  Newest-vertex bisection
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号