Backward differentiation type formulas for Volterra integral equations of the second kind

Summary Numerical integration formulas are discussed which are obtained by differentiation of the Volterra integral equation and by applying backward differentiation formulas to the resulting integro-differential equation. In particular, the stability of the method is investigated for a class of convolution kernels. The accuracy and stability behaviour of the method proposed in this paper is compared with that of (i) a block-implicit Runge-Kutta scheme, and (ii) the scheme obtained by applying directly a quadrature rule which is reducible to the backward differentiation formulas. The present method is particularly advantageous in the case of stiff Volterra integral equations.     

Partitioned adaptive Runge-Kutta methods and their stability

Summary This paper deals with the solution of partitioned systems of nonlinear stiff differential equations. Given a differential system, the user may specify some equations to be stiff and others to be nonstiff. For the numerical solution of such a system partitioned adaptive Runge-Kutta methods are studied. Nonstiff equations are integrated by an explicit Runge-Kutta method while an adaptive Runge-Kutta method is used for the stiff part of the system.The paper discusses numerical stability and contractivity as well as the implementation and usage of such compound methods. Test results for three partitioned stiff initial value problems for different tolerances are presented.     

An improved approximate Newton method for implicit Runge-Kutta formulas

Implicit Runge-Kutta (IRK) methods (such as the s-stage Radau IIA method with s=3,5, or 7) for solving stiff ordinary differential equation systems have excellent stability properties and high solution accuracy orders, but their high computing costs in solving their nonlinear stage equations have seriously limited their applications to large scale problems. To reduce such a cost, several approximate Newton algorithms were developed, including a commonly used one called the simplified Newton method. In this paper, a new approximate Jacobian matrix and two new test rules for controlling the updating of approximate Jacobian matrices are proposed, yielding an improved approximate Newton method. Theoretical and numerical analysis show that the improved approximate Newton method can significantly improve the convergence and performance of the simplified Newton method.     

Unconditionally stable explicit methods for parabolic equations

Summary This paper discussesrational Runge-Kutta methods for stiff differential equations of high dimensions. These methods are explicit and in addition do not require the computation or storage of the Jacobian. A stability analysis (based onn-dimensional linear equations) is given. A second orderA ₀-stable method with embedded error control is constructed and numerical results of stiff problems originating from linear and nonlinear parabolic equations are presented.     

Numerical simulation of blowup in nonlocal reaction–diffusion equations using a moving mesh method

In this paper we implement the moving mesh PDE method for simulating the blowup in reaction–diffusion equations with temporal and spacial nonlinear nonlocal terms. By a time-dependent transformation, the physical equation is written into a Lagrangian form with respect to the computational variables. The time-dependent transformation function satisfies a parabolic partial differential equation — usually called moving mesh PDE (MMPDE). The transformed physical equation and MMPDE are solved alternately by central finite difference method combined with a backward time-stepping scheme. The integration time steps are chosen to be adaptive to the blowup solution by employing a simple and efficient approach. The monitor function in MMPDEs plays a key role in the performance of the moving mesh PDE method. The dominance of equidistribution is utilized to select the monitor functions and a formal analysis is performed to check the principle. A variety of numerical examples show that the blowup profiles can be expressed correctly in the computational coordinates and the blowup rates are determined by the tests.     

求解带刚性源项标量双曲型守恒律方程的保有界WCNS格式

带刚性源项的双曲守恒律方程是很多物理问题,特别是化学反应流的数学模型.本文考虑带刚性源项的标量双曲型守恒律方程,通过时空分离的方式,发展了一类保有界的WCNS格式.对于空间离散,我们将参数化的通量限制器推广到WCNS框架,使得方程对流项离散后满足极值原理.对于时间离散,我们将半离散的WCNS改写成指数形式,采用三阶修正指数型Runge-Kutta格式来控制方程的刚性,保持数值解的界.可以证明,本文格式对带刚性源项的一维标量守恒律方程具有保有界性和弱渐近保持性.数值试验验证了方法的有效性.     

Nonlinear scheme with high accuracy for nonlinear coupled parabolic-hyperbolic system

A nonlinear finite difference scheme with high accuracy is studied for a class of two-dimensional nonlinear coupled parabolic-hyperbolic system. Rigorous theoretical analysis is made for the stability and convergence properties of the scheme, which shows it is unconditionally stable and convergent with second order rate for both spatial and temporal variables. In the argument of theoretical results, difficulties arising from the nonlinearity and coupling between parabolic and hyperbolic equations are overcome, by an ingenious use of the method of energy estimation and inductive hypothesis reasoning. The reasoning method here differs from those used for linear implicit schemes, and can be widely applied to the studies of stability and convergence for a variety of nonlinear schemes for nonlinear PDE problems. Numerical tests verify the results of the theoretical analysis. Particularly it is shown that the scheme is more accurate and faster than a previous two-level nonlinear scheme with first order temporal accuracy.     

Least-squares spectral element method for non-linear hyperbolic differential equations

The least-squares spectral element method has been applied to the one-dimensional inviscid Burgers equation which allows for discontinuous solutions. In order to achieve high order accuracy both in space and in time a space–time formulation has been applied. The Burgers equation has been discretized in three different ways: a non-conservative formulation, a conservative system with two variables and two equations: one first order linear PDE and one linearized algebraic equation, and finally a variant on this conservative formulation applied to a direct minimization with a QR-decomposition at elemental level. For all three formulations an h/p-convergence study has been performed and the results are discussed in this paper.     

New exact travelling wave solutions of Kawahara type equations

