Preservation of stability type of difference schemes when solving stiff differential algebraic equations

Implicit methods applied to the numerical solution of systems of ordinary differential equations (ODEs) with an identically singular matrix multiplying the derivative of the sought-for vector-function are considered. The effects produced by losing L-stability of a classical implicit Euler scheme when solving such stiff systems are discussed.     

Continuous block implicit hybrid one-step methods for ordinary and delay differential equations

A class of high order continuous block implicit hybrid one-step methods has been proposed to solve numerically initial value problems for ordinary and delay differential equations. The convergence and Aω-stability of the continuous block implicit hybrid methods for ordinary differential equations are studied. Alternative form of continuous extension is constructed such that the block implicit hybrid one-step methods can be used to solve delay differential equations and have same convergence order as for ordinary differential equations. Some numerical experiments are conducted to illustrate the efficiency of the continuous methods.     

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.     

The Numerical Simulation of Space-Time Variable Fractional Order Diffusion Equation

Many physical processes appear to exhibit fractional order behavior that may vary with time or space. The continuum of order in the fractional calculus allows the order of the fractional operator to be considered as a variable. Numerical methods and analysis of stability and convergence of numerical scheme for the variable fractional order partial differential equations are quite limited and difficult to derive. This motivates us to develop efficient numerical methods as well as stability and convergence of the implicit numerical methods for the space-time variable fractional order diffusion equation on a finite domain. It is worth mentioning that here we use the Coimbra-definition variable time fractional derivative which is more efficient from the numerical standpoint and is preferable for modeling dynamical systems. An implicit Euler approximation is proposed and then the stability and convergence of the numerical scheme are investigated. Finally, numerical examples are provided to show that the implicit Euler approximation is computationally efficient.     

随机延迟微分方程的全隐式Euler方法

研究随机延迟微分方程数值解具有重要的意义,目前已有显式和半隐式两种数值方法,还没有全隐式的数值方法.本文构造了一种全隐式Euler方法,在该方法中用一些截断的随机变量代替维纳过程增量△W<,n>,接着证明了全隐式方法是1/2阶收敛的并通过数值实验验证了该方法的收敛性.最后,用数值实验表明在某些情况下全隐式方法的稳定性比半隐式方法好一些.     

Variable stepsize implementation of multistep methods for y″=f(x,y,y′)

The Falkner method is a multistep scheme intended for the numerical solution of second-order initial value problems where the first derivative does appear explicitly. In this paper, we develop a procedure to obtain k-step Falkner methods (explicit and implicit) in their variable step-size versions, providing recurrence formulas to compute the coefficients efficiently. Considering a pair of explicit and implicit formulae, these may be implemented in predictor–corrector mode.     

Convergence of the semi-implicit Euler method for neutral stochastic delay differential equations with phase semi-Markovian switching

Recently, in the numerical analysis for stochastic differential equations (SDEs), it is a new topic to study the numerical schemes of neutral stochastic functional differential equations (NSFDEs) (see Wu and Mao [1]). Especially when Markovian switchings are taken into consideration, these problems will be more complicated. Although Zhou and Wu [2] develop a numerical scheme to neutral stochastic delay differential equations with Markovian switching (short for NSDDEwMSs), their method belongs to explicit Euler–Maruyama methods which are in general much less accurate in approximation than their implicit or semi-implicit counterparts. Therefore, to propose an implicit method becomes imperative to fill the gap. In this paper we will extend Zhou and Wu [2] to the case of the semi-implicit Euler–Maruyama methods and equations with phase semi-Markovian switching rather than Markovian switching. The employment of phase semi-Markovian chains can avoid the restriction of the negative exponential distribution of the sojourn time at a state. We prove the semi-implicit Euler solution will converge to the exact solution to NSDDEwMS under local Lipschitz condition. More precise inequalities and new techniques are put forward to overcome the difficulties for the existence of the neutral part.     

A numerical method based on extended Raviart–Thomas (ER‐T) mixed finite element method for solving damped Boussinesq equation

