Related papers: Explicit Runge-Kutta-Chebyshev methods of second o…
In this note, we connect two different topics from linear algebra and numerical analysis: hypocoercivity of semi-dissipative matrices and strong stability for explicit Runge--Kutta schemes. Linear autonomous ODE systems with a non-coercive…
Stiff and chaotic differential equations are challenging for time-stepping numerical methods. For explicit methods, the required time step resolution significantly exceeds the resolution associated with the smoothness of the exact solution…
A novel optimization procedure for the generation of stability polynomials of stabilized explicit Runge-Kutta methods is devised. Intended for semidiscretizations of hyperbolic partial differential equations, the herein developed approach…
The second-order extended stability Factorized Runge-Kutta-Chebyshev (FRKC2) class of explicit schemes for the integration of large systems of PDEs with diffusive terms is presented. FRKC2 schemes are straightforward to implement through…
This paper introduces the Runge-Kutta Chebyshev descent method (RKCD) for strongly convex optimisation problems. This new algorithm is based on explicit stabilised integrators for stiff differential equations, a powerful class of numerical…
In this paper, we extend the Paired-Explicit Runge-Kutta schemes by Vermeire et. al. to fourth-order of consistency. Based on the order conditions for partitioned Runge-Kutta methods we motivate a specific form of the Butcher arrays which…
Harmonic Balance is one of the most popular methods for computing periodic solutions of nonlinear dynamical systems. In this work, we address two of its major shortcomings: First, we investigate to what extent the computational burden of…
We study the stable behaviour of discrete dynamical systems where the map is convex and monotone with respect to the standard positive cone. The notion of tangential stability for fixed points and periodic points is introduced, which is…
We prove that Runge-Kutta (RK) methods for numerical integration of arbitrarily large systems of Ordinary Differential Equations are linearly stable. Standard stability arguments -- based on spectral analysis, resolvent condition or strong…
The theory of polar forms of polynomials is used to provide for sharp bounds on the radius of the largest possible disc (absolute stability radius), and on the length of the largest possible real interval (parabolic stability radius), to be…
Modern data science applications demand solving large-scale optimization problems. The prevalent approaches are first-order methods, valued for their scalability. These methods are implemented to tackle highly irregular problems where…
Second order linear non-autonomous differential equations with negative stiffness are considered. Using Chetaev-like (Lyapunov-like) functions, necessary (sufficient) conditions are found for the solutions to be bounded for all initial…
This work establishes a rigorous connection between stability properties of discrete-time algorithms (DTAs) and corresponding continuous-time dynamical systems derived through $ O(s^r) $-resolution ordinary differential equations (ODEs). We…
This paper deals with stability of classical Runge-Kutta collocation methods. When such methods are embedded in linearly implicit methods as developed in [12] and used in [13] for the time integration of nonlinear evolution PDEs, the…
?In this work, we study the orbital stability of stationary solutions to the relativistic Vlasov-Manev system. This system is a kinetic model describing the evolution of a stellar system subject to its own gravity with some relativistic…
This paper continues to study the explicit two-stage fourth-order accurate time discretiza- tions [5, 7]. By introducing variable weights, we propose a class of more general explicit one-step two-stage time discretizations, which are…
Probabilistic solvers for ordinary differential equations (ODEs) provide efficient quantification of numerical uncertainty associated with simulation of dynamical systems. Their convergence rates have been established by a growing body of…
In the paper we have developed a theory of stability preserving structural transformations of systems of second-order ordinary differential equations (ODEs), i.e., the transformations which preserve the property of Lyapunov stability. The…
We analyse and compare several algorithms to compute numerically periodic solutions of high-dimensional dynamical systems and investigate their Floquet stability without building the monodromy matrix. The solution and its perturbation are…
A time discretization method is called strongly stable, if the norm of its numerical solution is nonincreasing. It is known that, even for linear semi-negative problems, many explicit Runge--Kutta (RK) methods fail to preserve this…