An IMEX‐BDF2 compact scheme for pricing options under regime‐switching jump‐diffusion models

In this paper, an implicit‐explicit two‐step backward differentiation formula (IMEX‐BDF2) together with finite difference compact scheme is developed for the numerical pricing of European and American options whose asset price dynamics follow the regime‐switching jump‐diffusion process. It is shown that IMEX‐BDF2 method for solving this system of coupled partial integro‐differential equations is stable with the second‐order accuracy in time. On the basis of IMEX‐BDF2 time semi‐discrete method, we derive a fourth‐order compact (FOC) finite difference scheme for spatial discretization. Since the payoff function of the option at the strike price is not differentiable, the results show only second‐order accuracy in space. To remedy this, a local mesh refinement strategy is used near the strike price so that the accuracy achieves fourth order. Numerical results illustrate the effectiveness of the proposed method for European and American options under regime‐switching jump‐diffusion models.     

Fourth‐order compact scheme with local mesh refinement for option pricing in jump‐diffusion model

The value of a contingent claim under a jump‐diffusion process satisfies a partial integro‐differential equation. A fourth‐order compact finite difference scheme is applied to discretize the spatial variable of this equation. It is discretized in time by an implicit‐explicit method. Meanwhile, a local mesh refinement strategy is used for handling the nonsmooth payoff condition. Moreover, the numerical quadrature method is exploited to evaluate the jump integral term. It guarantees a Toeplitz‐like structure of the integral operator such that a fast algorithm is feasible. Numerical results show that this approach gives fourth‐order accuracy in space. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2011     

Optimal uniform error estimates for moving least‐squares collocation with application to option pricing under jump‐diffusion processes

In this study, we derive optimal uniform error bounds for moving least‐squares (MLS) mesh‐free point collocation (also called finite point method) when applied to solve second‐order elliptic partial integro‐differential equations (PIDEs). In the special case of elliptic partial differential equations (PDEs), we show that our estimate improves the results of Cheng and Cheng (Appl. Numer. Math. 58 (2008), no. 6, 884–898) both in terms of the used error norm (here the uniform norm and there the discrete vector norm) and the obtained order of convergence. We then present optimal convergence rate estimates for second‐order elliptic PIDEs. We proceed by some numerical experiments dealing with elliptic PDEs that confirm the obtained theoretical results. The article concludes with numerical approximation of the linear parabolic PIDE arising from European option pricing problem under Merton's and Kou's jump‐diffusion models. The presented computational results (including the computation of option Greeks) and comparisons with other competing approaches suggest that the MLS collocation scheme is an efficient and reliable numerical method to solve elliptic and parabolic PIDEs arising from applied areas such as financial engineering.     

A numerical method based on integro‐differential formulation for solving a one‐dimensional Stefan problem

A numerical method based on an integro‐differential formulation is proposed for solving a one‐dimensional moving boundary Stefan problem involving heat conduction in a solid with phase change. Some specific test problems are solved using the proposed method. The numerical results obtained indicate that it can give accurate solutions and may offer an interesting and viable alternative to existing numerical methods for solving the Stefan problem. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

Asset pricing for an affine jump‐diffusion model using an FD method of lines on nonuniform meshes

We present a novel numerical scheme for the valuation of options under a well‐known jump‐diffusion model. European option pricing for such a case satisfies a 1 + 2 partial integro‐differential equation (PIDE) including a double integral term, which is nonlocal. The proposed approach relies on nonuniform meshes with a focus on the discontinuous and degenerate areas of the model and applying quadratically convergent finite difference (FD) discretizations via the method of lines (MOL). A condition for observing the time stability of the fully discretized problem is given. Also, we report results of numerical experiments.     

Gegenbauer spectral method for time‐fractional convection–diffusion equations with variable coefficients

In this paper, we study the numerical solution to time‐fractional partial differential equations with variable coefficients that involve temporal Caputo derivative. A spectral method based on Gegenbauer polynomials is taken for approximating the solution of the given time‐fractional partial differential equation in time and a collocation method in space. The suggested method reduces this type of equation to the solution of a linear algebraic system. Finally, some numerical examples are presented to illustrate the efficiency and accuracy of the proposed method. Copyright © 2014 John Wiley & Sons, Ltd.     

Polynomial spectral collocation method for space fractional advection–diffusion equation

This article discusses the spectral collocation method for numerically solving nonlocal problems: one‐dimensional space fractional advection–diffusion equation; and two‐dimensional linear/nonlinear space fractional advection–diffusion equation. The differentiation matrixes of the left and right Riemann–Liouville and Caputo fractional derivatives are derived for any collocation points within any given bounded interval. Several numerical examples with different boundary conditions are computed to verify the efficiency of the numerical schemes and confirm the exponential convergence; the physical simulations for Lévy–Feller advection–diffusion equation and space fractional Fokker–Planck equation with initial δ‐peak and reflecting boundary conditions are performed; and the eigenvalue distributions of the iterative matrix for a variety of systems are displayed to illustrate the stabilities of the numerical schemes in more general cases. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 514–535, 2014     

Asymptotic preserving time‐discretization of optimal control problems for the Goldstein–Taylor model