In this paper, we present the approximate solution of damped Boussinesq equation using extended Raviart–Thomas mixed finite element method. In this method, the numerical solution of this equation is obtained using triangular meshes. Also, for discretization in time direction, we use an implicit finite difference scheme. In addition, error estimation and stability analysis of both methods are shown. Finally, some numerical examples are considered to confirm the theoretical results. Copyright © 2017 John Wiley & Sons, Ltd.     

Collocation methods for second-order volterra integro-differential equations

We study the numerical solution of second-order Volterra integro-differential equations by means of collocation techniques in certain polynomial spline spaces. Suitable discretization of the resulting collocation equation yields implicit methods which may be viewed as extensions of m-stage implicit Runge-Kutta-Nyström methods for initial-value problems of second-order ordinary differential equations to second-order integro-differential equations. The attainable order of (local) convergence of these methods is analyzed in detail.     

Boundary control problems for quasilinear systems of hyperbolic equations

For quasilinear systems of hyperbolic equations, the nonclassical boundary value problem of controlling solutions with the help of boundary conditions is considered. Previously, this problem was extensively studied in the case of the simplest hyperbolic equations, namely, the scalar wave equation and certain linear systems. The corresponding problem formulations and numerical solution algorithms are extended to nonlinear (quasilinear and conservative) systems of hyperbolic equations. Some numerical (grid-characteristic) methods are considered that were previously used to solve the above problems. They include explicit and implicit conservative difference schemes on compact stencils that are linearizations of Godunov’s method. The numerical algorithms and methods are tested as applied to well-known linear examples.     

Implicit Solution of a Two-Dimensional Parabolic Inverse Problem with Temperature Overspecification

Three different implicit finite difference schemes for solving the two-dimensional parabolic inverse problem with temperature overspecification are considered. These schemes are developed for indentifying the control parameter which produces, at any given time, a desired temperature distribution at a given point in the spatial domain. The numerical methods discussed, are based on the second-order (5,1) Backward Time Centered Space (BTCS) implicit formula, and the second-order (5,5) Crank-Nicolson implicit finite difference formula and the fourth-order (9,9) implicit scheme. These finite difference schemes are unconditionally stable. The (9,9) implicit formula takes a huge amount of CPU time, but its fourth-order accuracy is significant. The results of a numerical experiment are presented, and the accuracy and central processor (CPU) times needed for each of the methods are discussed and compared. The implicit finite difference schemes use more central processor times than the explicit finite difference techniques, but they are stable for every diffusion number.     

Fractional-step <Emphasis Type="Italic">θ</Emphasis>-method for solving singularly perturbed problem in ecology

We consider a predator-prey model arising in ecology that describes a slow-fast dynamical system. The dynamics of the model is expressed by a system of nonlinear differential equations having different time scales. Designing numerical methods for solving problems exhibiting multiple time scales within a system, such as those considered in this paper, has always been a challenging task. To solve such complicated systems, we therefore use an efficient time-stepping algorithm based on fractional-step methods. To develop our algorithm, we first decouple the original system into fast and slow sub-systems, and then apply suitable sub-algorithms based on a class of θ-methods, to discretize each sub-system independently using different time-steps. Then the algorithm for the full problem is obtained by utilizing a higher-order product method by merging the sub-algorithms at each time-step. The nonlinear system resulting from the use of implicit schemes is solved by two different nonlinear solvers, namely, the Jacobian-free Newton-Krylov method and the well-known Anderson’s acceleration technique. The fractional-step θ-methods give us flexibility to use a variety of methods for each sub-system and they are able to preserve qualitative properties of the solution. We analyze these methods for stability and convergence. Several numerical results indicating the efficiency of the proposed method are presented. We also provide numerical results that confirm our theoretical investigations.     

修正交替方向法求解具有分数阶导数的二维非连续渗流问题

本文考虑在二维均匀介质中带有分数阶导数的非连续渗流问题,此模型修正了众所周知的 Daxcy原理.利用Riemann-Liouvifie和Griinwald-Letnikov分数阶导数之间的关系,提出了求解在二维均匀介质中带有分数阶导数的非连续渗流问题的两种修正的交替方向法:修正的交替方向隐式Euler方法和修正的Peaceman.-Rachford方法.我们讨论了这两种方法的稳定性,相容性和收敛性.最后给出数值例子.     

