CSpace  > 计算数学与科学工程计算研究所
Cascadic multigrid methods for parabolic problems
Du Qiang2; Ming PingBing1
2008-08-01
发表期刊SCIENCE IN CHINA SERIES A-MATHEMATICS
ISSN1006-9283
卷号51期号:8页码:1415-1439
摘要In this paper, we consider the cascadic multigrid method for a parabolic type equation. Backward Euler approximation in time and linear finite element approximation in space are employed. A stability result is established under some conditions on the smoother. Using new and sharper estimates for the smoothers that reflect the precise dependence on the time step and the spatial mesh parameter, these conditions are verified for a number of popular smoothers. Optimal error bounds are derived for both smooth and non-smooth data. Iteration strategies guaranteeing both the optimal accuracy and the optimal complexity are presented.
关键词cascadic multigrid method parabolic problem finite element methods backward Euler scheme smoother stability optimal error order optimal complexity
DOI10.1007/s11425-008-0112-1
语种英语
WOS研究方向Mathematics
WOS类目Mathematics, Applied ; Mathematics
WOS记录号WOS:000258074400008
出版者SCIENCE PRESS
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/5527
专题计算数学与科学工程计算研究所
通讯作者Ming PingBing
作者单位1.Chinese Acad Sci, AMSS, Inst Computat Math & Sci Engn Comp, LSEC, Beijing 100190, Peoples R China
2.Penn State Univ, Dept Math, University Pk, PA 16802 USA
推荐引用方式
GB/T 7714
Du Qiang,Ming PingBing. Cascadic multigrid methods for parabolic problems[J]. SCIENCE IN CHINA SERIES A-MATHEMATICS,2008,51(8):1415-1439.
APA Du Qiang,&Ming PingBing.(2008).Cascadic multigrid methods for parabolic problems.SCIENCE IN CHINA SERIES A-MATHEMATICS,51(8),1415-1439.
MLA Du Qiang,et al."Cascadic multigrid methods for parabolic problems".SCIENCE IN CHINA SERIES A-MATHEMATICS 51.8(2008):1415-1439.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Du Qiang]的文章
[Ming PingBing]的文章
百度学术
百度学术中相似的文章
[Du Qiang]的文章
[Ming PingBing]的文章
必应学术
必应学术中相似的文章
[Du Qiang]的文章
[Ming PingBing]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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