The Auxiliary equation method is used to find analytic solutions for the Kawahara and modified Kawahara equations. It is well known that different types of exact solutions of the given auxiliary equation produce new types of exact travelling wave solutions to nonlinear equations. In this paper, new exact solutions of the auxiliary equation are presented. Using these solutions, many new exact travelling wave solutions for the Kawahara type equations are obtained.     

New exact travelling wave solutions for the Kawahara and modified Kawahara equations

By using the solutions of an auxiliary ordinary differential equation, a direct algebraic method is described to construct the exact travelling wave solutions for nonlinear evolution equations. By this method the Kawahara and the modified Kawahara equations are investigated and new exact travelling wave solutions are explicitly obtained with the aid of symbolic computation.     

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.     

Partitioned adaptive Runge-Kutta methods for the solution of nonstiff and stiff systems

Summary For the numerical solution of initial value problems of ordinary differential equations partitioned adaptive Runge-Kutta methods are studied. These methods consist of an adaptive Runge-Kutta methods for the treatment of a stiff system and a corresponding explicit Runge-Kutta method for a nonstiff system. First we modify the theory of Butcher series for partitioned adaptive Runge-Kutta methods. We show that for any explicit Runge-Kutta method there exists a translation invariant partitoned adaptive Runge-Kutta method of the same order. Secondly we derive a special translaton invariant partitioned adaptive Runge-Kutta method of order 3. An automatic stiffness detection and a stepsize control basing on Richardson-extrapolation are performed. Extensive tests and comparisons with the partitioned RKF4RW-algorithm from Rentrop [16] and the partitioned algorithm LSODA from Hindmarsh [9] and Petzold [15] show that the partitoned adaptive Runge-Kutta algorithm works reliable and gives good numericals results. Furthermore these tests show that the automatic stiffness detection in this algorithm is effective.     

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.     

Method of weighted residuals as applied to nonlinear differential equations

A new method for solving a class of nonlinear boundary-value problems is presented. In this method, the nonlinear equation is linearized by guessing an initial solution and using it to evaluate the nonlinear terms. Next, a method of weighted residuals is applied to transform the linearized form of the boundary value problem to an initial value problem. The second (improved) solution is obtained by integrating the initial value problem by a fourth order Runge-Kutta scheme. The entire process is repeated until a desired convergence criterion is achieved.     

A Crank-Nicolson scheme for the Landau-Lifshitz equation without damping

An accurate and efficient numerical approach, based on a finite difference method with Crank-Nicolson time stepping, is proposed for the Landau-Lifshitz equation without damping. The phenomenological Landau-Lifshitz equation describes the dynamics of ferromagnetism. The Crank-Nicolson method is very popular in the numerical schemes for parabolic equations since it is second-order accurate in time. Although widely used, the method does not always produce accurate results when it is applied to the Landau-Lifshitz equation. The objective of this article is to enumerate the problems and then to propose an accurate and robust numerical solution algorithm. A discrete scheme and a numerical solution algorithm for the Landau-Lifshitz equation are described. A nonlinear multigrid method is used for handling the nonlinearities of the resulting discrete system of equations at each time step. We show numerically that the proposed scheme has a second-order convergence in space and time.     

An almost L‐stable BDF‐type method for the numerical solution of stiff ODEs arising from the method of lines

A new BDF‐type scheme is proposed for the numerical integration of the system of ordinary differential equations that arises in the Method of Lines solution of time‐dependent partial differential equations. This system is usually stiff, so it is desirable for the numerical method to solve it to have good properties concerning stability. The method proposed in this article is almost L‐stable and of algebraic order three. Numerical experiments illustrate the performance of the new method on different stiff systems of ODEs after discretizing in the space variable some PDE problems. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Finite element simulations of window Josephson junctions

This paper deals with the numerical simulation of the steady state two dimensional window Josephson junctions by finite element method. The model is represented by a sine-Gordon type composite PDE problem. Convergence and error analysis of the finite element approximation for this semilinear problem are presented. An efficient and reliable Newton-preconditioned conjugate gradient algorithm is proposed to solve the resulting nonlinear discrete system. Regular solution branches are computed using a simple continuation scheme. Numerical results associated with interesting physical phenomena are reported. Interface relaxation methods, which by taking advantage of special properties of the composite PDE, can further reduce the overall computational cost are proposed. The implementation and the associated numerical experiments of a particular interface relaxation scheme are also presented and discussed.     

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.     

The efficiency of Singly-implicit Runge-Kutta methods for stiff differential equations

Singly-implicit Runge-Kutta methods are considered to be good candidates for stiff problems because of their good stability and high accuracy. The existing methods, SIRK (Singly-implicit Runge-Kutta), DESI (Diagonally Extendable Singly-implicit Runge-Kutta), ESIRK (Effective order Singly-implicit Rung-Kutta) and DESIRE (Diagonally Extended Singly-implicit Runge-Kutta Effective order) methods have been shown to be efficient for stiff differential equations, especially for high dimensional stiff problems. In this paper, we measure the efficiency for the family of singly-implicit Runge-Kutta methods using the local truncation error produced within one single step and the count of number of operations. Verification of the error and the computational costs for these methods using variable stepsize scheme are presented. We show how the numerical results are effected by the designed factors: additional diagonal-implicit stages and effective order.     

Numerical method for the KdV–Kawahara and Benney–Lin equations

We are concerned with the initial-boundary-value problem associated to the Korteweg – de Vries – Kawahara (KdVK) equation and Benney – Lin (BL) equation, which are transport equations perturbed by dispersive terms of 3rd and 5th order and a term of 4th order in the case of (BL) equation. These equations appear in several fluid dynamics problems. We obtain local smoothing effects that are uniform with respect to the size of the interval. We also propose a simple finite-difference scheme for the problem and prove its stability. Finally, we give some numerical examples. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)