A collocation method for solving singular integro-differential equations

This paper describes a collocation method for numerically solving Cauchy-type linear singular integro-differential equations. The numerical method is based on the transformation of the integro-differential equation into an integral equation, and then applying a collocation method to solve the latter. The collocation points are chosen as the Chebyshev nodes. Uniform convergence of the resulting method is then discussed. Numerical examples are presented and solved by the numerical techniques.     

The combination of collocation,finite difference,and multigrid methods for solution of the two‐dimensional wave equation

In this article, we apply compact finite difference approximations of orders two and four for discretizing spatial derivatives of wave equation and collocation method for the time component. The resulting method is unconditionally stable and solves the wave equation with high accuracy. The solution is approximated by a polynomial at each grid point that its coefficients are determined by solving a linear system of equations. We employ the multigrid method for solving the resulted linear system. Multigrid method is an iterative method which has grid independently convergence and solves the linear system of equations in small amount of computer time. Numerical results show that the compact finite difference approximation of fourth order, collocation and multigrid methods produce a very efficient method for solving the wave equation. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

The Linear Rational Pseudospectral Method with Preassigned Poles

We present a linear rational pseudospectral (collocation) method with preassigned poles for solving boundary value problems. It consists in attaching poles to the trial polynomial so as to make it a rational interpolant. Its convergence is proved by transforming the problem into an associated boundary value problem. Numerical examples demonstrate that the rational pseudospectral method is often more efficient than the polynomial method.     

A new Jacobi rational–Gauss collocation method for numerical solution of generalized pantograph equations

This paper is concerned with a generalization of a functional differential equation known as the pantograph equation which contains a linear functional argument. In this article, a new spectral collocation method is applied to solve the generalized pantograph equation with variable coefficients on a semi-infinite domain. This method is based on Jacobi rational functions and Gauss quadrature integration. The Jacobi rational-Gauss method reduces solving the generalized pantograph equation to a system of algebraic equations. Reasonable numerical results are obtained by selecting few Jacobi rational–Gauss collocation points. The proposed Jacobi rational–Gauss method is favorably compared with other methods. Numerical results demonstrate its accuracy, efficiency, and versatility on the half-line.     

Collocation and iterated collocation methods for a class of weakly singular Volterra integral equations

We discuss the convergence properties of spline collocation and iterated collocation methods for a weakly singular Volterra integral equation associated with certain heat conduction problems. This work completes the previous studies of numerical methods for this type of equations with noncompact kernel. In particular, a global convergence result is obtained and it is shown that discrete superconvergence can be achieved with the iterated collocation if the exact solution belongs to some appropriate spaces. Some numerical examples illustrate the theoretical results.     

A product integration method for the approximation of the early exercise boundary in the American option pricing problem

Integral equation methods are now becoming well‐established tools in the study of financial models used in theory and practice. In this paper, we investigate the fully nonlinear weakly singular nonstandard Volterra integral equations representing the early exercise boundary of American option contracts, which gained popularity in recent years. We propose a product integration approach based on linear barycentric rational interpolation to solve the problem. The price of the option will then be computed using the obtained approximation of the early exercise boundary and a barycentric rational quadrature. The convergence of the approximation scheme will also be analyzed. Finally, some numerical experiments based on the introduced method are presented and compared with some exiting approaches.     

Spline collocation methods for linear multi-term fractional differential equations

Some regularity properties of the solution of linear multi-term fractional differential equations are derived. Based on these properties, the numerical solution of such equations by piecewise polynomial collocation methods is discussed. The results obtained in this paper extend the results of Pedas and Tamme (2011) [15] where we have assumed that in the fractional differential equation the order of the highest derivative of the unknown function is an integer. In the present paper, we study the attainable order of convergence of spline collocation methods for solving general linear fractional differential equations using Caputo form of the fractional derivatives and show how the convergence rate depends on the choice of the grid and collocation points. Theoretical results are verified by some numerical examples.     

Spline collocation methods for linear multi-term fractional differential equations

Some regularity properties of the solution of linear multi-term fractional differential equations are derived. Based on these properties, the numerical solution of such equations by piecewise polynomial collocation methods is discussed. The results obtained in this paper extend the results of Pedas and Tamme (2011) [15] where we have assumed that in the fractional differential equation the order of the highest derivative of the unknown function is an integer. In the present paper, we study the attainable order of convergence of spline collocation methods for solving general linear fractional differential equations using Caputo form of the fractional derivatives and show how the convergence rate depends on the choice of the grid and collocation points. Theoretical results are verified by some numerical examples.     