B-series analysis of iterated Taylor methods

For stochastic implicit Taylor methods that use an iterative scheme to compute their numerical solution, stochastic B-series and corresponding growth functions are constructed. From these, convergence results based on the order of the underlying Taylor method, the choice of the iteration method, the predictor, and the number of iterations, for Itô and Stratonovich SDEs, and for weak as well as strong convergence are derived. As special case, also the application of Taylor methods to ODEs is considered. The theory is supported by numerical experiments.     

Automatic step size and order control in implicit one-step extrapolation methods

A theory is presented for implicit one-step extrapolation methods for ordinary differential equations. The computational schemes used in such methods are based on the implicit Runge-Kutta methods. An efficient implementation of implicit extrapolation is based on the combined step size and order control. The emphasis is placed on calculating and controlling the global error of the numerical solution. The aim is to achieve the user-prescribed accuracy in an automatic mode (ignoring round-off errors). All the theoretical conclusions of this paper are supported by the numerical results obtained for test problems.     

High-order time integration methods in molecular dynamics

The mechanical behaviour of molecular structures can be described with stiff differential equations, which can not be solved analytically. Several numerical time integration schemes can be found in the literature. The aim of this paper is to present the class of partitioned Runge-Kutta methods applied in molecular dynamics. This class of methods includes a wide range of explicit and implicit, single- and multi-stage, symplectic and non-symplectic, low- and high-order time integration schemes. Also most of the classical methods like explicit and implicit Euler, explicit and implicit midpoint rule, Störmer-Verlet and Newmark are also partitioned Runge-Kutta methods. The schemes are implemented in a finite element code which can serve as a numerical platform for molecular dynamics. This code is used to show the sensitivity of the simulations to the accuracy of the initial values. (© 2012 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Implicit Stochastic Runge–Kutta Methods for Stochastic Differential Equations

In this paper we construct implicit stochastic Runge–Kutta (SRK) methods for solving stochastic differential equations of Stratonovich type. Instead of using the increment of a Wiener process, modified random variables are used. We give convergence conditions of the SRK methods with these modified random variables. In particular, the truncated random variable is used. We present a two-stage stiffly accurate diagonal implicit SRK (SADISRK2) method with strong order 1.0 which has better numerical behaviour than extant methods. We also construct a five-stage diagonal implicit SRK method and a six-stage stiffly accurate diagonal implicit SRK method with strong order 1.5. The mean-square and asymptotic stability properties of the trapezoidal method and the SADISRK2 method are analysed and compared with an explicit method and a semi-implicit method. Numerical results are reported for confirming convergence properties and for comparing the numerical behaviour of these methods. This revised version was published online in July 2006 with corrections to the Cover Date.     

Some high accuracy difference schemes with a splitting operator for equations of parabolic and elliptic type

Summary High accuracy alternating direction implicit difference schemes for the heat equation, LAPLACE's equation and the biharmonic equation are considered. In addition to surveying the existing methods, several new methods are introduced. Sequences of iteration parameters are obtained for the elliptic problems and a numerical example is given.     

Nonstandard finite-difference schemes for general two-dimensional autonomous dynamical systems

General two-dimensional autonomous dynamical systems and their standard numerical discretizations are considered. Nonstandard stability-preserving finite-difference schemes based on the explicit and implicit Euler and the second-order Runge–Kutta methods are designed and analyzed. Their elementary stability is established theoretically and is also supported by a numerical example.     

The use of second degree normalized implicit conjugate gradient methods for solving large sparse systems of linear equations

Second degree normalized implicit conjugate gradient methods for the numerical solution of self-adjoint elliptic partial differential equations are developed. A proposal for the selection of certain values of the iteration parameters ?_i, γ_i involved in solving two and three-dimensional elliptic boundary-value problems leading to substantial savings in computational work is presented. Experimental results for model problems are given.