Numerical Solution of the Bagley-Torvik Equation

We consider the numerical solution of the Bagley-Torvik equation Ay(t) + BD _* ^3/2 y(t) + Cy(t) = f(t), as a prototype fractional differential equation with two derivatives. Approximate solutions have recently been proposed in the book and papers of Podlubny in which the solution obtained with approximate methods is compared to the exact solution. In this paper we consider the reformulation of the Bagley-Torvik equation as a system of fractional differential equations of order 1/2. This allows us to propose numerical methods for its solution which are consistent and stable and have arbitrarily high order. In this context we specifically look at fractional linear multistep methods and a predictor-corrector method of Adams type.     

The pointwise estimates of a conservative difference scheme for Burgers' equation

In this article, we are concerned with the numerical analysis of a nonlinear implicit difference scheme for Burgers' equation. A priori estimation of the analytical solution is provided in the sense of L^∞ -norm when the initial value is bounded in H¹-norm. Conservation, boundedness, and unique solvability are proved at length. Inspired by the method of the priori estimation for the analytical solution, we prove the convergence and stability of the difference scheme in L^∞ -norm. Finally, numerical examples are carried out to verify our theoretical results.     

Convergence analysis for second‐order accurate schemes for the periodic nonlocal Allen‐Cahn and Cahn‐Hilliard equations

In this paper, we provide a detailed convergence analysis for fully discrete second‐order (in both time and space) numerical schemes for nonlocal Allen‐Cahn and nonlocal Cahn‐Hilliard equations. The unconditional unique solvability and energy stability ensures ? ⁴ stability. The convergence analysis for the nonlocal Allen‐Cahn equation follows the standard procedure of consistency and stability estimate for the numerical error function. For the nonlocal Cahn‐Hilliard equation, because of the complicated form of the nonlinear term, a careful expansion of its discrete gradient is undertaken, and an H ^?1 inner‐product estimate of this nonlinear numerical error is derived to establish convergence. In addition, an a priori bound of the numerical solution at the discrete level is needed in the error estimate. Such a bound can be obtained by performing a higher order consistency analysis by using asymptotic expansions for the numerical solution. Following the technique originally proposed by Strang (eg, 1964), instead of the standard comparison between the exact and numerical solutions, an error estimate between the numerical solution and the constructed approximate solution yields an O (s ³+h ⁴) convergence in norm, in which s and h denote the time step and spatial mesh sizes, respectively. This in turn leads to the necessary bound under a standard constraint s ≤C h . Here, we also prove convergence of the scheme in the maximum norm under the same constraint.     

On a backward problem for fractional diffusion equation with Riemann-Liouville derivative

In the present paper, we study the initial inverse problem (backward problem) for a two-dimensional fractional differential equation with Riemann-Liouville derivative. Our model is considered in the random noise of the given data. We show that our problem is not well-posed in the sense of Hadamard. A truncated method is used to construct an approximate function for the solution (called the regularized solution). Furthermore, the error estimate of the regularized solution in L² and H^τ norms is considered and illustrated by numerical example.     

On the Convergence of Finite Element Method for Second Order Elliptic Interface Problems

The purpose of this paper is to study the convergence of finite element approximation to the exact solution of general self-adjoint elliptic equations with discontinuous coefficients. Due to low global regularity of the solution, it is difficult to achieve optimal order of convergence with classical finite element methods [Numer. Math. 1998; 79:175–202]. In this paper, an isoparametric type of discretization is used to prove optimal order error estimates in L ² and H ¹ norms when the global regularity of the solution is low. The interface is assumed to be of arbitrary shape and is smooth for our purpose. Further, for the purpose of numerical computations, we discuss the effect of numerical quadrature on finite element solution, and the related optimal order estimates are also established.     

A priori error estimates of an extrapolated space‐time discontinuous galerkin method for nonlinear convection‐diffusion problems

We deal with the numerical solution of a scalar nonstationary nonlinear convection‐diffusion equation. We employ a combination of the discontinuous Galerkin finite element (DGFE) method for the space as well as time discretization. The linear diffusive and penalty terms are treated implicitly whereas the nonlinear convective term is treated by a special higher order explicit extrapolation from the previous time step, which leads to the necessity to solve only a linear algebraic problem at each time step. We analyse this scheme and derive a priori asymptotic error estimates in the L^∞(L²) –norm and the L²(H¹) –seminorm with respect to the mesh size h and time step τ. Finally, we present an efficient solution strategy and numerical examples verifying the theoretical results. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1456–1482, 2010     

Numerical solution of first‐order hyperbolic partial differential‐difference equation with shift

