An optimally convergent adaptive mixed finite element method
Becker, Roland1; Mao, Shipeng2
刊名NUMERISCHE MATHEMATIK
2008-11-01
卷号111期号:1页码:35-54
ISSN号0029-599X
DOI10.1007/s00211-008-0180-8
英文摘要We prove convergence and optimal complexity of an adaptive mixed finite element algorithm, based on the lowest-order Raviart-Thomas finite element space. In each step of the algorithm, the local refinement is either performed using simple edge residuals or a data oscillation term, depending on an adaptive marking strategy. The inexact solution of the discrete system is controlled by an adaptive stopping criterion related to the estimator.
WOS研究方向Mathematics
语种英语
出版者SPRINGER
WOS记录号WOS:000260184800002
内容类型期刊论文
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/6045]  
专题计算数学与科学工程计算研究所
通讯作者Becker, Roland
作者单位1.Univ Pau, Lab Math Appl, F-64013 Pau, France
2.Chinese Acad Sci, Acad Math & Syst Sci, LSEC, Inst Computat Math & Sci Engn Comp, Beijing 100190, Peoples R China
推荐引用方式
GB/T 7714
Becker, Roland,Mao, Shipeng. An optimally convergent adaptive mixed finite element method[J]. NUMERISCHE MATHEMATIK,2008,111(1):35-54.
APA Becker, Roland,&Mao, Shipeng.(2008).An optimally convergent adaptive mixed finite element method.NUMERISCHE MATHEMATIK,111(1),35-54.
MLA Becker, Roland,et al."An optimally convergent adaptive mixed finite element method".NUMERISCHE MATHEMATIK 111.1(2008):35-54.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace