三角形上高阶有限元的均匀子结构预处理以及节点基函数的影响

IF 2.8 2区 数学 Q1 MATHEMATICS, APPLIED SIAM Journal on Numerical Analysis Pub Date : 2024-07-01 DOI:10.1137/23m1561920
Mark Ainsworth, Shuai Jiang
{"title":"三角形上高阶有限元的均匀子结构预处理以及节点基函数的影响","authors":"Mark Ainsworth, Shuai Jiang","doi":"10.1137/23m1561920","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Numerical Analysis, Volume 62, Issue 4, Page 1465-1491, August 2024. <br/> Abstract. A robust substructuring type preconditioner is developed for high order approximation of problem for which the element matrix takes the form [math] where [math] and [math] are the mass and stiffness matrices, respectively. A standard preconditioner for the pure stiffness matrix results in a condition number bounded by [math] where [math] blows up as [math]. It is shown that the best uniform bound in [math] that one can hope for is [math]. More precisely, we show that the upper envelope of the bound [math] is [math]. What, then, can be done to obtain a preconditioner that is robust for all [math]? The solution turns out to be a relatively minor modification of the basic substructuring algorithm of [I. Babuška et al., SIAM J. Numer. Anal., 28 (1991), pp. 624–661]: one can simply augment the preconditioner with a suitable Jacobi smoothener over the coarse grid degrees of freedom. This is shown to result in a condition number bounded by [math] where the constant is independent of [math]. Numerical results are given which shows that the simple expedient of augmentation with nodal smoothening reduces the condition number by a factor of up to two orders of magnitude.","PeriodicalId":49527,"journal":{"name":"SIAM Journal on Numerical Analysis","volume":"24 1","pages":""},"PeriodicalIF":2.8000,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Uniform Substructuring Preconditioners for High Order FEM on Triangles and the Influence of Nodal Basis Functions\",\"authors\":\"Mark Ainsworth, Shuai Jiang\",\"doi\":\"10.1137/23m1561920\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"SIAM Journal on Numerical Analysis, Volume 62, Issue 4, Page 1465-1491, August 2024. <br/> Abstract. A robust substructuring type preconditioner is developed for high order approximation of problem for which the element matrix takes the form [math] where [math] and [math] are the mass and stiffness matrices, respectively. A standard preconditioner for the pure stiffness matrix results in a condition number bounded by [math] where [math] blows up as [math]. It is shown that the best uniform bound in [math] that one can hope for is [math]. More precisely, we show that the upper envelope of the bound [math] is [math]. What, then, can be done to obtain a preconditioner that is robust for all [math]? The solution turns out to be a relatively minor modification of the basic substructuring algorithm of [I. Babuška et al., SIAM J. Numer. Anal., 28 (1991), pp. 624–661]: one can simply augment the preconditioner with a suitable Jacobi smoothener over the coarse grid degrees of freedom. This is shown to result in a condition number bounded by [math] where the constant is independent of [math]. Numerical results are given which shows that the simple expedient of augmentation with nodal smoothening reduces the condition number by a factor of up to two orders of magnitude.\",\"PeriodicalId\":49527,\"journal\":{\"name\":\"SIAM Journal on Numerical Analysis\",\"volume\":\"24 1\",\"pages\":\"\"},\"PeriodicalIF\":2.8000,\"publicationDate\":\"2024-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM Journal on Numerical Analysis\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1137/23m1561920\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Numerical Analysis","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/23m1561920","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

SIAM 数值分析期刊》第 62 卷第 4 期第 1465-1491 页,2024 年 8 月。 摘要。针对元素矩阵为 [math] 形式(其中 [math] 和 [math] 分别为质量矩阵和刚度矩阵)的高阶近似问题,开发了一种鲁棒次结构类型预处理。纯刚度矩阵的标准预处理会导致条件数以[math]为界,其中[math]会以[math]的形式爆炸。结果表明,[math] 的最佳统一约束是 [math]。更准确地说,我们证明了[math]边界的上包络是[math]。那么,怎样才能获得对所有 [math] 都稳健的预处理呢?答案是对[I. Babuška et al., SIAM J. Numer. Anal., 28 (1991), pp.结果表明,这将产生一个以 [math] 为界的条件数,其中常数与 [math] 无关。给出的数值结果表明,用节点平滑增强这一简单的权宜之计最多可将条件数降低两个数量级。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Uniform Substructuring Preconditioners for High Order FEM on Triangles and the Influence of Nodal Basis Functions
SIAM Journal on Numerical Analysis, Volume 62, Issue 4, Page 1465-1491, August 2024.
Abstract. A robust substructuring type preconditioner is developed for high order approximation of problem for which the element matrix takes the form [math] where [math] and [math] are the mass and stiffness matrices, respectively. A standard preconditioner for the pure stiffness matrix results in a condition number bounded by [math] where [math] blows up as [math]. It is shown that the best uniform bound in [math] that one can hope for is [math]. More precisely, we show that the upper envelope of the bound [math] is [math]. What, then, can be done to obtain a preconditioner that is robust for all [math]? The solution turns out to be a relatively minor modification of the basic substructuring algorithm of [I. Babuška et al., SIAM J. Numer. Anal., 28 (1991), pp. 624–661]: one can simply augment the preconditioner with a suitable Jacobi smoothener over the coarse grid degrees of freedom. This is shown to result in a condition number bounded by [math] where the constant is independent of [math]. Numerical results are given which shows that the simple expedient of augmentation with nodal smoothening reduces the condition number by a factor of up to two orders of magnitude.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
4.80
自引率
6.90%
发文量
110
审稿时长
4-8 weeks
期刊介绍: SIAM Journal on Numerical Analysis (SINUM) contains research articles on the development and analysis of numerical methods. Topics include the rigorous study of convergence of algorithms, their accuracy, their stability, and their computational complexity. Also included are results in mathematical analysis that contribute to algorithm analysis, and computational results that demonstrate algorithm behavior and applicability.
期刊最新文献
On the Existence of Minimizers in Shallow Residual ReLU Neural Network Optimization Landscapes A Domain Decomposition Method for Stochastic Evolution Equations New Time Domain Decomposition Methods for Parabolic Optimal Control Problems II: Neumann–Neumann Algorithms The Mean-Field Ensemble Kalman Filter: Near-Gaussian Setting The Lanczos Tau Framework for Time-Delay Systems: Padé Approximation and Collocation Revisited
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1