On the convergence of spline collocation methods for solving fractional differential equations

In the first part of this paper we study the regularity properties of solutions of initial value problems of linear multi-term fractional differential equations. We then use these results in the convergence analysis of a polynomial spline collocation method for solving such problems numerically. Using an integral equation reformulation and special non-uniform grids, global convergence estimates are derived. From these estimates it follows that the method has a rapid convergence if we use suitable nonuniform grids and the nodes of the composite Gaussian quadrature formulas as collocation points. Theoretical results are verified by some numerical examples.     

Rational scaled generalized Laguerre function collocation method for solving the Blasius equation

In this paper we propose, a collocation method for solving the Blasius equation. The Blasius equation is a third-order nonlinear ordinary differential equation. This approach is based on a rational scaled generalized Laguerre function collocation method. We also present the comparison of this work with some well-known results and show that the present solution is accurate.     

A steady barycentric Lagrange interpolation method for the 2D higher‐order time‐fractional telegraph equation with nonlocal boundary condition with error analysis

In this paper, we consider the numerical solution of the time‐fractional telegraph equation with a nonlocal boundary condition. A novel barycentric Lagrange interpolation collocation method is developed to solve this equation. Two difficulties have been sorted: the singularity of the integration and the higher accuracy. At the same, we put forward a steady barycentric Lagrange interpolation technique to overcome the new “Runge” phenomenon in computation. Error estimates of the barycentric Lagrange interpolation and the time‐fractional telegraph system for the present method are presented in Sobolev spaces. High convergence rates of the proposed method are obtained and are consisted with the numerical values. Especially in the time dimension, we get the error bound, for h‐refinement and for n_t‐density in the L₂ norms. The numerical results obtained show that the proposed numerical algorithm is accurate and computationally efficient for solving time‐fractional telegraph equation. Experiments demonstrate the high convergence rates of the proposed method are consisted with the theoretical values.     

High order implicit collocation method for the solution of two‐dimensional linear hyperbolic equation

In this article, we introduce a high‐order accurate method for solving the two dimensional linear hyperbolic equation. We apply a compact finite difference approximation of fourth order for discretizing spatial derivatives of linear hyperbolic equation and collocation method for the time component. The resulted method is unconditionally stable and solves the two‐dimensional linear hyperbolic equation with high accuracy. In this technique, the solution is approximated by a polynomial at each grid point that its coefficients are determined by solving a linear system of equations. Numerical results show that the compact finite difference approximation of fourth order and collocation method give a very efficient approach for solving the two dimensional linear hyperbolic equation. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

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.     

Sinc collocation method with boundary treatment for two-point boundary value problems

Sinc collocation method is proven to provide an exponential convergence rate in solving linear differential equations, even in the presence of singularities. But in order to treat the derivatives on boundaries, people often relied on the finite difference method, which would be expected to limit the accuracy. The present paper develops a Sinc collocation method with boundary treatment for two-point boundary value problems. Numerical results show that the method can directly and efficiently handle the boundary derivatives.     

A Legendre–Galerkin Chebyshev collocation method for the Burgers equation with a random perturbation on boundary condition

In the paper, we apply the generalized polynomial chaos expansion and spectral methods to the Burgers equation with a random perturbation on its left boundary condition. Firstly, the stochastic Galerkin method combined with the Legendre–Galerkin Chebyshev collocation scheme is adopted, which means that the original equation is transformed to the deterministic nonlinear equations by the stochastic Galerkin method and the Legendre–Galerkin Chebyshev collocation scheme is used to deal with the resulting nonlinear equations. Secondly, the stochastic Legendre–Galerkin Chebyshev collocation scheme is developed for solving the stochastic Burgers equation; that is, the stochastic Legendre–Galerkin method is used to discrete the random variable meanwhile the nonlinear term is interpolated through the Chebyshev–Gauss points. Then a set of deterministic linear equations can be obtained, which is in contrast to the other existing methods for the stochastic Burgers equation. The mean square convergence of the former method is analyzed. Numerical experiments are performed to show the effectiveness of our two methods. Both methods provide alternative approaches to deal with the stochastic differential equations with nonlinear terms.     

