Algorithmic Approach to Strong Consistency Analysis of Finite Difference Approximations to PDE Systems

DOI10.1145/3326229.3326255zbMath1467.35020arXiv1904.12912OpenAlexW2942960502MaRDI QIDQ5120488

Daniel Robertz, Vladimir P. Gerdt

Publication date: 10 September 2020

Published in: Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.12912

zbMATH Keywords

consistencyfinite difference approximationspartial differential equationsThomas decomposition

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Navier-Stokes equations (35Q30) Theoretical approximation in context of PDEs (35A35) Systems of nonlinear first-order PDEs (35F50)

Related Items (3)

Algorithms yield upper bounds in differential algebra ⋮ Recurrences for quadrilateral high-order finite elements ⋮ A new type of difference dimension polynomials

This page was built for publication: Algorithmic Approach to Strong Consistency Analysis of Finite Difference Approximations to PDE Systems