Efficient computation of Jacobian matrices for entropy stable summation-by-parts schemes

06/12/2020 ∙ by Jesse Chan, et al. ∙ 0

Entropy stable schemes replicate an entropy inequality at the semi-discrete level. These schemes rely on an algebraic summation-by-parts (SBP) structure and a technique referred to as flux differencing. We provide simple and efficient formulas for Jacobian matrices for the semi-discrete systems of ODEs produced by entropy stable discretizations. These formulas are derived based on the structure of flux differencing and derivatives of flux functions, which can be computed using automatic differentiation (AD). Numerical results demonstrate the efficiency and utility of these Jacobian formulas, which are then used in the context of two-derivative explicit time-stepping schemes and implicit time-stepping.



There are no comments yet.


This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.