论文标题
对浅水和Euler方程的迭代riemann求解器的比较研究
A Comparative Study of Iterative Riemann Solvers for the Shallow Water and Euler Equations
论文作者
论文摘要
针对部分微分方程的一阶双曲系统的黎曼问题对于理论和数值目的都是至关重要的。已经为此类系统开发了许多近似求解器。精确的解决方案算法受到了较少的关注,因为精确解决方案的计算通常需要代数方程的迭代解决方案。迭代算法在某些情况下可能会效率较低,或者在某些情况下可能无法收敛。我们研究了相对简单的系统,重点是浅水和欧拉方程,请研究鲁棒迭代的Riemann求解器的可实现效率。我们考虑一系列最初的猜测和迭代方案,应用于测试Riemann问题的集合。对于浅水方程,我们发现牛顿的方法具有简单的修改,可以迅速可靠地收敛。对于Euler方程,我们获得了相似的结果;但是,当所需的精度很高时,Ostrowski和Newton Iterations的组合会更快地收敛。这些求解器比ROE和HLLE等标准近似求解器慢,但速度为两个。我们还提供了使用精确求解器与标准近似求解器的有限体积离散化精度的初步比较。
The Riemann problem for first-order hyperbolic systems of partial differential equations is of fundamental importance for both theoretical and numerical purposes. Many approximate solvers have been developed for such systems; exact solution algorithms have received less attention because computation of the exact solution typically requires iterative solution of algebraic equations. Iterative algorithms may be less computationally efficient or might fail to converge in some cases. We investigate the achievable efficiency of robust iterative Riemann solvers for relatively simple systems, focusing on the shallow water and Euler equations. We consider a range of initial guesses and iterative schemes applied 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.