Equilibrium attractivity of Krylov-W-methods for nonlinear stiff ODEs

Since implicit integration schemes for differential equations which use Krylov methods for the approximate solution of linear systems depend nonlinearly on the actual solution a classical stability analysis is difficult to perform. A different, weaker property of autonomous dissipative systemsy′=f(y) is that the norm ‖f(y(t))‖ decreases for any solutiony(t). This property can also be analysed for W-methods using a Krylov-Arnoldi approximation. We discuss different additional assumptions onf and conditions on the Arnoldi process that imply this kind of attractivity to equilibrium points for the numerical solution. One assumption is general enough to cover quasilinear parabolic problems. This work was supported by Deutsche Forschungsgemeinschaft.     

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.     

A variable step implicit block multistep method for solving first-order ODEs

A new four-point implicit block multistep method is developed for solving systems of first-order ordinary differential equations with variable step size. The method computes the numerical solution at four equally spaced points simultaneously. The stability of the proposed method is investigated. The Gauss-Seidel approach is used for the implementation of the proposed method in the PE(CE)^m mode. The method is presented in a simple form of Adams type and all coefficients are stored in the code in order to avoid the calculation of divided difference and integration coefficients. Numerical examples are given to illustrate the efficiency of the proposed method.     

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 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.     

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.     

Analysis of a multirate theta-method for stiff ODEs

This paper contains a study of a simple multirate scheme, consisting of the θ-method with one level of temporal local refinement. Issues of interest are local accuracy, propagation of interpolation errors and stability. The theoretical results are illustrated by numerical experiments, including results for more levels of refinement with automatic partitioning.     

On the convergence of multistep methods for nonlinear stiff differential equations

Summary Convergence estimates are given forA()-stable multistep methods applied to singularly perturbed differential equations and nonlinear parabolic problems. The approach taken here combines perturbation arguments with frequency domain techniques.     

An exponential transformation based splitting method for fast computations of highly oscillatory solutions

Splitting, or decomposition, methods have been widely used for achieving higher computational efficiency in solving wave equations. A major concern has remained, however, if the wave number involved is exceptionally large. In the case, merits of a conventional splitting method may diminish due to the fact that tiny discretization steps need to be employed to compensate high oscillations. This paper studies an alternative way for solving highly oscillatory paraxial wave problems via a modified splitting strategy. In the process, an exponential transformation is first introduced to convert the underlying differential equation to coupled nonlinear equations. Then the resulted oscillation-free system is treated by a Local-One-Dimensional (LOD) scheme for desired accuracy, efficiency and computability. The splitting method acquired is asymptotically stable and easy to use. Computational experiments are given to illustrate our numerical procedures.     

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.     

Stability of IMEX Runge–Kutta methods for delay differential equations

Stability of IMEX (implicit–explicit) Runge–Kutta methods applied to delay differential equations (DDEs) is studied on the basis of the scalar test equation du/dt=λu(t)+μu(t-τ)$\mathrm{d}u/\mathrm{d}t=\lambda u(t)+\mu u(t-\tau )$, where τ$\tau$ is a constant delay and λ,μ$\lambda ,\mu$ are complex parameters. More specifically, P-stability regions of the methods are defined and analyzed in the same way as in the case of the standard Runge–Kutta methods. A new IMEX method which possesses a superior stability property for DDEs is proposed. Some numerical examples which confirm the results of our analysis are presented.     

A Fourier method and an extrapolation technique for Stokes’ first problem for a heated generalized second grade fluid with fractional derivative

In this article, we consider Stokes’ first problem for a heated generalized second grade fluid with fractional derivative (SFP-HGSGF). Implicit and explicit numerical approximation schemes for the SFP-HGSGF are presented. The stability and convergence of the numerical schemes are discussed using a Fourier method. In addition, the solvability of the implicit numerical approximation scheme is also analyzed. A Richardson extrapolation technique for improving the order of convergence of the implicit scheme is proposed. Finally, a numerical test is given. The numerical results demonstrate the good performance of our theoretical analysis.     

IMEX Runge–Kutta schemes for reaction–diffusion equations

A fundamental research is carried out into convergence and stability properties of IMEX (implicit–explicit) Runge–Kutta schemes applied to reaction–diffusion equations. It is shown that a fully discrete scheme converges if it satisfies certain conditions using a technique of the B-convergence analysis, developed by Burrage, Hundsdorfer and Verwer in 1986. Stability of the schemes is also examined on the basis of a scalar test equation, proposed by Frank, Hundsdorfer and Verwer in 1997.     

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.     

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.     

Stability of implicit Runge-Kutta methods for nonlinear stiff differential equations

Under the assumption that an implicit Runge-Kutta method satisfies a certain stability estimate for linear systems with constant coefficientsl ₂-stability for nonlinear systems is proved. This assumption is weaker than algebraic stability since it is satisfied for many methods which are not evenA-stable. Some local smoothness in the right hand side of the differential equation is needed, but it may have a Jacobian and higher derivatives with large norms. The result is applied to a system derived from a strongly nonlinear parabolic equation by the method of lines.     

Doubly quasi-consistent parallel explicit peer methods with built-in global error estimation

Recently, Kulikov presented the idea of double quasi-consistency, which facilitates global error estimation and control, considerably. More precisely, a local error control implemented in such methods plays a part of global error control at the same time. However, Kulikov studied only Nordsieck formulas and proved that there exists no doubly quasi-consistent scheme among those methods.Here, we prove that the class of doubly quasi-consistent formulas is not empty and present the first example of such sort. This scheme belongs to the family of superconvergent explicit two-step peer methods constructed by Weiner, Schmitt, Podhaisky and Jebens. We present a sample of s-stage doubly quasi-consistent parallel explicit peer methods of order s−1 when s=3. The notion of embedded formulas is utilized to evaluate efficiently the local error of the constructed doubly quasi-consistent peer method and, hence, its global error at the same time. Numerical examples of this paper confirm clearly that the usual local error control implemented in doubly quasi-consistent numerical integration techniques is capable of producing numerical solutions for user-supplied accuracy conditions in automatic mode.     

Contractivity of domain decomposition splitting methods for nonlinear parabolic problems

This work deals with the efficient numerical solution of nonlinear parabolic problems posed on a two-dimensional domain Ω. We consider a suitable decomposition of domain Ω and we construct a subordinate smooth partition of unity that we use to rewrite the original equation. Then, the combination of standard spatial discretizations with certain splitting time integrators gives rise to unconditionally contractive schemes. The efficiency of the resulting algorithms stems from the fact that the calculations required at each internal stage can be performed in parallel.     

Semi-implicit Runge-Kutta schemes for the Navier-Stokes equations

The stationary Navier-Stokes equations are solved in 2D with semi-implicit Runge-Kutta schemes, where explicit time-integration in the streamwise direction is combined with implicit integration in the body-normal direction. For model problems stability restrictions and convergence properties are studied. Numerical experiments for the flow over a flat plate show that the number of iterations for the semi-implicit schemes is almost independent of the Reynolds number.