CSpace
Local and parallel finite element algorithms based on two-grid discretizations
Xu, JC; Zhou, AH
2000-07-01
发表期刊MATHEMATICS OF COMPUTATION
ISSN0025-5718
卷号69期号:231页码:881-909
摘要A number of new local acid parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorithms are motivated by the observation that, for a solution to some elliptic problems, low frequency components can be approximated well by a relatively coarse grid and high frequency components can be computed on a fine grid by some local and parallel procedure. The theoretical tools for analyzing these methods are some local a priori and a posteriori estimates that are also obtained in this paper for finite element solutions on general shape-regular grids. Some numerical experiments are also presented to support the theory.
关键词adaptive finite elements local a priori and a posteriori error estimates nonsymmetric parallel algorithm two-grid method
语种英语
WOS研究方向Mathematics
WOS类目Mathematics, Applied
WOS记录号WOS:000087661200001
出版者AMER MATHEMATICAL SOC
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/15208
专题中国科学院数学与系统科学研究院
通讯作者Xu, JC
作者单位1.Penn State Univ, Dept Math, Ctr Computat Math & Applicat, University Pk, PA 16802 USA
2.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Xu, JC,Zhou, AH. Local and parallel finite element algorithms based on two-grid discretizations[J]. MATHEMATICS OF COMPUTATION,2000,69(231):881-909.
APA Xu, JC,&Zhou, AH.(2000).Local and parallel finite element algorithms based on two-grid discretizations.MATHEMATICS OF COMPUTATION,69(231),881-909.
MLA Xu, JC,et al."Local and parallel finite element algorithms based on two-grid discretizations".MATHEMATICS OF COMPUTATION 69.231(2000):881-909.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Xu, JC]的文章
[Zhou, AH]的文章
百度学术
百度学术中相似的文章
[Xu, JC]的文章
[Zhou, AH]的文章
必应学术
必应学术中相似的文章
[Xu, JC]的文章
[Zhou, AH]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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