Resolving Entropy Growth from Iterative Methods
arXiv:2302.13579 · doi:10.1007/s10543-023-00992-w
Abstract
We consider entropy conservative and dissipative discretizations of nonlinear conservation laws with implicit time discretizations and investigate the influence of iterative methods used to solve the arising nonlinear equations. We show that Newton's method can turn an entropy dissipative scheme into an anti-dissipative one, even when the iteration error is smaller than the time integration error. We explore several remedies, of which the most performant is a relaxation technique, originally designed to fix entropy errors in time integration methods. Thus, relaxation works well in consort with iterative solvers, provided that the iteration errors are on the order of the time integration method. To corroborate our findings, we consider Burgers' equation and nonlinear dispersive wave equations. We find that entropy conservation results in more accurate numerical solutions than non-conservative schemes, even when the tolerance is an order of magnitude larger.
arXiv comment25 pages, 6 figures
References in corpus (7)
- Relaxation Runge-Kutta Methods: Fully-Discrete Explicit Entropy-Stable Schemes for the Compressible Euler and Navier-Stokes Equations
- High-Order Implicit Time-Marching Methods Based on Generalized Summation-By-Parts Operators
- General Relaxation Methods for Initial-Value Problems with Application to Multistep Schemes
- Relaxation Runge-Kutta Methods for Hamiltonian Problems
- Fully-Discrete Explicit Locally Entropy-Stable Schemes for the Compressible Euler and Navier-Stokes Equations
- A Broad Class of Conservative Numerical Methods for Dispersive Wave Equations
- Some Notes on Summation by Parts Time Integration Methods