A series of high‐order quasi‐compact schemes for space fractional diffusion equations based on the superconvergent approximations for fractional derivatives

Based on the superconvergent approximation at some point (depending on the fractional order α, but not belonging to the mesh points) for Grünwald discretization to fractional derivative, we develop a series of high‐order quasi‐compact schemes for space fractional diffusion equations. Because of the quasi‐compactness of the derived schemes, no points beyond the domain are used for all the high‐order schemes including second‐order, third‐order, fourth‐order, and even higher‐order schemes; moreover, the algebraic equations for all the high‐order schemes have the completely same matrix structure. The stability and convergence analysis for some typical schemes are made; the techniques of treating the fractional derivatives with nonhomogeneous boundaries are introduced; and extensive numerical experiments are performed to confirm the theoretical analysis or verify the convergence orders. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1345–1381, 2015     

Stancu‐type generalization of Dunkl analogue of Szász–Kantorovich operators

The purpose of the paper is to introduce Stancu‐type linear positive operators generated by Dunkl generalization of exponential function. We present approximation properties with the help of well‐known Korovkin‐type theorem and weighted Korovkin‐type theorem and also acquire the rate of convergence in terms of classical modulus of continuity, the class of Lipschitz functions, Peetre's K‐functional, and second‐order modulus of continuity by Dunkl analogue of Szász operators. Copyright © 2015 John Wiley & Sons, Ltd.     

Convergence analysis of projected fixed‐point iteration on a low‐rank matrix manifold

In this paper, we analyze the convergence of a projected fixed‐point iteration on a Riemannian manifold of matrices with fixed rank. As a retraction method, we use the projector splitting scheme. We prove that the convergence rate of the projector splitting scheme is bounded by the convergence rate of standard fixed‐point iteration without rank constraints multiplied by the function of initial approximation. We also provide counterexample to the case when conditions of the theorem do not hold. Finally, we support our theoretical results with numerical experiments.     

Dunkl generalization of Szász beta‐type operators

The goal in the paper is to advertise Dunkl extension of Szász beta‐type operators. We initiate approximation features via acknowledged Korovkin and weighted Korovkin theorem and obtain the convergence rate from the point of modulus of continuity, second‐order modulus of continuity, the Lipschitz class functions, Peetre's K‐functional, and modulus of weighted continuity by Dunkl generalization of Szász beta‐type operators.     

A spectral element method using the modal basis and its application in solving second‐order nonlinear partial differential equations

We present a high‐order spectral element method (SEM) using modal (or hierarchical) basis for modeling of some nonlinear second‐order partial differential equations in two‐dimensional spatial space. The discretization is based on the conforming spectral element technique in space and the semi‐implicit or the explicit finite difference formula in time. Unlike the nodal SEM, which is based on the Lagrange polynomials associated with the Gauss–Lobatto–Legendre or Chebyshev quadrature nodes, the Lobatto polynomials are used in this paper as modal basis. Using modal bases due to their orthogonal properties enables us to exactly obtain the elemental matrices provided that the element‐wise mapping has the constant Jacobian. The difficulty of implementation of modal approximations for nonlinear problems is treated in this paper by expanding the nonlinear terms in the weak form of differential equations in terms of the Lobatto polynomials on each element using the fast Fourier transform (FFT). Utilization of the Fourier interpolation on equidistant points in the FFT algorithm and the enough polynomial order of approximation of the nonlinear terms can lead to minimize the aliasing error. Also, this approach leads to finding numerical solution of a nonlinear differential equation through solving a system of linear algebraic equations. Numerical results for some famous nonlinear equations illustrate efficiency, stability and convergence properties of the approximation scheme, which is exponential in space and up to third‐order in time. Copyright © 2014 John Wiley & Sons, Ltd.     

Renormalization group second‐order approximation for singularly perturbed nonlinear ordinary differential equations

We consider a 2 time scale nonlinear system of ordinary differential equations. The small parameter of the system is the ratio ϵ of the time scales. We search for an approximation involving only the slow time unknowns and valid uniformly for all times at order O(ϵ²). A classical approach to study these problems is Tikhonov's singular perturbation theorem. We develop an approach leading to a higher order approximation using the renormalization group (RG) method. We apply it in 2 steps. In the first step, we show that the RG method allows for approximation of the fast time variables by their RG expansion taken at the slow time unknowns. Next, we study the slow time equations, where the fast time unknowns are replaced by their RG expansion. This allows to rigorously show the second order uniform error estimate. Our result is a higher order extension of Hoppensteadt's work on the Tikhonov singular perturbation theorem for infinite times. The proposed procedure is suitable for problems from applications, and it is computationally less demanding than the classical Vasil'eva‐O'Malley expansion. We apply the developed method to a mathematical model of stem cell dynamics.     

