Multirate Runge–Kutta schemes for advection equations

Explicit time integration methods can be employed to simulate a broad spectrum of physical phenomena. The wide range of scales encountered lead to the problem that the fastest cell of the simulation dictates the global time step. Multirate time integration methods can be employed to alter the time step locally so that slower components take longer and fewer time steps, resulting in a moderate to substantial reduction of the computational cost, depending on the scenario to simulate [S. Osher, R. Sanders, Numerical approximations to nonlinear conservation laws with locally varying time and space grids, Math. Comput. 41 (1983) 321–336; H. Tang, G. Warnecke, A class of high resolution schemes for hyperbolic conservation laws and convection-diffusion equations with varying time and pace grids, SIAM J. Sci. Comput. 26 (4) (2005) 1415–1431; E. Constantinescu, A. Sandu, Multirate timestepping methods for hyperbolic conservation laws, SIAM J. Sci. Comput. 33 (3) (2007) 239–278]. In air pollution modeling the advection part is usually integrated explicitly in time, where the time step is constrained by a locally varying Courant–Friedrichs–Lewy (CFL) number. Multirate schemes are a useful tool to decouple different physical regions so that this constraint becomes a local instead of a global restriction. Therefore it is of major interest to apply multirate schemes to the advection equation. We introduce a generic recursive multirate Runge–Kutta scheme that can be easily adapted to an arbitrary number of refinement levels. It preserves the linear invariants of the system and is of third order accuracy when applied to certain explicit Runge–Kutta methods as base method.     

Multirate Partitioned Runge-Kutta Methods

The coupling of subsystems in a hierarchical modelling approach leads to different time constants in the dynamical simulation of technical systems. Multirate schemes exploit the different time scales by using different time steps for the subsystems. The stiffness of the system or at least of some subsystems in chemical reaction kinetics or network analysis, for example, forbids the use of explicit integration schemes. To cope with stiff problems, we introduce multirate schemes based on partitioned Runge—Kutta methods which avoid the coupling between active and latent components based on interpolating and extrapolating state variables. Order conditions and test results for such a lower order MPRK method are presented.This revised version was published online in October 2005 with corrections to the Cover Date.     

Weak second order S-ROCK methods for Stratonovich stochastic differential equations

It is well known that the numerical solution of stiff stochastic ordinary differential equations leads to a step size reduction when explicit methods are used. This has led to a plethora of implicit or semi-implicit methods with a wide variety of stability properties. However, for stiff stochastic problems in which the eigenvalues of a drift term lie near the negative real axis, such as those arising from stochastic partial differential equations, explicit methods with extended stability regions can be very effective. In the present paper our aim is to derive explicit Runge–Kutta schemes for non-commutative Stratonovich stochastic differential equations, which are of weak order two and which have large stability regions. This will be achieved by the use of a technique in Chebyshev methods for ordinary differential equations.     

Methods for parallel integration of stiff systems of odes

This paper presents a class of parallel numerical integration methods for stiff systems of ordinary differential equations which can be partitioned into loosely coupled sub-systems. The formulas are called decoupled backward differentiation formulas, and they are derived from the classical formulas by restricting the implicit part to the diagnonal sub-system. With one or several sub-systems allocated to each processor, information only has to be exchanged after completion of a step but not during the solution of the nonlinear algebraic equations.The main emphasis is on the formula of order 1, the decoupled implicit Euler formula. It is proved that this formula even for a wide range of multirate formulations has an asymptotic global error expansion permitting extrapolation. Besides, sufficient conditions for absolute stability are presented.     

Stability and accuracy of time-extrapolated ADI-FDTD methods for solving wave equations

Some recent work on the ADI-FDTD method for solving Maxwell's equations in 3-D have brought out the importance of extrapolation methods for the time stepping of wave equations. Such extrapolation methods have previously been used for the solution of ODEs. The present context (of wave equations) brings up two main questions which have not been addressed previously: (1) when will extrapolation in time of an unconditionally stable scheme for a wave equation again feature unconditional stability, and (2) how will the accuracy and computational efficiency depend on how frequently in time the extrapolations are carried out. We analyze these issues here.     

A high order uniformly convergent alternating direction scheme for time dependent reaction–diffusion singularly perturbed problems

In this work we design and analyze an efficient numerical method to solve two dimensional initial-boundary value reaction–diffusion problems, for which the diffusion parameter can be very small with respect to the reaction term. The method is defined by combining the Peaceman and Rachford alternating direction method to discretize in time, together with a HODIE finite difference scheme constructed on a tailored mesh. We prove that the resulting scheme is ε-uniformly convergent of second order in time and of third order in spatial variables. Some numerical examples illustrate the efficiency of the method and the orders of uniform convergence proved theoretically. We also show that it is easy to avoid the well-known order reduction phenomenon, which is usually produced in the time integration process when the boundary conditions are time dependent. This research has been partially supported by the project MEC/FEDER MTM2004-01905 and the Diputación General de Aragón.     