In this article, we continue the numerical study of hyperbolic partial differential‐difference equation that was initiated in (Sharma and Singh, Appl Math Comput 9 ). In Sharma and Singh, the authors consider the problem with sufficiently small shift arguments. The term negative shift and positive shift are used for delay and advance arguments, respectively. Here, we propose a numerical scheme that works nicely irrespective of the size of shift arguments. In this article, we consider hyperbolic partial differential‐difference equation with negative or positive shift and present a numerical scheme based on the finite difference method for solving such type of initial and boundary value problems. The proposed numerical scheme is analyzed for stability and convergence in L^∞ norm. Finally, some test examples are given to validate convergence, the computational efficiency of the numerical scheme and the effect of shift arguments on the solution.© 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

A priori error estimates for interior penalty versions of the local discontinuous Galerkin method applied to transport equations

The local discontinuous Galerkin method has been developed recently by Cockburn and Shu for convection‐dominated convection‐diffusion equations. In this article, we consider versions of this method with interior penalties for the numerical solution of transport equations, and derive a priori error estimates. We consider two interior penalty methods, one that penalizes jumps in the solution across interelement boundaries, and another that also penalizes jumps in the diffusive flux across such boundaries. For the first penalty method, we demonstrate convergence of order k in the L^∞(L²) norm when polynomials of minimal degree k are used, and for the second penalty method, we demonstrate convergence of order k+1/2. Through a parabolic lift argument, we show improved convergence of order k+1/2 (k+1) in the L²(L²) norm for the first penalty method with a penalty parameter of order one (h^?1). © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17: 545–564, 2001     

Finite element method for Grwünwald–Letnikov time-fractional partial differential equation

In this article, we consider the finite element methods (FEM) for Grwünwald–Letnikov time-fractional diffusion equation, which is obtained from the standard two-dimensional diffusion equation by replacing the first-order time derivative with a fractional derivative (of order α, with 0?h ^r+1?+?τ^2-α), where h, τ and r are the space step size, time step size and polynomial degree, respectively. A numerical example is presented to verify the order of convergence.     

On the Hermitian positive defnite solution of the nonlinear matrix equation X + A*X −1 A + B*X −1 B = I

In this paper, we study the matrix equation X + A*X ⁻¹ A + B*X ⁻¹ B = I, where A, B are square matrices, and obtain some conditions for the existence of the positive definite solution of this equation. Two iterative algorithms to find the positive definite solution are given. Some numerical results are reported to illustrate the effectiveness of the algorithms. This research supported by the National Natural Science Foundation of China 10571047 and Doctorate Foundation of the Ministry of Education of China 20060532014.     

Some predictor–corrector‐type iterative schemes for solving nonsymmetric algebraic Riccati equations arising in transport theory

It is as well known that nonsymmetric algebraic Riccati equations arising in transport theory can be translated to vector equations. In this paper, we propose six predictor–corrector‐type iterative schemes to solve the vector equations. And we give the convergence of these schemes. Unlike the previous work, we prove that all of them converge to the minimal positive solution of the vector equations by the initial vector (e,e), where e = (1,1, ? ,1)^T. Moreover, we prove that all the sequences generated by the iterative schemes are strictly and monotonically increasing and bounded above. In addition, some numerical results are also reported in the paper, which confirm the good theoretical properties of our approach. Copyright © 2014 John Wiley & Sons, Ltd.     

On approximation in the fictitious domain method for a bidimensional transport equation

In this article a numerical method for solving a two‐dimensional transport equation in the stationary case is presented. Using the techniques of the variational calculus, we find the approximate solution for a homogeneous boundary‐value problem that corresponds to a square domain D₂. Then, using the method of the fictitious domain, we extend our algorithm to a boundary value problem for a set D that has an arbitrary shape. In this approach, the initial computation domain D (called physical domain) is immersed in a square domain D₂. We prove that the solution obtained by this method is a good approximation of the exact solution. The theoretical results are verified with the help of a numerical example. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

Interior penalty discontinuous Galerkin methods with implicit time‐integration techniques for nonlinear parabolic equations

We prove existence and numerical stability of numerical solutions of three fully discrete interior penalty discontinuous Galerkin methods for solving nonlinear parabolic equations. Under some appropriate regularity conditions, we give the l²(H¹) and l^∞(L²) error estimates of the fully discrete symmetric interior penalty discontinuous Galerkin–scheme with the implicit θ ‐schemes in time, which include backward Euler and Crank–Nicolson finite difference approximations. Our estimates are optimal with respect to the mesh size h. The theoretical results are confirmed by some numerical experiments. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Superconvergence of the direct discontinuous Galerkin method for a time‐fractional initial‐boundary value problem

