多维分项求和算子的三角形和正四面体正交规则

IF 2.8 2区 数学 Q1 MATHEMATICS, APPLIED
Zelalem Arega Worku, Jason E. Hicken, David W. Zingg
{"title":"多维分项求和算子的三角形和正四面体正交规则","authors":"Zelalem Arega Worku, Jason E. Hicken, David W. Zingg","doi":"10.1007/s10915-024-02656-5","DOIUrl":null,"url":null,"abstract":"<p>Multidimensional diagonal-norm summation-by-parts (SBP) operators with collocated volume and facet nodes, known as diagonal-<span>\\( \\textsf{E}\\)</span> operators, are attractive for entropy-stable discretizations from an efficiency standpoint. However, there is a limited number of such operators, and those currently in existence often have a relatively high node count for a given polynomial order due to a scarcity of suitable quadrature rules. We present several new symmetric positive-weight quadrature rules on triangles and tetrahedra that are suitable for construction of diagonal-<span>\\( \\textsf{E}\\)</span> SBP operators. For triangles, quadrature rules of degree one through twenty with facet nodes that correspond to the Legendre-Gauss-Lobatto and Legendre-Gauss quadrature rules are derived. For tetrahedra, quadrature rules of degree one through ten are presented along with the corresponding facet quadrature rules. All of the quadrature rules are provided in a supplementary data repository. The quadrature rules are used to construct novel SBP diagonal-<span>\\( \\textsf{E}\\)</span> operators, whose accuracy and maximum time-step restrictions are studied numerically.</p>","PeriodicalId":50055,"journal":{"name":"Journal of Scientific Computing","volume":null,"pages":null},"PeriodicalIF":2.8000,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Quadrature Rules on Triangles and Tetrahedra for Multidimensional Summation-By-Parts Operators\",\"authors\":\"Zelalem Arega Worku, Jason E. Hicken, David W. Zingg\",\"doi\":\"10.1007/s10915-024-02656-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Multidimensional diagonal-norm summation-by-parts (SBP) operators with collocated volume and facet nodes, known as diagonal-<span>\\\\( \\\\textsf{E}\\\\)</span> operators, are attractive for entropy-stable discretizations from an efficiency standpoint. However, there is a limited number of such operators, and those currently in existence often have a relatively high node count for a given polynomial order due to a scarcity of suitable quadrature rules. We present several new symmetric positive-weight quadrature rules on triangles and tetrahedra that are suitable for construction of diagonal-<span>\\\\( \\\\textsf{E}\\\\)</span> SBP operators. For triangles, quadrature rules of degree one through twenty with facet nodes that correspond to the Legendre-Gauss-Lobatto and Legendre-Gauss quadrature rules are derived. For tetrahedra, quadrature rules of degree one through ten are presented along with the corresponding facet quadrature rules. All of the quadrature rules are provided in a supplementary data repository. The quadrature rules are used to construct novel SBP diagonal-<span>\\\\( \\\\textsf{E}\\\\)</span> operators, whose accuracy and maximum time-step restrictions are studied numerically.</p>\",\"PeriodicalId\":50055,\"journal\":{\"name\":\"Journal of Scientific Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.8000,\"publicationDate\":\"2024-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Scientific Computing\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10915-024-02656-5\",\"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":"Journal of Scientific Computing","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10915-024-02656-5","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

多维对角正态逐部求和(SBP)算子具有共定位的体和面节点,被称为对角-( )算子,从效率的角度来看对熵稳定离散化具有吸引力。然而,此类算子的数量有限,而且由于合适的正交规则稀缺,目前存在的算子在给定多项式阶时节点数往往相对较多。我们在三角形和正四面体上提出了几种新的对称正重正交规则,这些规则适用于构造对角-(\textsf{E}\)SBP 算子。对于三角形,推导出了阶数为一到二十的正交规则,其面节点对应于 Legendre-Gauss-Lobatto 正交规则和 Legendre-Gauss 正交规则。对于正四面体,将给出阶数为一到十的正交规则以及相应的面正交规则。所有正交规则均在补充数据储存库中提供。正交规则用于构造新颖的 SBP 对角-(\textsf{E}\) 算子,对其精度和最大时步限制进行了数值研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Quadrature Rules on Triangles and Tetrahedra for Multidimensional Summation-By-Parts Operators

Quadrature Rules on Triangles and Tetrahedra for Multidimensional Summation-By-Parts Operators

Multidimensional diagonal-norm summation-by-parts (SBP) operators with collocated volume and facet nodes, known as diagonal-\( \textsf{E}\) operators, are attractive for entropy-stable discretizations from an efficiency standpoint. However, there is a limited number of such operators, and those currently in existence often have a relatively high node count for a given polynomial order due to a scarcity of suitable quadrature rules. We present several new symmetric positive-weight quadrature rules on triangles and tetrahedra that are suitable for construction of diagonal-\( \textsf{E}\) SBP operators. For triangles, quadrature rules of degree one through twenty with facet nodes that correspond to the Legendre-Gauss-Lobatto and Legendre-Gauss quadrature rules are derived. For tetrahedra, quadrature rules of degree one through ten are presented along with the corresponding facet quadrature rules. All of the quadrature rules are provided in a supplementary data repository. The quadrature rules are used to construct novel SBP diagonal-\( \textsf{E}\) operators, whose accuracy and maximum time-step restrictions are studied numerically.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Scientific Computing
Journal of Scientific Computing 数学-应用数学
CiteScore
4.00
自引率
12.00%
发文量
302
审稿时长
4-8 weeks
期刊介绍: Journal of Scientific Computing is an international interdisciplinary forum for the publication of papers on state-of-the-art developments in scientific computing and its applications in science and engineering. The journal publishes high-quality, peer-reviewed original papers, review papers and short communications on scientific computing.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信