Related papers: Multi-Order Runge-Kutta Methods or how to numerica…

This paper offers a matrix-free first-order numerical method to solve large-scale conic optimization problems. Solving systems of linear equations pose the most computationally challenging part in both first-order and second-order numerical…

We deal with optimal approximation of solutions of ODEs under local Lipschitz condition and inexact discrete information about the right-hand side functions. We show that the randomized two-stage Runge-Kutta scheme is the optimal method…

First-order methods for minimization and saddle point (min-max) problems are widely used for solving large-scale problems, in particular arising in machine learning. The majority of works obtain favorable complexity guarantees of such…

In this paper, we propose linearly implicit and arbitrary high-order conservative numerical schemes for ordinary differential equations with a quadratic invariant. Many differential equations have invariants, and numerical schemes for…

Implicit Runge--Kutta (IRK) methods are highly effective for solving stiff ordinary differential equations (ODEs) but can be computationally expensive for large-scale problems due to the need of solving coupled algebraic equations at each…

We study possible advantages of randomized and quantum computing over deterministic computing for scalar initial-value problems for ordinary differential equations of order k. For systems of equations of the first order this question has…

We consider the numerical solution of large-scale symmetric differential matrix Riccati equations. Under certain hypotheses on the data, reduced order methods have recently arisen as a promising class of solution strategies, by forming…

An explicit stabilized additive Runge-Kutta scheme is proposed. The method is based on a splitting of the problem in severely stiff and mildly stiff subproblems, which are then independently solved using a Runge-Kutta-Chebyshev scheme. The…

With this short note, we close a gap in the linear stability theory of block predictor-corrector Runge-Kutta schemes originally proposed for the parallel solution of ODEs.

We are concerned with the efficient implementation of symplectic implicit Runge-Kutta (IRK) methods applied to systems of (non-necessarily Hamiltonian) ordinary differential equations by means of Newton-like iterations. We pay particular…

The bivariate difference field provides an algebraic framework for a sequence satisfying a recurrence of order two. Based on this, we focus on sequences satisfying a recurrence of higher order, and consider the multivariate difference…

In this paper we derive and analyze the properties of explicit singly diagonal implicit Runge-Kutta (ESDIRK) integration methods. We discuss the principles for construction of Runge-Kutta methods with embedded methods of different order for…

In this paper, we develop a higher order symmetric partitioned Runge-Kutta method for a coupled system of differential equations on Lie groups. We start with a discussion on partitioned Runge-Kutta methods on Lie groups of arbitrary order.…

We present a novel and general methodology for building second-order finite volume implicit-explicit Runge-Kutta numerical schemes for solving two-dimensional financial parabolic PDEs with mixed derivatives. The methods achieve second-order…

For a large class of fully nonlinear parabolic equations, which include gradient flows for energy functionals that depend on the solution gradient, the semidiscretization in time by implicit Runge-Kutta methods such as the Radau IIA methods…

Runge-Kutta (RK) methods may exhibit order reduction when applied to certain stiff problems. While fully implicit RK schemes exist that avoid order reduction via high-stage order, DIRK (diagonally implicit Runge-Kutta) schemes are…

First-order methods for solving convex optimization problems have been at the forefront of mathematical optimization in the last 20 years. The rapid development of this important class of algorithms is motivated by the success stories…

In this paper, we construct explicit nonstandard Runge-Kutta (ENRK) methods which have higher accuracy order and preserve two important properties of autonomous dynamical systems, namely, the positivity and linear stability. These methods…

An approach is treated for numerical integration of ordinary differential equations systems of the first order with choice of a computation scheme, ensuring the required local precision. The treatment is made on the basis of schemes of…

We propose an algebraic geometric approach for studying rational solutions of first-order algebraic ordinary difference equations. For an autonomous first-order algebraic ordinary difference equations, we give an upper bound for the degrees…