A comparative study of iterative Riemann solvers for the shallow water and Euler equations

IF 1.9 3区 数学 Q1 MATHEMATICS, APPLIED Communications in Applied Mathematics and Computational Science Pub Date : 2023-12-21 DOI:10.2140/camcos.2023.18.107
Carlos Muñoz Moncayo, Manuel Quezada de Luna, David I. Ketcheson
{"title":"A comparative study of iterative Riemann solvers for the shallow water and Euler equations","authors":"Carlos Muñoz Moncayo, Manuel Quezada de Luna, David I. Ketcheson","doi":"10.2140/camcos.2023.18.107","DOIUrl":null,"url":null,"abstract":"<p>We investigate the achievable efficiency of exact solvers for the Riemann problem for two systems of first-order hyperbolic PDEs: the shallow water equations and the Euler equations of compressible gas dynamics. Many approximate solvers have been developed for these systems; exact solution algorithms have received less attention because the computation of the exact solution typically requires an iterative solution of algebraic equations, which can be expensive or unreliable. We investigate a range of iterative algorithms and initial guesses. In addition to existing algorithms, we propose simple new algorithms that are guaranteed to converge and to remain in the range of physically admissible values at all iterations. We apply the existing and new iterative schemes to an ensemble of test Riemann problems. For the shallow water equations, we find that Newton’s method with a simple modification converges quickly and reliably. For the Euler equations we obtain similar results; however, when the required precision is high, a combination of Ostrowski and Newton iterations converges faster. These solvers are slower than standard approximate solvers like Roe and HLLE, but come within a factor of two in speed. We also provide a preliminary comparison of the accuracy of a finite volume discretization using an exact solver versus standard approximate solvers. </p>","PeriodicalId":49265,"journal":{"name":"Communications in Applied Mathematics and Computational Science","volume":"19 1","pages":""},"PeriodicalIF":1.9000,"publicationDate":"2023-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Communications in Applied Mathematics and Computational Science","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2140/camcos.2023.18.107","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

We investigate the achievable efficiency of exact solvers for the Riemann problem for two systems of first-order hyperbolic PDEs: the shallow water equations and the Euler equations of compressible gas dynamics. Many approximate solvers have been developed for these systems; exact solution algorithms have received less attention because the computation of the exact solution typically requires an iterative solution of algebraic equations, which can be expensive or unreliable. We investigate a range of iterative algorithms and initial guesses. In addition to existing algorithms, we propose simple new algorithms that are guaranteed to converge and to remain in the range of physically admissible values at all iterations. We apply the existing and new iterative schemes to an ensemble of test Riemann problems. For the shallow water equations, we find that Newton’s method with a simple modification converges quickly and reliably. For the Euler equations we obtain similar results; however, when the required precision is high, a combination of Ostrowski and Newton iterations converges faster. These solvers are slower than standard approximate solvers like Roe and HLLE, but come within a factor of two in speed. We also provide a preliminary comparison of the accuracy of a finite volume discretization using an exact solver versus standard approximate solvers.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
浅水方程和欧拉方程的黎曼迭代求解器比较研究
我们研究了两个一阶双曲 PDE 系统(浅水方程和可压缩气体动力学欧拉方程)的黎曼问题精确求解器的可实现效率。针对这些系统已经开发了许多近似求解器;精确求解算法受到的关注较少,因为精确解的计算通常需要代数方程的迭代求解,而迭代求解可能成本高昂或不可靠。我们研究了一系列迭代算法和初始猜测。除现有算法外,我们还提出了简单的新算法,这些算法可保证在所有迭代过程中收敛并保持在物理可容许值范围内。我们将现有的和新的迭代方案应用于一系列测试黎曼问题。对于浅水方程,我们发现牛顿方法经过简单修改后就能快速可靠地收敛。对于欧拉方程,我们得到了类似的结果;然而,当要求的精度较高时,奥斯特洛夫斯基和牛顿迭代法的组合收敛速度更快。这些求解器比标准近似求解器(如 Roe 和 HLLE)慢,但速度不超过 2 倍。我们还初步比较了使用精确求解器和标准近似求解器进行有限体积离散化的精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Communications in Applied Mathematics and Computational Science
Communications in Applied Mathematics and Computational Science MATHEMATICS, APPLIED-PHYSICS, MATHEMATICAL
CiteScore
3.50
自引率
0.00%
发文量
3
审稿时长
>12 weeks
期刊介绍: CAMCoS accepts innovative papers in all areas where mathematics and applications interact. In particular, the journal welcomes papers where an idea is followed from beginning to end — from an abstract beginning to a piece of software, or from a computational observation to a mathematical theory.
期刊最新文献
Application of a fourth-order accurate finite-volume method with adaptive refinement in space and time to multifluid plasma simulations Bright-dark rogue wave transition in coupled AB system via the physics-informed neural networks method Multiderivative time integration methods preserving nonlinear functionals via relaxation Hopf bifurcation analysis of a phage therapy model A source term method for Poisson problems with a discontinuous diffusion coefficient
×
引用
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