We consider the development of implicit‐explicit time integration schemes for optimal control problems governed by the Goldstein–Taylor model. In the diffusive scaling, this model is a hyperbolic approximation to the heat equation. We investigate the relation of time integration schemes and the formal Chapman–Enskog‐type limiting procedure. For the class of stiffly accurate implicit–explicit Runge–Kutta methods, the discrete optimality system also provides a stable numerical method for optimal control problems governed by the heat equation. Numerical examples illustrate the expected behavior. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 1770–1784, 2014     

An efficient pseudo‐spectral Legendre–Galerkin method for solving a nonlinear partial integro‐differential equation arising in population dynamics

The pseudo‐spectral Legendre–Galerkin method (PS‐LGM) is applied to solve a nonlinear partial integro‐differential equation arising in population dynamics. This equation is a competition model in which similar individuals are competing for the same resources. It is a kind of reaction–diffusion equation with integral term corresponding to nonlocal consumption of resources. The proposed method is based on the Legendre–Galerkin formulation for the linear terms and interpolation operator at the Chebyshev–Gauss–Lobatto (CGL) points for the nonlinear terms. Also, the integral term, which is a kind of convolution, is directly computed by a fast and accurate method based on CGL interpolation operator, and thus, the use of any quadrature formula in its computation is avoided. The main difference of the PS‐LGM presented in the current paper with the classic LGM is in treating the nonlinear terms and imposing boundary conditions. Indeed, in the PS‐LGM, the nonlinear terms are efficiently handled using the CGL points, and also the boundary conditions are imposed strongly as collocation methods. Combination of the PS‐LGM with a semi‐implicit time integration method such as second‐order backward differentiation formula and Adams‐Bashforth method leads to reducing the complexity of computations and obtaining a linear algebraic system of equations with banded coefficient matrix. The desired equation is considered on one and two‐dimensional spatial domains. Efficiency, accuracy, and convergence of the proposed method are demonstrated numerically in both cases. Copyright © 2012 John Wiley & Sons, Ltd.     

An efficient explicit/implicit domain decomposition method for convection‐diffusion equations

A nonoverlapping domain decomposition method for some time‐dependent convection‐diffusion equations is presented. It combines predictor‐corrector technique, modified upwind differences with explicit/implicit coupling to provide intrinsic parallelism, and unconditional stability while improving the accuracy. Both rigorous mathematical analysis and numerical experiments are carried out to illustrate the stability, accuracy, and parallelism. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

First passage time for multivariate jump‐diffusion processes in finance and other areas of applications

The first passage time (FPT) problem is an important problem with a wide range of applications in science, engineering, economics, and industry. Mathematically, such a problem can be reduced to estimating the probability of a stochastic process first to reach a boundary level. In most important applications in the financial industry, the FPT problem does not have an analytical solution and the development of efficient numerical methods becomes the only practical avenue for its solution. Most of our examples in this contribution are centered around the evaluation of default correlations in credit risk analysis, where we are concerned with the joint defaults of several correlated firms, the task that is reducible to a FPT problem. This task represents a great challenge for jump‐diffusion processes (JDP). In this contribution, we develop further our previous fast Monte Carlo method in the case of multivariate (and correlated) JDP. This generalization allows us, among other things, to evaluate the default events of several correlated assets based on a set of empirical data. The developed technique is an efficient tool for a number of financial, economic, and business applications, such as credit analysis, barrier option pricing, macroeconomic dynamics, and the evaluation of risk, as well as for a number of other areas of applications in science and engineering, where the FPT problem arises. Copyright © 2008 John Wiley & Sons, Ltd.     

A collocation method of lines for two‐sided space‐fractional advection‐diffusion equations with variable coefficients

We present the method of lines (MOL), which is based on the spectral collocation method, to solve space‐fractional advection‐diffusion equations (SFADEs) on a finite domain with variable coefficients. We focus on the cases in which the SFADEs consist of both left‐ and right‐sided fractional derivatives. To do so, we begin by introducing a new set of basis functions with some interesting features. The MOL, together with the spectral collocation method based on the new basis functions, are successfully applied to the SFADEs. Finally, four numerical examples, including benchmark problems and a problem with discontinuous advection and diffusion coefficients, are provided to illustrate the efficiency and exponentially accuracy of the proposed method.     

An exponential high‐order compact ADI method for 3D unsteady convection–diffusion problems

In this article, we develop an exponential high order compact alternating direction implicit (EHOC ADI) method for solving three dimensional (3D) unsteady convection–diffusion equations. The method, which requires only a regular seven‐point 3D stencil similar to that in the standard second‐order methods, is second order accurate in time and fourth‐order accurate in space and unconditionally stable. The resulting EHOC ADI scheme in each alternating direction implicit (ADI) solution step corresponding to a strictly diagonally dominant matrix equation can be solved by the application of the one‐dimensional tridiagonal Thomas algorithm with a considerable saving in computing time. Numerical experiments for three test problems are carried out to demonstrate the performance of the present method and to compare it with the classical Douglas–Gunn ADI method and the Karaa's high‐order compact ADI method. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2013     