Inverse determination of thermal conductivity using semi-discretization method

In this work a semi-discretization method is presented for the inverse determination of spatially- and temperature-dependent thermal conductivity in a one-dimensional heat conduction domain without internal temperature measurements. The temperature distribution is approximated as a polynomial function of position using boundary data. The derivatives of temperature in the differential heat conduction equation are taken derivative of the approximated temperature function, and the derivative of thermal conductivity is obtained by finite difference technique. The heat conduction equation is then converted into a system of discretized linear equations. The unknown thermal conductivity is estimated by directly solving the linear equations. The numerical procedures do not require prior information of functional form of thermal conductivity. The close agreement between estimated results and exact solutions of the illustrated examples shows the applicability of the proposed method in estimating spatially- and temperature-dependent thermal conductivity in inverse heat conduction problem.     

Numerical solution of multi-order fractional differential equations with multiple delays via spectral collocation methods

This paper discusses a general framework for the numerical solution of multi-order fractional delay differential equations (FDDEs) in noncanonical forms with irrational/rational multiple delays by the use of a spectral collocation method. In contrast to the current numerical methods for solving fractional differential equations, the proposed framework can solve multi-order FDDEs in a noncanonical form with incommensurate orders. The framework can also solve multi-order FDDEs with irrational multiple delays. Next, the framework is enhanced by the fractional Chebyshev collocation method in which a Chebyshev operation matrix is constructed for the fractional differentiation. Spectral convergence and small computational time are two other advantages of the proposed framework enhanced by the fractional Chebyshev collocation method. In addition, the convergence, error estimates, and numerical stability of the proposed framework for solving FDDEs are studied. The advantages and computational implications of the proposed framework are discussed and verified in several numerical examples.     

The generalized Dirichlet–Neumann map for linear elliptic PDEs and its numerical implementation

A new approach for analyzing boundary value problems for linear and for integrable nonlinear PDEs was introduced in Fokas [A unified transform method for solving linear and certain nonlinear PDEs, Proc. Roy. Soc. London Ser. A 53 (1997) 1411–1443]. For linear elliptic PDEs, an important aspect of this approach is the characterization of a generalized Dirichlet to Neumann map: given the derivative of the solution along a direction of an arbitrary angle to the boundary, the derivative of the solution perpendicularly to this direction is computed without solving on the interior of the domain. This is based on the analysis of the so-called global relation, an equation which couples known and unknown components of the derivative on the boundary and which is valid for all values of a complex parameter k. A collocation-type numerical method for solving the global relation for the Laplace equation in an arbitrary bounded convex polygon was introduced in Fulton et al. [An analytical method for linear elliptic PDEs and its numerical implementation, J. Comput. Appl. Math. 167 (2004) 465–483]. Here, by choosing a different set of the “collocation points” (values for k), we present a significant improvement of the results in Fulton et al. [An analytical method for linear elliptic PDEs and its numerical implementation, J. Comput. Appl. Math. 167 (2004) 465–483]. The new collocation points lead to well-conditioned collocation methods. Their combination with sine basis functions leads to a collocation matrix whose diagonal blocks are point diagonal matrices yielding efficient implementation of iterative methods; numerical experimentation suggests quadratic convergence. The choice of Chebyshev basis functions leads to higher order convergence, which for regular polygons appear to be exponential.     

Solution of a laminar boundary layer flow via a numerical method

In this paper, the numerical solution of the Blasius problem is obtained using the collocation method based on rational Chebyshev functions. The Blasius equation is a nonlinear ordinary differential equation which arises in the boundary layer flow. The method reduces solving the equation to solving a system of nonlinear algebraic equations. The results presented here demonstrate reliability and efficiency of the method.     

A new Euler matrix method for solving systems of linear Volterra integral equations with variable coefficients

This article develops an efficient solver based on collocation points for solving numerically a system of linear Volterra integral equations (VIEs) with variable coefficients. By using the Euler polynomials and the collocation points, this method transforms the system of linear VIEs into the matrix equation. The matrix equation corresponds to a system of linear equations with the unknown Euler coefficients. A small number of Euler polynomials is needed to obtain a satisfactory result. Numerical results with comparisons are given to confirm the reliability of the proposed method for solving VIEs with variable coefficients.