双曲问题的一阶贪婪无域保留逼近:标量守恒定律和 p 系统

IF 2.8 2区 数学 Q1 MATHEMATICS, APPLIED Journal of Scientific Computing Pub Date : 2024-06-27 DOI:10.1007/s10915-024-02592-4
Jean-Luc Guermond, Matthias Maier, Bojan Popov, Laura Saavedra, Ignacio Tomas
{"title":"双曲问题的一阶贪婪无域保留逼近:标量守恒定律和 p 系统","authors":"Jean-Luc Guermond, Matthias Maier, Bojan Popov, Laura Saavedra, Ignacio Tomas","doi":"10.1007/s10915-024-02592-4","DOIUrl":null,"url":null,"abstract":"<p>The paper focuses on first-order invariant-domain preserving approximations of hyperbolic systems. We propose a new way to estimate the artificial viscosity that has to be added to make explicit, conservative, consistent numerical methods invariant-domain preserving and entropy inequality compliant. Instead of computing an upper bound on the maximum wave speed in Riemann problems, we estimate a minimum wave speed in the said Riemann problems such that the approximation satisfies predefined invariant-domain properties and predefined entropy inequalities. This technique eliminates non-essential fast waves from the construction of the artificial viscosity, while preserving pre-assigned invariant-domain properties and entropy inequalities.</p>","PeriodicalId":50055,"journal":{"name":"Journal of Scientific Computing","volume":"14 1","pages":""},"PeriodicalIF":2.8000,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"First-Order Greedy Invariant-Domain Preserving Approximation for Hyperbolic Problems: Scalar Conservation Laws, and p-System\",\"authors\":\"Jean-Luc Guermond, Matthias Maier, Bojan Popov, Laura Saavedra, Ignacio Tomas\",\"doi\":\"10.1007/s10915-024-02592-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The paper focuses on first-order invariant-domain preserving approximations of hyperbolic systems. We propose a new way to estimate the artificial viscosity that has to be added to make explicit, conservative, consistent numerical methods invariant-domain preserving and entropy inequality compliant. Instead of computing an upper bound on the maximum wave speed in Riemann problems, we estimate a minimum wave speed in the said Riemann problems such that the approximation satisfies predefined invariant-domain properties and predefined entropy inequalities. This technique eliminates non-essential fast waves from the construction of the artificial viscosity, while preserving pre-assigned invariant-domain properties and entropy inequalities.</p>\",\"PeriodicalId\":50055,\"journal\":{\"name\":\"Journal of Scientific Computing\",\"volume\":\"14 1\",\"pages\":\"\"},\"PeriodicalIF\":2.8000,\"publicationDate\":\"2024-06-27\",\"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-02592-4\",\"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-02592-4","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

本文的重点是双曲系统的一阶不变域保持近似。我们提出了一种估算人工粘度的新方法,这种方法必须添加人工粘度,才能使显式、保守、一致的数值方法保持不变域和符合熵不等式。我们不是计算黎曼问题中最大波速的上限,而是估计上述黎曼问题中的最小波速,从而使近似满足预定义的不变域属性和预定义的熵不等式。这种技术在构建人工粘性时消除了非必要的快波,同时保留了预先指定的不变域属性和熵不等式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
First-Order Greedy Invariant-Domain Preserving Approximation for Hyperbolic Problems: Scalar Conservation Laws, and p-System

The paper focuses on first-order invariant-domain preserving approximations of hyperbolic systems. We propose a new way to estimate the artificial viscosity that has to be added to make explicit, conservative, consistent numerical methods invariant-domain preserving and entropy inequality compliant. Instead of computing an upper bound on the maximum wave speed in Riemann problems, we estimate a minimum wave speed in the said Riemann problems such that the approximation satisfies predefined invariant-domain properties and predefined entropy inequalities. This technique eliminates non-essential fast waves from the construction of the artificial viscosity, while preserving pre-assigned invariant-domain properties and entropy inequalities.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
期刊最新文献
Nonlinear Hierarchical Matrix Factorization-Based Tensor Ring Approximation for Multi-dimensional Image Recovery Fully Discrete Finite Difference Schemes for the Fractional Korteweg-de Vries Equation Curvature-Dependent Elastic Bending Total Variation Model for Image Inpainting with the SAV Algorithm The Optimal Weights of Non-local Means for Variance Stabilized Noise Removal An HDG and CG Method for the Indefinite Time-Harmonic Maxwell’s Equations Under Minimal Regularity
×
引用
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