Stability theory of TASE-Runge-Kutta methods with inexact Jacobian
D. Conte, J. Martin-Vaquero, G. Pagano, B. Paternoster

TL;DR
This paper investigates the stability of TASE-RK methods with inexact Jacobians, providing theoretical analysis and numerical validation for their use in stiff initial value problems to reduce computational costs.
Contribution
It extends the stability analysis of TASE-RK methods to cases with arbitrary approximate Jacobians, offering new insights into their stability properties and practical implementation.
Findings
Stability depends on the choice of approximate Jacobian A.
Theoretical conditions for both conditional and unconditional stability.
Numerical experiments confirm the effectiveness of the proposed stability analysis.
Abstract
This paper analyzes the stability of the class of Time-Accurate and Highly-Stable Explicit Runge-Kutta (TASE-RK) methods, introduced in 2021 by Bassenne et al. (J. Comput. Phys.) for the numerical solution of stiff Initial Value Problems (IVPs). Such numerical methods are easy to implement and require the solution of a limited number of linear systems per step, whose coefficient matrices involve the exact Jacobian of the problem. To significantly reduce the computational cost of TASE-RK methods without altering their consistency properties, it is possible to replace with a matrix (not necessarily tied to ) in their formulation, for instance fixed for a certain number of consecutive steps or even constant. However, the stability properties of TASE-RK methods strongly depend on this choice, and so far have been studied assuming . In this manuscript, we theoretically…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical methods for differential equations · Differential Equations and Numerical Methods · Matrix Theory and Algorithms