A second order backward difference method with variable steps for a parabolic problem

The numerical solution of a parabolic problem is studied. The equation is discretized in time by means of a second order two step backward difference method with variable time step. A stability result is proved by the energy method under certain restrictions on the ratios of successive time steps. Error estimates are derived and applications are given to homogenous equations with initial data of low regularity.     

Global error estimation and control in linearly-implicit parallel two-step peer W-methods

The class of linearly-implicit parallel two-step peer W-methods has been designed recently for efficient numerical solutions of stiff ordinary differential equations. Those schemes allow for parallelism across the method, that is an important feature for implementation on modern computational devices. Most importantly, all stage values of those methods possess the same properties in terms of stability and accuracy of numerical integration. This property results in the fact that no order reduction occurs when they are applied to very stiff problems. In this paper, we develop parallel local and global error estimation schemes that allow the numerical solution to be computed for a user-supplied accuracy requirement in automatic mode. An algorithm of such global error control and other technical particulars are also discussed here. Numerical examples confirm efficiency of the presented error estimation and stepsize control algorithm on a number of test problems with known exact solutions, including nonstiff, stiff, very stiff and large-scale differential equations. A comparison with the well-known stiff solver RODAS is also shown.     

A multirate time stepping strategy for stiff ordinary differential equations

To solve ODE systems with different time scales which are localized over the components, multirate time stepping is examined. In this paper we introduce a self-adjusting multirate time stepping strategy, in which the step size for a particular component is determined by its own local temporal variation, instead of using a single step size for the whole system. We primarily consider implicit time stepping methods, suitable for stiff or mildly stiff ODEs. Numerical results with our multirate strategy are presented for several test problems. Comparisons with the corresponding single-rate schemes show that substantial gains in computational work and CPU times can be obtained. AMS subject classification (2000)  65L05, 65L06, 65L50     

On the numerical solution of diffusion–reaction equations with singular source terms

A numerical study is presented of reaction–diffusion problems having singular reaction source terms, singular in the sense that within the spatial domain the source is defined by a Dirac delta function expression on a lower dimensional surface. A consequence is that solutions will be continuous, but not continuously differentiable. This lack of smoothness and the lower dimensional surface form an obstacle for numerical discretization, including amongst others order reduction. In this paper the standard finite volume approach is studied for which reduction from order two to order one occurs. A local grid refinement technique is discussed which overcomes the reduction.     

A fourth-order Runge–Kutta method based on BDF-type Chebyshev approximations

In this paper we consider a new fourth-order method of BDF-type for solving stiff initial-value problems, based on the interval approximation of the true solution by truncated Chebyshev series. It is shown that the method may be formulated in an equivalent way as a Runge–Kutta method having stage order four. The method thus obtained have good properties relatives to stability including an unbounded stability domain and large α$\alpha$-value concerning A(α)$A(\alpha )$-stability. A strategy for changing the step size, based on a pair of methods in a similar way to the embedding pair in the Runge–Kutta schemes, is presented. The numerical examples reveals that this method is very promising when it is used for solving stiff initial-value problems.     

Finite volume schemes for nonhomogeneous scalar conservation laws: error estimate

Summary. In this paper, we study finite volume schemes for the nonhomogeneous scalar conservation law with initial condition . The source term may be either stiff or nonstiff. In both cases, we prove error estimates between the approximate solution given by a finite volume scheme (the scheme is totally explicit in the nonstiff case, semi-implicit in the stiff case) and the entropy solution. The order of these estimates is in space-time -norm (h denotes the size of the mesh). Furthermore, the error estimate does not depend on the stiffness of the source term in the stiff case. Received October 21, 1999 / Published online February 5, 2001     

A note on iterated splitting schemes

Iterated splittings seem attractive in view of consistency and local accuracy. In this note it will be shown, however, that for stiff systems the stability properties are quite poor. Specific Runge–Kutta implementations can improve stability, but this leads to classes of methods that are better studied in their own right.     

A multirate ROW-scheme for index-1 network equations

Multirate methods exploit latency in electrical circuits to simulate the transient behaviour more efficiently. To this end, different step-sizes are used for various subsystems. The size of these time steps reflect the different levels of activity. Following the idea of mixed multirate for ordinary differential equations, a Rosenbrock–Wanner based multirate method is developed for index-1 differential-algebraic equations (DAEs) arising in circuit simulation. To obtain order conditions for a method with two activity levels, P-series (and DA-series) are generalised and combined for an application to partitioned DAE systems. A working scheme and results for a benchmarking circuit are presented.     

