Conservation Properties of Iterative Methods for Implicit Discretizations of Conservation Laws
(2022) In Journal of Scientific Computing 92(2).- Abstract
Conservation properties of iterative methods applied to implicit finite volume discretizations of nonlinear conservation laws are analyzed. It is shown that any consistent multistep or Runge-Kutta method is globally conservative. Further, it is shown that Newton’s method, Krylov subspace methods and pseudo-time iterations are globally conservative while the Jacobi and Gauss-Seidel methods are not in general. If pseudo-time iterations using an explicit Runge-Kutta method are applied to a locally conservative discretization, then the resulting scheme is also locally conservative. However, the corresponding numerical flux can be inconsistent with the conservation law. We prove an extension of the Lax-Wendroff theorem, which reveals that... (More)
Conservation properties of iterative methods applied to implicit finite volume discretizations of nonlinear conservation laws are analyzed. It is shown that any consistent multistep or Runge-Kutta method is globally conservative. Further, it is shown that Newton’s method, Krylov subspace methods and pseudo-time iterations are globally conservative while the Jacobi and Gauss-Seidel methods are not in general. If pseudo-time iterations using an explicit Runge-Kutta method are applied to a locally conservative discretization, then the resulting scheme is also locally conservative. However, the corresponding numerical flux can be inconsistent with the conservation law. We prove an extension of the Lax-Wendroff theorem, which reveals that numerical solutions based on these methods converge to weak solutions of a modified conservation law where the flux function is multiplied by a particular constant. This constant depends on the choice of Runge-Kutta method but is independent of both the conservation law and the discretization. Consistency is maintained by ensuring that this constant equals unity and a strategy for achieving this is presented. Simulations show that this strategy improves the convergence rate of the pseudo-time iterations. Experiments with GMRES suggest that it also suffers from inconsistency but that this is automatically accounted for after some finite number of iterations. Similar experiments with coarse grid corrections based on agglomeration indicate no inconsistency.
(Less)
- author
- Birken, Philipp LU and Linders, Viktor LU
- organization
- publishing date
- 2022
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- Conservation laws, Conservative numerical methods, Iterative methods, Lax-Wendroff theorem, Pseudo-time iterations
- in
- Journal of Scientific Computing
- volume
- 92
- issue
- 2
- article number
- 60
- publisher
- Springer
- external identifiers
-
- scopus:85133709060
- ISSN
- 0885-7474
- DOI
- 10.1007/s10915-022-01923-7
- language
- English
- LU publication?
- yes
- id
- 59be5b93-2603-4e9f-9b83-44c90ef2e423
- date added to LUP
- 2022-08-26 15:17:17
- date last changed
- 2023-04-05 20:02:14
@article{59be5b93-2603-4e9f-9b83-44c90ef2e423,
abstract = {{<p>Conservation properties of iterative methods applied to implicit finite volume discretizations of nonlinear conservation laws are analyzed. It is shown that any consistent multistep or Runge-Kutta method is globally conservative. Further, it is shown that Newton’s method, Krylov subspace methods and pseudo-time iterations are globally conservative while the Jacobi and Gauss-Seidel methods are not in general. If pseudo-time iterations using an explicit Runge-Kutta method are applied to a locally conservative discretization, then the resulting scheme is also locally conservative. However, the corresponding numerical flux can be inconsistent with the conservation law. We prove an extension of the Lax-Wendroff theorem, which reveals that numerical solutions based on these methods converge to weak solutions of a modified conservation law where the flux function is multiplied by a particular constant. This constant depends on the choice of Runge-Kutta method but is independent of both the conservation law and the discretization. Consistency is maintained by ensuring that this constant equals unity and a strategy for achieving this is presented. Simulations show that this strategy improves the convergence rate of the pseudo-time iterations. Experiments with GMRES suggest that it also suffers from inconsistency but that this is automatically accounted for after some finite number of iterations. Similar experiments with coarse grid corrections based on agglomeration indicate no inconsistency.</p>}},
author = {{Birken, Philipp and Linders, Viktor}},
issn = {{0885-7474}},
keywords = {{Conservation laws; Conservative numerical methods; Iterative methods; Lax-Wendroff theorem; Pseudo-time iterations}},
language = {{eng}},
number = {{2}},
publisher = {{Springer}},
series = {{Journal of Scientific Computing}},
title = {{Conservation Properties of Iterative Methods for Implicit Discretizations of Conservation Laws}},
url = {{http://dx.doi.org/10.1007/s10915-022-01923-7}},
doi = {{10.1007/s10915-022-01923-7}},
volume = {{92}},
year = {{2022}},
}