AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (330.1 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Achieving third-order accuracy via recursive time filtering: a seamless extension of the filtered backward Euler method

Department of Accounting and Tax Applications, Batman University, Batıraman Campus, 72100, Türkiye
Show Author Information

Abstract

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 β ( τ n , τ 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 ( α )-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.

CLC number: 65L04, 65L05, 65L07

References

【1】
【1】
 
 
AIMS Mathematics
Pages 12414-12432

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Güzel A. Achieving third-order accuracy via recursive time filtering: a seamless extension of the filtered backward Euler method. AIMS Mathematics, 2026, 11(5): 12414-12432. https://doi.org/10.3934/math.2026510

55

Views

2

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 06 February 2026
Revised: 08 April 2026
Accepted: 13 April 2026
Published: 15 May 2026
©2026 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)