New exact solutions for seventh‐order Sawada–Kotera–Ito,Lax and Kaup–Kupershmidt equations using Exp‐function method

In this work, Exp‐function method is used to solve three different seventh‐order nonlinear partial differential KdV equations. Sawada–Kotera–Ito, Lax and Kaup–Kupershmidt equations are well known and considered for solve. Exp‐function method can be used as an alternative to obtain analytic and approximate solutions of different types of differential equations applied in engineering mathematics. Ultimately this method is implemented to solve these equations and convenient and effective solutions are obtained. Copyright © 2009 John Wiley & Sons, Ltd.     

High‐order characteristic‐tracking strategy for simulation of a nonlinear advection–diffusion equation

In this study, new high‐order backward semi‐Lagrangian methods are developed to solve nonlinear advection–diffusion type problems, which are realized using high‐order characteristic‐tracking strategies. The proposed characteristic‐tracking strategies are second‐order L‐stable and third‐order L(α)‐stable methods, which are based on a classical implicit multistep method combined with a error‐correction method. We also use backward differentiation formulas and the fourth‐order finite‐difference scheme for diffusion problem discretization in the temporal and spatial domains, respectively. To demonstrate the adaptability and efficiency of these time‐discretization strategies, we apply these methods to nonlinear advection–diffusion type problems such as the viscous Burgers' equation. Through simulations, not only the temporal and spatial accuracies are numerically evaluated but also the proposed methods are shown to be superior to the compared existing characteristic‐tracking methods under the same rates of convergence in terms of accuracy and efficiency. Finally, we have shown that the proposed method well preserves the energy and mass when the viscosity coefficient becomes zero.     

Effect of numerical integration in the DGFEM for nonlinear convection‐diffusion problems

This paper is concerned with the effect of numerical integration applied to the discontinuous Galerkin finite element discretization of nonlinear convection‐diffusion problems in 2D. In the space semidiscretization the volume and line integrals are evaluated by numerical quadratures. Our goal is to estimate the error caused by the numerical integration and to show what numerical quadratures guarantee that the accuracy of the method with exact integration is preserved. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

High‐order numerical solution of second‐order one‐dimensional hyperbolic telegraph equation using a shifted Gegenbauer pseudospectral method

We present a high‐order shifted Gegenbauer pseudospectral method (SGPM) to solve numerically the second‐order one‐dimensional hyperbolic telegraph equation provided with some initial and Dirichlet boundary conditions. The framework of the numerical scheme involves the recast of the problem into its integral formulation followed by its discretization into a system of well‐conditioned linear algebraic equations. The integral operators are numerically approximated using some novel shifted Gegenbauer operational matrices of integration. We derive the error formula of the associated numerical quadratures. We also present a method to optimize the constructed operational matrix of integration by minimizing the associated quadrature error in some optimality sense. We study the error bounds and convergence of the optimal shifted Gegenbauer operational matrix of integration. Moreover, we construct the relation between the operational matrices of integration of the shifted Gegenbauer polynomials and standard Gegenbauer polynomials. We derive the global collocation matrix of the SGPM, and construct an efficient computational algorithm for the solution of the collocation equations. We present a study on the computational cost of the developed computational algorithm, and a rigorous convergence and error analysis of the introduced method. Four numerical test examples have been carried out to verify the effectiveness, the accuracy, and the exponential convergence of the method. The SGPM is a robust technique, which can be extended to solve a wide range of problems arising in numerous applications. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 307–349, 2016     

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     

A pseudo‐spectral method that uses an overlapping multidomain technique for the numerical solution of sine‐Gordon equation in one and two spatial dimensions

In this article, we study an explicit scheme for the solution of sine‐Gordon equation when the space discretization is carried out by an overlapping multidomain pseudo‐spectral technique. By using differentiation matrices, the equation is reduced to a nonlinear system of ordinary differential equations in time that can be discretized with the explicit fourth‐order Runge–Kutta method. To achieve approximation with high accuracy in large domains, the number of space grid points must be large enough. This yields very large and full matrices in the pseudo‐spectral method that causes large memory requirements. The domain decomposition approach provides sparsity in the matrices obtained after the discretization, and this property reduces storage for large matrices and provides economical ways of performing matrix–vector multiplications. Therefore, we propose a multidomain pseudo‐spectral method for the numerical simulation of the sine‐Gordon equation in large domains. Test examples are given to demonstrate the accuracy and capability of the proposed method. Numerical experiments show that the multidomain scheme has an excellent long‐time numerical behavior for the sine‐Gordon equation in one and two dimensions. Copyright © 2013 John Wiley & Sons, Ltd.     

Application of the exp‐function method to nonlinear lattice differential equations for multi‐wave and rational solutions

In this paper, we extend the basic Exp‐function method to nonlinear lattice differential equations for constructing multi‐wave and rational solutions for the first time. We consider a differential‐difference analogue of the Korteweg–de Vries equation to elucidate the solution procedure. Our approach is direct and unifying in the sense that the bilinear formalism of the equation studied becomes redundant. Copyright © 2011 John Wiley & Sons, Ltd.