Semi‐implicit schemes for transient Navier–Stokes equations and eddy viscosity models

This study presents two computational schemes for the numerical approximation of solutions to eddy viscosity models as well as transient Navier–Stokes equations. The eddy viscosity model is one example of a class of Large Eddy Simulation models, which are used to simulate turbulent flow. The first approximation scheme is a first order single step method that treats the nonlinear term using a semi‐implicit discretization. The second scheme employs a two step approach that applies a Crank–Nicolson method for the nonlinear term while also retaining the semi‐implicit treatment used in the first scheme. A finite element approximation is used in the spatial discretization of the partial differential equations. The convergence analysis for both schemes is discussed in detail, and numerical results are given for two test problems one of which is the two dimensional flow around a cylinder. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Graded Galerkin methods for the high‐order convection‐diffusion problem

We develop a Galerkin method using the Hermite spline on an admissible graded mesh for solving the high‐order singular perturbation problem of the convection‐diffusion type. We identify a special function class to which the solution of the convection‐diffusion problem belongs and characterize the approximation order of the Hermite spline for such a function class. The approximation order is then used to establish the optimal order of uniform convergence for the Galerkin method. Numerical results are presented to confirm the theoretical estimate.© 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Radial basis collocation method and quasi‐Newton iteration for nonlinear elliptic problems

This work presents a radial basis collocation method combined with the quasi‐Newton iteration method for solving semilinear elliptic partial differential equations. The main result in this study is that there exists an exponential convergence rate in the radial basis collocation discretization and a superlinear convergence rate in the quasi‐Newton iteration of the nonlinear partial differential equations. In this work, the numerical error associated with the employed quadrature rule is considered. It is shown that the errors in Sobolev norms for linear elliptic partial differential equations using radial basis collocation method are bounded by the truncation error of the RBF. The combined errors due to radial basis approximation, quadrature rules, and quasi‐Newton and Newton iterations are also presented. This result can be extended to finite element or finite difference method combined with any iteration methods discussed in this work. The numerical example demonstrates a good agreement between numerical results and analytical predictions. The numerical results also show that although the convergence rate of order 1.62 of the quasi‐Newton iteration scheme is slightly slower than rate of order 2 in the Newton iteration scheme, the former is more stable and less sensitive to the initial guess. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

A highly accurate Jacobi collocation algorithm for systems of high‐order linear differential–difference equations with mixed initial conditions

In this paper, a shifted Jacobi–Gauss collocation spectral algorithm is developed for solving numerically systems of high‐order linear retarded and advanced differential–difference equations with variable coefficients subject to mixed initial conditions. The spatial collocation approximation is based upon the use of shifted Jacobi–Gauss interpolation nodes as collocation nodes. The system of differential–difference equations is reduced to a system of algebraic equations in the unknown expansion coefficients of the sought‐for spectral approximations. The convergence is discussed graphically. The proposed method has an exponential convergence rate. The validity and effectiveness of the method are demonstrated by solving several numerical examples. Numerical examples are presented in the form of tables and graphs to make comparisons with the results obtained by other methods and with the exact solutions more easier. Copyright © 2015 John Wiley & Sons, Ltd.     

Gauss‐Lobatto‐Legendre‐Birkhoff pseudospectral approximations for the multi‐term time fractional diffusion‐wave equation with Neumann boundaryconditions

A second‐order finite difference/pseudospectral scheme is proposed for numerical approximation of multi‐term time fractional diffusion‐wave equation with Neumann boundary conditions. The scheme is based upon the weighted and shifted Grünwald difference operators approximation of the time fractional calculus and Gauss‐Lobatto‐Legendre‐Birkhoff (GLLB) pseudospectral method for spatial discretization. The unconditionally stability and convergence of the scheme are rigorously proved. Numerical examples are carried out to verify theoretical results.     

A numerical algorithm for the solution of nonlinear fractional differential equations via beta‐derivatives

In this paper, the sinc‐collocation method (SCM) is investigated to obtain the solution of the nonlinear fractional order differential equations based on the relatively new defined fractional derivative, beta‐derivative. For this purpose, a theorem is proved for the approximate solution obtained from the SCM. Moreover, convergence analysis of the SCM is presented. To show the efficiency and the simplicity of the proposed method, some examples are solved, and the results are compared with the exact solutions of the considered equations.     

