On the Consistency Analysis of Finite Difference Approximations
- 22 Downloads
Finite difference schemes are widely used in applied mathematics to numerically solve partial differential equations. However, for a given solution scheme, it is usually difficult to evaluate the quality of the underlying finite difference approximation with respect to the inheritance of algebraic properties of the differential problem under consideration. In this paper, we present an appropriate quality criterion of strong consistency for finite difference approximations to systems of nonlinear partial differential equations. This property strengthens the standard requirement of consistency of difference equations with differential ones. We use a verification algorithm for strong consistency, which is based on the computation of difference Gröbner bases. This allows for the evaluation and construction of solution schemes that preserve some fundamental algebraic properties of the system at the discrete level. We demonstrate the suggested approach by simulating a Kármán vortex street for the two-dimensional incompressible viscous flow described by the Navier–Stokes equations.
Unable to display preview. Download preview PDF.
- 1.P. Amodio, Yu. A. Blinkov, V. P. Gerdt, and R. La Scala, “On consistency of finite difference approximations to the Navier–Stokes equations,” in: V. P. Gerdt, W. Koepff, E. W. Mayr, and E. V. Vorozhtsov (eds.), Computer Algebra in Scientific Computing / CASC 2013, Lecture Notes Comput. Sci., 8136, Springer, Cham (2013), pp. 46–60.Google Scholar
- 4.T. Becker and V. Weispfenning, A Computational Approach to Commutative Algebra, Springer, New York (1993).Google Scholar
- 5.Yu. A. Blinkov, C. F. Cid, V. P. Gerdt, W. Plesken, and D. Robertz, “The MAPLE package Janet: II. Linear partial differential equations,” in: V. G. Ganzha, E. W. Mayr, and E. V. Vorozhtsov (eds.), Proceedings of the 6th International Workshop on Computer Algebra in Scientific Computing / CASC 2003, Technische Universit ät München (2003), pp. 41–54; the package Janet is freely available on the web page http://wwwb.math.rwth-aachen.de/Janet/.
- 6.D. Cox, J. Little, and D. O’Shie, Ideals, Varieties and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3rd edition, Springer, New York (2007).Google Scholar
- 8.V. P. Gerdt, “Consistency analysis of finite difference approximations to PDE systems,” in: G. Adam, J. Buša, and M. Hnatič (eds.), Mathematical Modeling in Computational Physics / MMCP 2011, Lecture Notes Comput. Sci., 7125, Springer, Berlin (2012), pp. 28–42.Google Scholar
- 10.V. P. Gerdt and Yu. A. Blinkov, “Involution and difference schemes for the Navier–Stokes equations,” in: V. P. Gerdt, E. W. Mayr, and E. V. Vorozhtsov (eds.), Computer Algebra in Scientific Computing / CASC 2009, Lecture Notes Comput. Sci., 5743, Springer, Berlin (2009), pp. 94–105.Google Scholar
- 12.V. P. Gerdt and D. Robertz, “Consistency of finite difference approximations for linear PDE systems and its algorithmic verification,” in: S. M. Watt (ed.), Proceedings of ISSAC 2010, Association for Computing Machinery (2010), pp. 53–59.Google Scholar
- 14.S. K. Godunov and V. S. Ryabenkii, Difference Schemes. An Introduction to the Underlying Theory, Elsevier, New York (1987).Google Scholar
- 16.E. Hubert, “Notes on triangular sets and triangulation-decomposition algorithms. II,” in: F. Winkler and U. Langer (eds.), Symbolic and Numerical Scientific Computation, Lecture Notes Comput. Sci., 2630, Springer, Berlin (2001), pp. 40–87.Google Scholar
- 17.T. Kármán, Aerodynamics, McGraw-Hill, New York (1963).Google Scholar
- 20.M. Lange-Hegermann, “DifferentialThomas,” freely available on the web page https://wwwb.math.rwth-aachen.de/thomasdecomposition/.
- 21.A. Levin, Difference Algebra, Springer (2008).Google Scholar
- 22.K. W. Morton and D. F. Mayers, Numerical Solution of Partial Differential Equations. An Introduction, Cambridge Univ. Press (2005).Google Scholar
- 23.F. Ollivier, “Standard bases of differential ideals,” in: S. Sakata (ed.), Applied Algebra. Algebraic Algorithms and Error-Correcting Codes/AAECC’90, Lecture Notes Comput. Sci., 508, Springer, London (1990), pp. 304–321.Google Scholar
- 24.D. Robertz, Formal Algorithmic Elimination for PDEs, Springer, Berlin (2014).Google Scholar
- 25.D. Robertz, LDA (Linear Difference Algebra), Aachen (2015), freely available on the web page http://126.96.36.199/Janet/.
- 28.Yu. I. Shokin, “On conservatism of difference schemes of gas dynamics,” in: F. G. Zhuang and Y. L. Zhu (eds.), Tenth International Conference on Numerical Methods in Fluid Dynamics, Lecture Notes Physics, 264, Springer, Berlin (1986), pp. 578–583.Google Scholar
- 30.J. C. Strikwerda, Finite Difference Schemes and Partial Differential Equations, 2nd edition, SIAM, Philadelphia (2004).Google Scholar
- 31.J. M. Thomas, Differential Systems, AMS Colloquium Publications, XXI (1937); Systems and Roots, The Wylliam Byrd Press, Rychmond, Virginia (1962).Google Scholar
- 32.J. W. Thomas, Numerical Partial Differential Equations: Finite Difference Methods, 2nd edition, Springer, New York (1998).Google Scholar
- 33.D. V. Trushin, Difference Nullstellensatz, arXiv:0908.3865[math.AC] (2011).Google Scholar
- 34.A. Zobnin, “Admissible orderings and finiteness criteria for differential standard bases,” in: M. Kauers (ed.), Proceedings of ISSAC 2005, Association for Computing Machinery (2010), pp. 365–372.Google Scholar