ROS3P—An Accurate Third-Order Rosenbrock Solver Designed for Parabolic Problems

In this note we present a new Rosenbrock solver which is third-order accurate for nonlinear parabolic problems. Since Rosenbrock methods suffer from order reduction when they are applied to partial differential equations, additional order conditions have to be satisfied. Although these conditions have been known for a longer time, from the practical point of view only little has been done to construct new methods. Steinebach modified the well-known solver RODAS of Hairer and Wanner to preserve its classical order four for special problem classes including linear parabolic equations. His solver RODASP, however, drops down to order three for nonlinear parabolic problems. Our motivation here was to derive an efficient third-order Rosenbrock solver for the nonlinear situation. Such a method exists with three stages and two function evaluations only. A comparison with other third-order methods shows the substantial potential of our new method.This revised version was published online in October 2005 with corrections to the Cover Date.     

A comparison of time adaptive integration methods for small and large strain viscoelasticity

In quasistatic solid mechanics the initial boundary value problem has to be solved in the space and time domain. The spatial discretization is done using finite elements. For the temporal discretization three different classes of Runge-Kutta methods are compared. These methods are diagonally implicit Runge-Kutta schemes (DIRK), linear implicit Runge-Kutta methods (Rosenbrock type methods) and half-explicit Runge-Kutta schemes (HERK). It will be shown that the application of half-explicit or linear-implicit Runge-Kutta methods can enormously reduce the computational time in particular situations. (© 2011 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

High order accurate semi-implicit WENO schemes for hyperbolic balance laws

In this paper we propose a family of well-balanced semi-implicit numerical schemes for hyperbolic conservation and balance laws. The basic idea of the proposed schemes lies in the combination of the finite volume WENO discretization with Roe’s solver and the strong stability preserving (SSP) time integration methods, which ensure the stability properties of the considered schemes [S. Gottlieb, C.-W. Shu, E. Tadmor, Strong stability-preserving high-order time discretization methods, SIAM Rev. 43 (2001) 89-112]. While standard WENO schemes typically use explicit time integration methods, in this paper we are combining WENO spatial discretization with optimal SSP singly diagonally implicit (SDIRK) methods developed in [L. Ferracina, M.N. Spijker, Strong stability of singly diagonally implicit Runge-Kutta methods, Appl. Numer. Math. 58 (2008) 1675-1686]. In this way the implicit WENO numerical schemes are obtained. In order to reduce the computational effort, the implicit part of the numerical scheme is linearized in time by taking into account the complete WENO reconstruction procedure. With the proposed linearization the new semi-implicit finite volume WENO schemes are designed.A detailed numerical investigation of the proposed numerical schemes is presented in the paper. More precisely, schemes are tested on one-dimensional linear scalar equation and on non-linear conservation law systems. Furthermore, well-balanced semi-implicit WENO schemes for balance laws with geometrical source terms are defined. Such schemes are then applied to the open channel flow equations. We prove that the defined numerical schemes maintain steady state solution of still water. The application of the new schemes to different open channel flow examples is shown.     

Singly diagonally implicit runge‐kutta method for time‐dependent reaction‐diffusion equation

In this article, an efficient fourth‐order accurate numerical method based on Padé approximation in space and singly diagonally implicit Runge‐Kutta method in time is proposed to solve the time‐dependent one‐dimensional reaction‐diffusion equation. In this scheme, we first approximate the spatial derivative using the second‐order central finite difference then improve it to fourth‐order by applying Padé approximation. A three stage fourth‐order singly diagonally implicit Runge‐Kutta method is then used to solve the resulting system of ordinary differential equations. It is also shown that the scheme is unconditionally stable, and is suitable for stiff problems. Several numerical examples are solved by the scheme and the efficiency and accuracy of the new scheme are compared with two widely used high‐order compact finite difference methods. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1423–1441, 2011     

Singly implicit diagonally extended Runge-Kutta methods of fourth order

Singly implicit diagonally extended Runge-Kutta methods make it possible to combine the merits of diagonally implicit methods (namely, the simplicity of implementation) and fully implicit ones (high stage order). Due to this combination, they can be very efficient at solving stiff and differential-algebraic problems. In this paper, fourth-order methods with an explicit first stage are examined. The methods have the third or fourth stage order. Consideration is given to an efficient implementation of these methods. The results of tests in which the proposed methods were compared with the fifth-order RADAU IIA method are presented.     

A fast singly diagonally implicit runge–kutta method for solving 1D unsteady convection‐diffusion equations

In this article, a fast singly diagonally implicit Runge–Kutta method is designed to solve unsteady one‐dimensional convection diffusion equations. We use a three point compact finite difference approximation for the spatial discretization and also a three‐stage singly diagonally implicit Runge–Kutta (RK) method for the temporal discretization. In particular, a formulation evaluating the boundary values assigned to the internal stages for the RK method is derived so that a phenomenon of the order of the reduction for the convergence does not occur. The proposed scheme not only has fourth‐order accuracy in both space and time variables but also is computationally efficient, requiring only a linear matrix solver for a tridiagonal matrix system. It is also shown that the proposed scheme is unconditionally stable and suitable for stiff problems. Several numerical examples are solved by the new scheme and the numerical efficiency and superiority of it are compared with the numerical results obtained by other methods in the literature. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 788–812, 2014     

SINGLY DIAGONALLY IMPLICIT RUNGE-KUTTA METHODS COMBINING LINE SEARCH TECHNIQUES FOR UNCONSTRAINED OPTIMIZATION

There exists a strong connection between numerical methods for the integration of ordinary differential equations and optimization problems. In this paper, we try to discover further their links. And we transform unconstrained problems to the equivalent ordinary differential equations and construct the LRKOPT method to solve them by combining the second order singly diagonally implicit Runge-Kutta formulas and line search techniques.Moreover we analyze the global convergence and the local convergence of the LRKOPT method. Promising numerical results are also reported.     

An L(a)-stable fourth order Rosenbrock method with error estimator

The computation of stiff systems of ordinary differential equations requires highly stable processes, and this led to the development of L-stable Rosenbrock methods, sometimes called generalized Runge-Kutta or semi-implicit Runge-Kutta methods. They are linearly implicit, and require one Jacobian evaluation and at least one matrix factorization per step. In this paper we develop some results regarding minimum process configuration (i.e. minimum work per step for a given order). As a consequence we then develop an efficient L(a)-stable (a = 89°) fourth order process (fifth order locally), with a reference formula error estimator similar to that of Fehlberg and England.     

Two-Stage Stochastic Runge-Kutta Methods for Stochastic Differential Equations

In this paper we discuss two-stage diagonally implicit stochastic Runge-Kutta methods with strong order 1.0 for strong solutions of Stratonovich stochastic differential equations. Five stochastic Runge-Kutta methods are presented in this paper. They are an explicit method with a large MS-stability region, a semi-implicit method with minimum principal error coefficients, a semi-implicit method with a large MS-stability region, an implicit method with minimum principal error coefficients and another implicit method. We also consider composite stochastic Runge-Kutta methods which are the combination of semi-implicit Runge-Kutta methods and implicit Runge-Kutta methods. Two composite methods are presented in this paper. Numerical results are reported to compare the convergence properties and stability properties of these stochastic Runge-Kutta methods.     

Second-order time-integration in inelastic dynamical systems

In structural dynamics the initial boundary value problem has to be solved in the space and time domain. The spatial discretization is done using finite elements. For the temporal discretization two classes of Runge-Kutta methods and the generalized-α method are compared. The representatives for the Runge-Kutta methods are diagonally implicit Runge-Kutta schemes (DIRK) and diagonally implicit Runge-Kutta-Nyström schemes (DIRKN). (© 2014 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Three-stage Stiffly Accurate Runge-Kutta Methods for Stiff Stochastic Differential Equations

In this paper we discuss diagonally implicit and semi-implicit methods based on the three-stage stiffly accurate Runge-Kutta methods for solving Stratonovich stochastic differential equations（SDEs）.Two methods,a three-stage stiffly accurate semi-implicit（SASI3） method and a three-stage stiffly accurate diagonally implicit （SADI3） method,are constructed in this paper.In particular,the truncated random variable is used in the implicit method.The stability properties and numerical results show the effectiveness of these methods in the pathwise approximation of stiff SDEs.     

Mono-implicit Runge-Kutta schemes for the parallel solution of initial value ODEs

Among the numerical techniques commonly considered for the efficient solution of stiff initial value ordinary differential equations are the implicit Runge-Kutta (IRK) schemes. The calculation of the stages of the IRK method involves the solution of a nonlinear system of equations usually employing some variant of Newton's method. Since the costs of the linear algebra associated with the implementation of Newton's method generally dominate the overall cost of the computation, many subclasses of IRK schemes, such as diagonally implicit Runge-Kutta schemes, singly implicit Runge-Kutta schemes, and mono-implicit (MIRK) schemes, have been developed to attempt to reduce these costs. In this paper we are concerned with the design of MIRK schemes that are inherently parallel in that smaller systems of equations are apportioned to concurrent processors. This work builds on that of an earlier investigation in which a special subclass of the MIRK formulas were implemented in parallel. While suitable parallelism was achieved, the formulas were limited to some extent because they all had only stage order 1. This is of some concern since in the application of a Runge-Kutta method to a system of stiff ODEs the phenomenon of order reduction can arise; the IRK method can behave as if its order were only its stage order (or its stage order plus one), regardless of its classical order. The formulas derived in the current paper represent an improvement over the previous investigation in that the full class of MIRK formulas is considered and therefore it is possible to derive efficient, parallel formulas of orders 2, 3, and 4, having stage orders 2 or 3.     

On the Theory of Parallel Runge--Kutta Methods

The purpose of this paper is to create a theoretical frameworkfor parallelization of Runge-Kutta methods. We investigate theinherent potential for parallelism by considering digraphs ofRunge-Kutta matrices. By highlighting the important role ofthe underlying sparsity pattern, this approach narrows the fielddown to certain types of methods. These are further investigatedby two techniques: perturbed collocation and elementary differentials.Our analysis leads to singly diagonally implicit fourth-orderL-stable methods that can be implemented on two processors (inMIMD architecture) with computational cost of two ‘conventional’stages. We also debate local error control and present a techniquethat can be used to this end.     

A simple technique for constructing two-step Runge-Kutta methods

A technique is proposed for constructing two-step Runge-Kutta methods on the basis of one-step methods. Explicit and diagonally implicit two-step methods with the second or third stage order are examined. Test problems are presented showing that the proposed methods are superior to conventional one-step techniques.     

A comparison of the efficiency of Rosenbrock and DIRK variants

We consider the use of DIRK and Rosenbrock schemes for the time integration of unsteady flow problems. Thereby, two variants of solving the linear systems are compared regarding their efficiency, namely a Jacobian-free method versus computing an approximate Jacobian. The Rosenbrock schemes are slow in the Jacobian-free variant, but may be competitive in the other. (© 2012 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Highest possible order of algebraically stable diagonally implicit runge-kutta methods

We prove that the highest possible order of an algebraically stable diagonally implicit RK-method isfour; the highest possible order of a circle contractive singly diagonally implicit RK-method isfour; the highest possible order of a circle contractive diagonally implicit RK-method issix.     

An analysis of the Prothero–Robinson example for constructing new adaptive ESDIRK methods of order 3 and 4

Explicit singly-diagonally-implicit (ESDIRK) Runge–Kutta methods have usually order reduction if they are applied on stiff ODEs, such as the example of Prothero and Robinson. It can be observed that the numerical order of convergence decreases to the stage order, which is limited to two. In this paper we analyse the Prothero–Robinson example and derive new order conditions to avoid order reduction. New third and fourth order ESDIRK methods are created, which are applied to the Prothero–Robinson example and to an index-2 DAE. Numerical examples show that the new methods have better convergence properties than usual ESDIRK methods.     

IMPLICIT-EXPLICIT RUNGE-KUTTA-ROSENBROCK METHODS WITH ERROR ANALYSIS FOR NONLINEAR STIFF DIFFERENTIAL EQUATIONS

Implicit-explicit Runge-Kutta-Rosenbrock methods are proposed to solve nonlinear stiff ordinary differential equations by combining linearly implicit Rosenbrock methods with ex-plicit Runge-Kutta methods.First,the general order conditions up to order 3 are obtained.Then,for the nonlinear stiff initial-value problems satisfying the one-sided Lipschitz condi-tion and a class of singularly perturbed initial-value problems,the corresponding errors of the implicit-explicit methods are analysed.At last,some numerical examples are given to verify the validity of the obtained theoretical results and the effectiveness of the methods.     

General linear methods with external stages of different orders

The approach introduced recently by Albrecht to derive order conditions for Runge-Kutta formulas based on the theory of A-methods is also very powerful for the general linear methods. In this paper, using Albrecht's approach, we formulate the general theory of order conditions for a class of general linear methods where the components of the propagating vector of approximations to the solution have different orders. Using this theory we derive a class of diagonally implicit multistage integration methods (DIMSIMs) for which the global order is equal to the local order. We also derive a class of general linear methods with two nodal approximations of different orders which facilitate local error estimation. Our theory also applies to the class of two-step Runge-Kutta introduced recently by Jackiewicz and Tracogna.The work of the first author was supported by the National Science Foundation under grant NSF DMS-9208048. The work of the second author was supported by the Italian Consiglio Nazionale delle Richerche.     

A sixth order diagonally implicit symmetric and symplectic Runge-Kutta method for solving Hamiltonian systems

The paper is concerned with construction of symmetric and symplectic Runge-Kutta methods for Hamiltonian systems. Based on the symplectic and symmetrical properties, a sixth-order diagonally implicit symmetric and symplectic Runge-Kutta method with seven stages is presented, the proposed method proved to be P-stable. Numerical experiments with some Hamiltonian oscillatory problems are presented to show the proposed method is as competitive as the existing Runge-Kutta methods in scientic literature.