Error analysis and applications of the Fourier-Galerkin Runge-Kutta schemes for high-order stiff PDEs

An integrating factor mixed with Runge-Kutta technique is a time integration method that can be efficiently combined with spatial spectral approximations to provide a very high resolution to the smooth solutions of some linear and nonlinear partial differential equations. In this paper, the novel hybrid Fourier-Galerkin Runge-Kutta scheme, with the aid of an integrating factor, is proposed to solve nonlinear high-order stiff PDEs. Error analysis and properties of the scheme are provided. Application to the approximate solution of the nonlinear stiff Korteweg-de Vries (the 3rd order PDE, dispersive equation), Kuramoto-Sivashinsky (the 4th order PDE, dissipative equation) and Kawahara (the 5th order PDE) equations are presented. Comparisons are made between this proposed scheme and the competing method given by Kassam and Trefethen. It is found that for KdV, KS and Kawahara equations, the proposed method is the best.     

High-order adaptive finite element-singly implicit Runge-Kutta methods for parabolic differential equations

We describe an adaptive mesh refinement finite element method-of-lines procedure for solving one-dimensional parabolic partial differential equations. Solutions are calculated using Galerkin's method with a piecewise hierarchical polynomial basis in space and singly implicit Runge-Kutta (SIRK) methods in time. A modified SIRK formulation eliminates a linear systems solution that is required by the traditional SIRK formulation and leads to a new reduced-order interpolation formula. Stability and temporal error estimation techniques allow acceptance of approximate solutions at intermediate stages, yielding increased efficiency when solving partial differential equations. A priori energy estimates of the local discretization error are obtained for a nonlinear scalar problem. A posteriori estimates of local spatial discretization errors, obtained by order variation, are used with the a priori error estimates to control the adaptive mesh refinement strategy. Computational results suggest convergence of the a posteriori error estimate to the exact discretization error and verify the utility of the adaptive technique.This research was partially supported by the U.S. Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant Number AFOSR-90-0194; the U.S. Army Research Office under Contract Number DAAL 03-91-G-0215; by the National Science Foundation under Grant Number CDA-8805910; and by a grant from the Committee on Research, Tulane University.     

On quasi-consistent integration by Nordsieck methods

In this paper we study advantages of numerical integration by quasi-consistent Nordsieck formulas. All quasi-consistent numerical methods possess at least one important property for practical use, which has not attracted attention yet, i.e. the global error of a quasi-consistent method has the same order as its local error. This means that the usual local error control will produce a numerical solution for the prescribed accuracy requirement if the principal term of the local error dominates strongly over remaining terms. In other words, the global error control can be as cheap as the local error control in the methods under discussion.     

Relaxation approximation to bed-load sediment transport

In this work we propose and apply a numerical method based on finite volume relaxation approximation for computing the bed-load sediment transport in shallow water flows, in one and two space dimensions. The water flow is modeled by the well-known nonlinear shallow water equations which are coupled with a bed updating equation. Using a relaxation approximation, the nonlinear set of equations (and for two different formulations) is transformed to a semilinear diagonalizable problem with linear characteristic variables. A second order MUSCL-TVD method is used for the advection stage while an implicit–explicit Runge–Kutta scheme solves the relaxation stage. The main advantages of this approach are that neither Riemann problem solvers nor nonlinear iterations are required during the solution process. For the two different formulations, the applicability and effectiveness of the presented scheme is verified by comparing numerical results obtained for several benchmark test problems.     

A robust and accurate finite difference method for a generalized Black-Scholes equation

In this paper we present a numerical method for a generalized Black-Scholes equation, which is used for option pricing. The method is based on a central difference spatial discretization on a piecewise uniform mesh and an implicit time stepping technique. Our scheme is stable for arbitrary volatility and arbitrary interest rate, and is second-order convergent with respect to the spatial variable. Furthermore, the present paper efficiently treats the singularities of the non-smooth payoff function. Numerical results support the theoretical results.     

Space–time discontinuous Galerkin finite element method for shallow water flows

A space–time discontinuous Galerkin (DG) finite element method is presented for the shallow water equations over varying bottom topography. The method results in nonlinear equations per element, which are solved locally by establishing the element communication with a numerical HLLC flux. To deal with spurious oscillations around discontinuities, we employ a dissipation operator only around discontinuities using Krivodonova's discontinuity detector. The numerical scheme is verified by comparing numerical and exact solutions, and validated against a laboratory experiment involving flow through a contraction. We conclude that the method is second order accurate in both space and time for linear polynomials.