Maximum-principle-satisfying second-order Intrusive Polynomial Moment scheme

J. Kusch, G. Alldredge, M. Frank
{"title":"Maximum-principle-satisfying second-order Intrusive Polynomial Moment scheme","authors":"J. Kusch, G. Alldredge, M. Frank","doi":"10.5802/SMAI-JCM.42","DOIUrl":null,"url":null,"abstract":"Using standard intrusive techniques when solving hyperbolic conservation laws with uncertainties can lead to oscillatory solutions as well as nonhyperbolic moment systems. The Intrusive Polynomial Moment (IPM) method ensures hyperbolicity of the moment system while restricting oscillatory over- and undershoots of specified bounds. In this contribution, we derive a second-order discretization of the IPM moment system which fulfills the maximum principle. This task is carried out by investigating violations of the specified bounds due to the errors from the numerical optimization required by the scheme. This analysis gives weaker conditions on the entropy that is used, allowing the choice of an entropy which enables choosing the exact minimal and maximal value of the initial condition as bounds. Solutions calculated with the derived scheme are nonoscillatory while fulfilling the maximum principle. The second-order accuracy of our scheme leads to significantly reduced numerical costs.","PeriodicalId":376888,"journal":{"name":"The SMAI journal of computational mathematics","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The SMAI journal of computational mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5802/SMAI-JCM.42","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

Abstract

Using standard intrusive techniques when solving hyperbolic conservation laws with uncertainties can lead to oscillatory solutions as well as nonhyperbolic moment systems. The Intrusive Polynomial Moment (IPM) method ensures hyperbolicity of the moment system while restricting oscillatory over- and undershoots of specified bounds. In this contribution, we derive a second-order discretization of the IPM moment system which fulfills the maximum principle. This task is carried out by investigating violations of the specified bounds due to the errors from the numerical optimization required by the scheme. This analysis gives weaker conditions on the entropy that is used, allowing the choice of an entropy which enables choosing the exact minimal and maximal value of the initial condition as bounds. Solutions calculated with the derived scheme are nonoscillatory while fulfilling the maximum principle. The second-order accuracy of our scheme leads to significantly reduced numerical costs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
满足最大原理的二阶干涉多项式矩格式
在求解具有不确定性的双曲守恒律时,使用标准的侵入技术可以得到振荡解以及非双曲力矩系统。干涉多项式矩(IPM)方法保证了矩系统的双曲性,同时限制了给定边界上的振荡过冲和欠冲。在这篇贡献中,我们导出了IPM力矩系统的二阶离散化,它满足极大值原理。这项任务是通过调查由于方案所要求的数值优化误差而导致的对指定边界的违反来完成的。该分析给出了所使用的熵的较弱条件,允许选择熵,从而可以选择初始条件的精确最小值和最大值作为边界。用导出的格式计算的解在满足极大值原理的情况下是无振荡的。该方案的二阶精度显著降低了数值成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Hybrid high-order methods for flow simulations in extremely large discrete fracture networks A family of second-order dissipative finite volume schemes for hyperbolic systems of conservation laws Parallel kinetic scheme for transport equations in complex toroidal geometry Initialization of the Circulant Embedding method to speed up the generation of Gaussian random fields Error Guarantees for Least Squares Approximation with Noisy Samples in Domain Adaptation
×
引用
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