This paper introduces a novel recursive time-filtering framework designed to elevate the second-order filtered backward Euler (FBE) method to third-order accuracy while preserving its inherent computational simplicity. While FBE remains a staple in computational science due to its robust stability, its second-order convergence often necessitates prohibitively small time steps for high-fidelity simulations. We resolve this by proposing a non-intrusive extension that functions as a modular post-processing step, requiring no additional implicit solves or structural modifications to existing numerical solvers. By leveraging principles from discrete differential geometry, we generalize the framework to variable time-step regimes through a rigorous definition of discrete curvature based on quadratic interpolants. The theoretical foundation involves recasting the FBE scheme into its one-leg equivalent and applying the framework of linear multistep methods (LMM). Through a derivation of the local truncation error (LTE), we identify a unique, step-dependent filtering parameter $ \beta(\tau_n, \tau_{n-1}) $ that ensures a consistent transition to third-order convergence across non-uniform grids. Furthermore, we prove that the filtering operation satisfies a discrete maximum principle for curvature, demonstrating that the updated curvature is a convex combination of previous values. This ensures the scheme is strictly dissipative, effectively dampening high-frequency numerical artifacts without introducing new local extrema. Stability analysis via the boundary locus method confirms that the resulting recursive scheme is $ A(\alpha) $-stable, providing a vast stability region for stiff differential systems. Numerical validations on a suite of oscillatory and quasiperiodic benchmark problems demonstrate that the method recovers the theoretical order of accuracy and significantly mitigates the excessive numerical dissipation characteristic of standard FBE schemes, offering a powerful and low-effort upgrade path for legacy codes in fluid dynamics and structural mechanics.
Citation: Ahmet Güzel. Achieving third-order accuracy via recursive time filtering: a seamless extension of the filtered backward Euler method[J]. AIMS Mathematics, 2026, 11(5): 12414-12432. doi: 10.3934/math.2026510
This paper introduces a novel recursive time-filtering framework designed to elevate the second-order filtered backward Euler (FBE) method to third-order accuracy while preserving its inherent computational simplicity. While FBE remains a staple in computational science due to its robust stability, its second-order convergence often necessitates prohibitively small time steps for high-fidelity simulations. We resolve this by proposing a non-intrusive extension that functions as a modular post-processing step, requiring no additional implicit solves or structural modifications to existing numerical solvers. By leveraging principles from discrete differential geometry, we generalize the framework to variable time-step regimes through a rigorous definition of discrete curvature based on quadratic interpolants. The theoretical foundation involves recasting the FBE scheme into its one-leg equivalent and applying the framework of linear multistep methods (LMM). Through a derivation of the local truncation error (LTE), we identify a unique, step-dependent filtering parameter $ \beta(\tau_n, \tau_{n-1}) $ that ensures a consistent transition to third-order convergence across non-uniform grids. Furthermore, we prove that the filtering operation satisfies a discrete maximum principle for curvature, demonstrating that the updated curvature is a convex combination of previous values. This ensures the scheme is strictly dissipative, effectively dampening high-frequency numerical artifacts without introducing new local extrema. Stability analysis via the boundary locus method confirms that the resulting recursive scheme is $ A(\alpha) $-stable, providing a vast stability region for stiff differential systems. Numerical validations on a suite of oscillatory and quasiperiodic benchmark problems demonstrate that the method recovers the theoretical order of accuracy and significantly mitigates the excessive numerical dissipation characteristic of standard FBE schemes, offering a powerful and low-effort upgrade path for legacy codes in fluid dynamics and structural mechanics.
| [1] | J. D. Lambert, Numerical methods for ordinary differential systems: the initial value problem, Chichester, England: John Wiley & Sons, 1992. |
| [2] | K. E. Atkinson, An introduction to numerical analysis, 2 Eds., New York, NY: John Wiley & Sons, 1989. |
| [3] | C. W. Gear, Numerical initial value problems in ordinary differential equations, Englewood Cliffs, N.J.: Prentice-Hall, Inc., 1971. |
| [4] | B. N. Biswas, S. Chatterjee, S. Mukherjee, S. Pal, A discussion on Euler method: a review, Electron. J. Math. Anal. Appl., 1 (2013), 294–317. |
| [5] |
R. Asselin, Frequency filter for time integrations, Mon. Weather Rev., 100 (1972), 487–490. https://doi.org/10.1175/1520-0493(1972)100%3C0487:FFFTI%3E2.3.CO;2 doi: 10.1175/1520-0493(1972)100%3C0487:FFFTI%3E2.3.CO;2
|
| [6] |
P. D. Williams, A proposed modification to the robert–asselin time filter, Mon. Weather Rev., 137 (2009), 2538–2546. http://dx.doi.org/10.1175/2009MWR2724.1 doi: 10.1175/2009MWR2724.1
|
| [7] |
A. Güzel, Analysis of forward Euler method with time filter, TJNS, 15 (2026), 97–103. http://dx.doi.org/10.46810/tdfd.1828215 doi: 10.46810/tdfd.1828215
|
| [8] |
A. Guzel, W. Layton, Time filters increase accuracy of the fully implicit method, BIT Numer. Math., 58 (2018), 301–315. http://dx.doi.org/10.1007/s10543-018-0695-z doi: 10.1007/s10543-018-0695-z
|
| [9] |
W. Layton, W. Pei, C. Trenchea, Refactorization of a variable step, unconditionally stable method of Dahlquist, Liniger and Nevanlinna, Appl. Math. Lett., 125 (2022), 107789. http://dx.doi.org/10.1016/j.aml.2021.107789 doi: 10.1016/j.aml.2021.107789
|
| [10] |
W. Layton, W. Pei, Y. Qin, C. Trenchea, Analysis of the variable step method of Dahlquist, Liniger and Nevanlinna for fluid flow, Numer. Methods Partial Differ. Equ., 38 (2022), 1713–1737. http://dx.doi.org/10.1002/num.22831 doi: 10.1002/num.22831
|
| [11] |
V. DeCaria, A. Guzel, W. Layton, Y. Li, A variable stepsize, variable order family of low complexity, SIAM J. Sci. Comput., 43 (2021), A2130–A2160. http://dx.doi.org/10.1137/19M1258153 doi: 10.1137/19M1258153
|
| [12] |
W. Layton, W. Pei, C. Trenchea, Time step adaptivity in the method of Dahlquist, Liniger and Nevanlinna, Adv. Comput. Sci. Eng., 1 (2023), 320–350. http://dx.doi.org/10.3934/acse.2023014 doi: 10.3934/acse.2023014
|
| [13] |
A. Güzel, Halving the error in second order Adams-Bashforth methods via a simple time filter, Black Sea J. Eng. Sci., 9 (2026), 887–893. http://dx.doi.org/10.34248/bsengineering.1870475 doi: 10.34248/bsengineering.1870475
|
| [14] |
G. Dahlquist, On one-leg multistep methods, SIAM J. Numer. Anal., 20 (1983), 1130–1138. http://dx.doi.org/10.1137/0720082 doi: 10.1137/0720082
|
| [15] |
D. S. Watanabe, Q. M. Sheikh, One-leg formulas for stiff ordinary differential equations, SIAM J. Sci. Statist. Comput., 5 (1984), 489–496. http://dx.doi.org/10.1137/0905036 doi: 10.1137/0905036
|
| [16] |
G. Y. Kulikov, S. K. Shindin, One-leg integration of ordinary differential equations with global error control, Comput. Methods Appl. Math., 5 (2005), 86–96. http://dx.doi.org/10.2478/cmam-2005-0004 doi: 10.2478/cmam-2005-0004
|
| [17] |
A. Guzel, C. Trenchea, The Williams step increases the stability and accuracy of the hoRA time filter, Appl. Numer. Math., 131 (2018), 158–173. http://dx.doi.org/10.1016/j.apnum.2018.05.003 doi: 10.1016/j.apnum.2018.05.003
|
| [18] |
Y. Li, C. Trenchea, A higher-order Robert–Asselin type time filter, J. Comput. Phys., 259 (2014), 23–32. http://dx.doi.org/10.1016/j.jcp.2013.11.022 doi: 10.1016/j.jcp.2013.11.022
|
| [19] | E. Hairer, G. Wanner, Solving ordinary differential equations. II: Stiff and differential-algebraic problems, 2 Eds., Heidelberg: Springer Berlin, 1996. http://dx.doi.org/10.1007/978-3-642-05221-7 |
| [20] | D. F. Griffiths, D. J. Higham, Numerical methods for ordinary differential equations: initial value problems, London: Springer London, 2010. http://dx.doi.org/10.1007/978-0-85729-148-6 |
| [21] |
A. Güzel, Deriving the error of time filtered leapfrog scheme via modified equations, Bitlis Eren Üniv. Fen Bilimleri Derg., 15 (2026), 480–491. http://dx.doi.org/10.17798/bitlisfen.1840686 doi: 10.17798/bitlisfen.1840686
|
| [22] | A. Quarteroni, R. Sacco, F. Saleri, Numerical mathematics, 2 Eds., Heidelberg: Springer Berlin, 2007. http://dx.doi.org/10.1007/b98885 |
| [23] | E. Hairer, G. Wanner, S. P. Nørsett, Solving ordinary differential equations. I: Nonstiff problems, 2 Eds., Heidelberg: Springer Berlin, 1993. http://dx.doi.org/10.1007/978-3-540-78862-1 |
| [24] |
N. Hurl, W. Layton, Y. Li, C. Trenchea, Stability analysis of the Crank–Nicolson-Leapfrog method with the Robert–Asselin–Williams time filter, BIT Numer. Math., 54 (2014), 1009–1021. http://dx.doi.org/10.1007/s10543-014-0493-1 doi: 10.1007/s10543-014-0493-1
|
| [25] |
S. M. McGovern, Adaptive step selection for a filtered implicit method, J. Sci. Comput., 103 (2025), 54. http://dx.doi.org/10.1007/s10915-025-02861-w doi: 10.1007/s10915-025-02861-w
|
| [26] |
P. D. Williams, Achieving seventh-order amplitude accuracy in leapfrog integrations, Mon. Weather Rev., 141 (2013), 3037–3051. http://dx.doi.org/10.1175/MWR-D-12-00303.1 doi: 10.1175/MWR-D-12-00303.1
|