A time‐fractional reaction–diffusion initial‐boundary value problem with periodic boundary condition is considered on Q ? Ω × [0, T] , where Ω is the interval [0, l] . Typical solutions of such problem have a weak singularity at the initial time t = 0. The numerical method of the paper uses a direct discontinuous Galerkin (DDG) finite element method in space on a uniform mesh, with piecewise polynomials of degree k ≥ 2 . In the temporal direction we use the L1 approximation of the Caputo derivative on a suitably graded mesh. We prove that at each time level of the mesh, our L1‐DDG solution is superconvergent of order k + 2 in L²(Ω) to a particular projection of the exact solution. Moreover, the L1‐DDG solution achieves superconvergence of order (k + 2) in a discrete L²(Q) norm computed at the Lobatto points, and order (k + 1) superconvergence in a discrete H¹(Q) seminorm at the Gauss points; numerical results show that these estimates are sharp.     

Perturbation analysis of the matrix equation

Consider the nonlinear matrix equation X-A^*X^-pA=Q with 0<p1. This paper shows that there exists a unique positive definite solution to the equation. A perturbation bound and the backward error of an approximate solution to this solution is evaluated. We also obtain explicit expressions of the condition number for the unique positive definite solution. The theoretical results are illustrated by numerical examples.     

Numerical solution of two-dimensional time fractional cable equation with Mittag-Leffler kernel

The main motive of this article is to study the recently developed Atangana-Baleanu Caputo (ABC) fractional operator that is obtained by replacing the classical singular kernel by Mittag-Leffler kernel in the definition of the fractional differential operator. We investigate a novel numerical method for the nonlinear two-dimensional cable equation in which time-fractional derivative is of Mittag-Leffler kernel type. First, we derive an approximation formula of the fractional-order ABC derivative of a function t^k using a numerical integration scheme. Using this approximation formula and some properties of shifted Legendre polynomials, we derived the operational matrix of ABC derivative. In the author of knowledge, this operational matrix of ABC derivative is derived the first time. We have shown the efficiency of this newly derived operational matrix by taking one example. Then we solved a new class of fractional partial differential equations (FPDEs) by the implementation of this ABC operational matrix. The two-dimensional model of the time-fractional model of the cable equation is solved and investigated by this method. We have shown the effectiveness and validity of our proposed method by giving the solution of some numerical examples of the two-dimensional fractional cable equation. We compare our obtained numerical results with the analytical results, and we conclude that our proposed numerical method is feasible and the accuracy can be seen by error tables. We see that the accuracy is so good. This method will be very useful to investigate a different type of model that have Mittag-Leffler fractional derivative.     

Qualitative Features of Periodic Solutions of KdV

In this paper we prove new qualitative features of solutions of KdV on the circle. The first result says that the Fourier coefficients of a solution of KdV in Sobolev space H ^N , N ≥ 0, admit a WKB type expansion up to first order with strongly oscillating phase factors defined in terms of the KdV frequencies. The second result provides estimates for the approximation of such a solution by trigonometric polynomials of sufficiently large degree.     

Spline methods for the solution of hyperbolic equation with variable coefficients

In this study, we developed the methods based on nonpolynomial cubic spline for numerical solution of second‐order nonhomogeneous hyperbolic partial differential equation. Using nonpolynomial cubic spline in space and finite difference in time directions, we obtained the implicit three level methods of O(k² + h²) and O(k² + h⁴). The proposed methods are applicable to the problems having singularity at x = 0, too. Stability analysis of the presented methods have been carried out. The presented methods are applied to the nonhomogeneous examples of different types. Numerical comparison with Mohanty's method (Mohanty, Appl Math Comput, 165 (2005), 229–236) shows the superiority of our presented schemes. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Fast Computational Procedure for Solving Multi-Item Single-Machine Lot Scheduling Optimization Problems

In this paper, we deal with the numerical solution of the optimal scheduling problem in a multi-item single machine. We develop a method of discretization and a computational procedure which allows us to compute the solution in a short time and with a precision of order k, where k is the discretization size. In our method, the nodes of the triangulation mesh are joined by segments of trajectories of the original system. This special feature allows us to obtain precision of order k, which is in general impossible to achieve by usual methods. Also, we develop a highly efficient algorithm which converges in a finite number of steps.     

A Decomposition Theorem for the Solutions to the Interface Problems of Quasi-Linear Elliptic Equations

Interface problems for second order quasi-linear elliptic partial differential equations in a two-dimensional space are studied. We prove that each weak solution can be decomposed into two parts near singular points, one of which is a finite sum of functions of the form cr^a log^m rφ(θ), where the coefficients c depend on the H^1-norm of the solution, the C^(0,δ) -norm of the solution, and the equation only; and the other one of which is a regular one, the norm of which is also estimated.