Related papers: Runge--Kutta generalized Convolution Quadrature fo…
Explicit Runge-Kutta schemes with large stable step sizes are developed for integration of high order spectral difference spatial discretization on quadrilateral grids. The new schemes permit an effective time step that is substantially…
Runge-Kutta methods are a popular class of numerical methods for solving ordinary differential equations. Every Runge-Kutta method is characterized by two basic parameters: its order, which measures the accuracy of the solution it produces,…
Runge--Kutta (RK) methods are widely used techniques for solving a class of initial value problems. In this article, we introduce an adaptive multiquadratic (MQ) radial basis function (RBF)-based method to develop enhanced explicit RK…
In this paper the performance of a parallel iterated Runge-Kutta method is compared versus those of the serial fouth order Runge-Kutta and Dormand-Prince methods. It was found that, typically, the runtime for the parallel method is…
A space-time fully adaptive multiresolution method for evolutionary non-linear partial differential equations is presented introducing an improved local time-stepping method. The space discretisation is based on classical finite volumes,…
We study the construction and convergence of semi-explicit and iterative decoupling schemes for an elliptic-parabolic problem using higher-order Runge-Kutta methods. For the semi-explicit schemes, which are constructed using a nearby delay…
The conjugate gradient (CG) method is an efficient iterative method for solving large-scale strongly convex quadratic programming (QP). In this paper we propose some generalized CG (GCG) methods for solving the $\ell_1$-regularized…
The semidiscretization of a sound soft scattering problem modelled by the wave equation is analyzed. The spatial treatment is done by integral equation methods. Two temporal discretizations based on Runge-Kutta convolution quadrature are…
Finite element discretization of time dependent problems also require effective time-stepping schemes. While implicit Runge-Kutta methods provide favorable accuracy and stability problems, they give rise to large and complicated systems of…
Finite element methods provide accurate and efficient methods for the numerical solution of partial differential equations by means of restricting variational problems to finite-dimensional approximating spaces. However, they do not…
Classical and new numerical schemes are generated using evolutionary computing. Differential Evolution is used to find the coefficients of finite difference approximations of function derivatives, and of single and multi-step integration…
Lagrangian systems subject to fractional damping can be incorporated into a variational formalism. The construction can be made by doubling the state variables and introducing fractional derivatives \cite{JiOb2}. The main objective of this…
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.…
In the paper explicit functional continuous Runge-Kutta and Runge-Kutta-Nystr\"om methods for retarded functional differential equations are considered. New methods for first order equations as well as for second order equations of the…
This paper contains an error analysis of two randomized explicit Runge-Kutta schemes for ordinary differential equations (ODEs) with time-irregular coefficient functions. In particular, the methods are applicable to ODEs of Carath\'eodory…
The aim of this paper is to construct and analyze explicit exponential Runge-Kutta methods for the temporal discretization of linear and semilinear integro-differential equations. By expanding the errors of the numerical method in terms of…
Explicit Runge--Kutta (RK) methods are susceptible to a reduction in the observed order of convergence when applied to initial-boundary value problem with time-dependent boundary conditions. We study conditions on explicit RK methods that…
We present a C++ implementation of a fifth order semi-implicit Runge-Kutta algorithm for solving Ordinary Differential Equations. This algorithm can be used for studying many different problems and in particular it can be applied for…
In this paper, exponential Runge-Kutta methods of collocation type (ERKC) which were originally proposed in (Appl Numer Math 53:323-339, 2005) are extended to semilinear parabolic problems with time-dependent delay. Two classes of the ERKC…
This paper investigates, a new class of fractional order Runge-Kutta (FORK) methods for numerical approximation to the solution of fractional differential equations (FDEs). By using the Caputo generalizedTaylor formula and the total…