The influence of parasitic modes on "weakly'' unstable multi-step Finite Difference schemes
Abstract: Numerical analysis for linear constant-coefficients Finite Difference schemes was developed approximately fifty years ago. It relies on the assumption of scheme stability and in particular -- for the $L2$ setting -- on the absence of multiple roots of the amplification polynomial on the unit circle. This allows to decouple, while discussing the convergence of the method, the study of the consistency of the scheme from the precise knowledge of its parasitic/spurious modes, so that multi-step methods can be studied essentially as they were one-step schemes. In other words, the global truncation error can be inferred from the local truncation error. Furthermore, stability alleviates the need to delve into the complexities of floating-point arithmetic on computers, which can be challenging topics to address. In this paper, we show that in the case of weakly'' unstable schemes with multiple roots on the unit circle, although the schemes may remain stable, the consideration of parasitic modes is essential in studying their consistency and, consequently, their convergence. Otherwise said, the lack of genuine stability prevents bounding the global truncation error using the local truncation error, and one is thus compelled to study the former on its own. This research was prompted by unexpected numerical results on lattice Boltzmann schemes, which can be rewritten in terms of multi-step Finite Difference schemes. Initial expectations suggested that third-order initialization schemes would suffice to maintain the accuracy of a fourth-order multi-step scheme. However, this assumption proved incorrect forweakly'' unstable schemes. This borderline scenario underscores the significance of genuine stability in facilitating the construction of Lax-Richtmyer-like theorems and in mastering the impact of round-off errors. Despite the simplicity and apparent lack of practical usage of the linear transport equation at constant velocity considered throughout the paper, we demonstrate that high-order lattice Boltzmann schemes for this equation can be used to tackle non-linear systems of conservation laws relying on a Jin-Xin approximation and high-order splitting formulae.
- Discrete kinetic schemes for multidimensional systems of conservation laws. SIAM Journal on Numerical Analysis, 37(6):1973–2004, 2000.
- Thomas Bellotti. Initialisation from lattice Boltzmann to multi-step Finite Difference methods: modified equations and discrete observability. arXiv preprint arXiv:2302.07558, 2023.
- Thomas Bellotti. Truncation errors and modified equations for the lattice Boltzmann method via the corresponding Finite Difference schemes. ESAIM: Mathematical Modelling and Numerical Analysis, 57(3):1225–1255, 2023.
- Finite Difference formulation of any lattice Boltzmann scheme. Numerische Mathematik, 152(1):1–40, 2022.
- Stability and convergence rates in Lpsuperscript𝐿𝑝L^{p}italic_L start_POSTSUPERSCRIPT italic_p end_POSTSUPERSCRIPT for certain difference schemes. Mathematica Scandinavica, 27(1):5–23, 1970.
- Besov spaces and applications to difference methods for initial value problems, volume 434. Springer, 1975.
- Generalized gaussian bounds for discrete convolution powers. Revista Matemática Iberoamericana, 38(5):1553–1604, 2022.
- High-order implicit palindromic discontinuous Galerkin method for kinetic-relaxation approximation. Computers & Fluids, 190:485–502, 2019.
- General solutions of a three-level partial difference equation. Computers & Mathematics with Applications, 38(7-8):65–79, 1999.
- The Neumann numerical boundary condition for transport equations. Kinetic and Related Models, 13(1):1–32, 2020.
- Clémentine Courtès. Analyse numérique de systèmes hyperboliques-dispersifs. Theses, Université Paris-Saclay, November 2017.
- Jean-François Coulombel. The Leray-Garding method for finite difference schemes. II. Smooth crossing modes. North-W. Eur. J. of Math., 7:161–184, 2021.
- Jean-François Coulombel. The Green’s function of the Lax–Wendroff and Beam–Warming schemes. Annales mathématiques Blaise Pascal, 29(2):247–294, 2022.
- Paul J Dellar. An interpretation and derivation of the lattice Boltzmann method using Strang splitting. Computers & Mathematics with Applications, 65(2):129–141, 2013.
- Paul J Dellar. A magic two-relaxation-time lattice Boltzmann algorithm for magnetohydrodynamics. Discrete and Continuous Dynamical Systems-S, pages 0–0, 2023.
- A notion of non-negativity preserving relaxation for a mono-dimensional three velocities scheme with relative velocity. Journal of Computational Science, 47:101181, 2020.
- Towards higher order lattice Boltzmann schemes. Journal of Statistical Mechanics: Theory and Experiment, 2009(06):P06006, 2009.
- High order one-step monotonicity-preserving schemes for unsteady compressible flow calculations. Journal of Computational Physics, 193(2):563–594, 2004.
- François Dubois. Stable lattice Boltzmann schemes with a dual entropy approach for monodimensional nonlinear waves. Computers & Mathematics with Applications, 65(2):142–159, 2013.
- François Dubois. Nonlinear fourth order Taylor expansion of lattice Boltzmann schemes. Asymptotic Analysis, 127(4):297–337, 2022.
- Tony Février. Extension et analyse des schémas de Boltzmann sur réseau: les schémas à vitesse relative. PhD thesis, Paris 11, 2014.
- Equivalent finite difference and partial differential equations for the lattice Boltzmann method. Computers & Mathematics with Applications, 90:96–103, 2021.
- Time dependent problems and difference methods. John Wiley & Sons, 1995.
- Monotonicity-preserving linear multistep methods. SIAM Journal on Numerical Analysis, 41(2):605–623, 2003.
- The relaxation schemes for systems of conservation laws in arbitrary space dimensions. Communications on Pure and Applied Mathematics, 48(3):235–276, 1995.
- On the zeros of certain self-reciprocal polynomials. Journal of Mathematical Analysis and Applications, 339(1):240–247, 2008.
- On the resolvent condition in the Kreiss matrix theorem. BIT Numerical Mathematics, 24(4):584–591, 1984.
- Morris Marden. Geometry of polynomials. Number 3. American Mathematical Soc., 1966.
- John JH Miller. On the location of zeros of certain classes of polynomials with applications to numerical analysis. IMA Journal of Applied Mathematics, 8(3):397–406, 1971.
- Splitting methods. Acta Numerica, 11:341–434, 2002.
- Topics in polynomials: extremal problems, inequalities, zeros. World Scientific, 1994.
- Use of the Boltzmann Equation to Simulate Lattice-Gas Automata. Phys. Rev. Lett., 61:2332–2335, Nov 1988.
- An Introduction to Numerical Analysis. Cambridge University Press, 2003.
- Gilbert Strang. Trigonometric polynomials and difference methods of maximum accuracy. Journal of Mathematics and Physics, 41(1-4):147–154, 1962.
- John C Strikwerda. Finite difference schemes and partial differential equations. SIAM, 2004.
- Lloyd N Trefethen. The definition of numerical analysis. Technical report, Cornell University, 1992.
- Ricardo Vieira. Polynomials with symmetric zeros. In Polynomials-Theory and Application. IntechOpen, 2019.
- Robert F Warming and BJ Hyett. The modified equation approach to the stability and accuracy analysis of finite-difference methods. Journal of Computational Physics, 14(2):159–179, 1974.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.