A new technique of using homotopy analysis method for solving high‐order nonlinear differential equations

In this paper, a new technique of homotopy analysis method (HAM) is proposed for solving high‐order nonlinear initial value problems. This method improves the convergence of the series solution, eliminates the unneeded terms and reduces time consuming in the standard homotopy analysis method (HAM) by transform the nth‐order nonlinear differential equation to a system of n first‐order equations. Second‐ and third‐ order problems are solved as illustration examples of the proposed method. Copyright © 2010 John Wiley & Sons, Ltd.     

q‐Voronovskaya type theorems for q‐Baskakov operators

In the present paper, we prove quantitative q‐Voronovskaya type theorems for q‐Baskakov operators in terms of weighted modulus of continuity. We also present a new form of Voronovskaya theorem, that is, q‐Grüss‐Voronovskaya type theorem for q‐Baskakov operators in quantitative mean. Hence, we describe the rate of convergence and upper bound for the error of approximation, simultaneously. Our results are valid for the subspace of continuous functions although classical ones is valid for differentiable functions. Copyright © 2015 John Wiley & Sons, Ltd.     

Some approximation properties of a Durrmeyer variant of q‐Bernstein–Schurer operators

In this paper, we will propose a Durrmeyer variant of q‐Bernstein–Schurer operators. A Bohman–Korovkin‐type approximation theorem of these operators is considered. The rate of convergence by using the first modulus of smoothness is computed. The statistical approximation of these operators is also studied. Copyright © 2016 John Wiley & Sons, Ltd.     

Singly diagonally implicit runge‐kutta method for time‐dependent reaction‐diffusion equation

In this article, an efficient fourth‐order accurate numerical method based on Padé approximation in space and singly diagonally implicit Runge‐Kutta method in time is proposed to solve the time‐dependent one‐dimensional reaction‐diffusion equation. In this scheme, we first approximate the spatial derivative using the second‐order central finite difference then improve it to fourth‐order by applying Padé approximation. A three stage fourth‐order singly diagonally implicit Runge‐Kutta method is then used to solve the resulting system of ordinary differential equations. It is also shown that the scheme is unconditionally stable, and is suitable for stiff problems. Several numerical examples are solved by the scheme and the efficiency and accuracy of the new scheme are compared with two widely used high‐order compact finite difference methods. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1423–1441, 2011     

Some approximation results involving the q‐Szász–Mirakjan–Kantorovich type operators via Dunkl's generalization

The purpose of this paper is to introduce a family of q‐Szász–Mirakjan–Kantorovich type positive linear operators that are generated by Dunkl's generalization of the exponential function. We present approximation properties with the help of well‐known Korovkin's theorem and determine the rate of convergence in terms of classical modulus of continuity, the class of Lipschitz functions, Peetre's K‐functional, and the second‐order modulus of continuity. Furthermore, we obtain the approximation results for bivariate q‐Szász–Mirakjan–Kantorovich type operators that are also generated by the aforementioned Dunkl generalization of the exponential function. Copyright © 2017 John Wiley & Sons, Ltd.     

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.     

An efficient numerical treatment of fourth‐order fractional diffusion‐wave problems

In this paper, we consider the numerical treatment of a fourth‐order fractional diffusion‐wave problem. Our proposed method includes the use of parametric quintic spline in the spatial dimension and the weighted shifted Grünwald‐Letnikov approximation of fractional integral. The solvability, stability, and convergence of the numerical scheme are rigorously proved. It is shown that the theoretical convergence order improves those of earlier work. Simulation is further carried out to demonstrate the numerical efficiency of the proposed scheme and to compare with other methods.     

Fractional‐order orthogonal Bernstein polynomials for numerical solution of nonlinear fractional partial Volterra integro‐differential equations

In this paper, a new two‐dimensional fractional polynomials based on the orthonormal Bernstein polynomials has been introduced to provide an approximate solution of nonlinear fractional partial Volterra integro‐differential equations. For this aim, the fractional‐order orthogonal Bernstein polynomials (FOBPs) are constructed, and its operational matrices of integration, fractional‐order integration, and derivative in the Caputo sense and product operational matrix are derived. These operational matrices are utilized to reduce the under study problem to a nonlinear system of algebraic equations. Using the approximation of FOBPs, the convergence analysis and error estimate associated to the proposed problem have been investigated. Finally, several examples are included to clarify the validity, efficiency, and applicability of the proposed technique via FOBPs approximation.