Backend
Long-time stability and convergence of a BDF3 method for a parabolic equation with fading memory
arXiv cs.NA0 views
arXiv:2610.32364v1 Announce Type: new Abstract: We analyze the long-time stability and convergence of a third-order backward differentiation formula (BDF3) for parabolic equations with exponentially fading memory. The BDF3 scalar resolvent has oscillatory coefficients, so the monotonicity argument used for lower-order formulas in [Math. Comp. 62 (1994) 477-496] does not apply. We instead control memory feedback by the absolute mass of its discrete Green sequence and establish the rigorous stability-constant bounds $23/20<\Lambda_3<579/500$. A causal third-order memory quadrature with nonnegative assembled weights then yields exponentially weighted stability without a parabolic step-size restriction. With third-order starting values, we prove a uniform-in-time third-order temporal error estimate and extend it to conforming finite elements. Numerical tests confirm the predicted convergence orders and the long-time behavior.
Source:https://arxiv.org/abs/2610.32364PreviousA domain-decomposition reduced-order model for two-phase CO$_2$ sequestration with moving wellsNextAn Arbitrary-Order Augmented Lagrangian Discrete De Rham Scheme for Contact Mechanics with Tresca Friction
Related posts
FiveM Script Database Migrations: What to Check Before You Install
0dev.to
The insurance edge case that breaks event-driven policy pipelines
0dev.to
The fix for an empty state isn't filling it
0dev.to UX
Five Things That Make Dependabot Painful for Terraform
0dev.to GitHub
Tracking Roblox player counts: what the public data actually gives you
0dev.to Data
Telegram gold signals this week: results to Oct 30
0dev.to Data