Search

A new Legendre rational pseudospectral scheme is proposed and developed for solving numerically systems of linear and nonlinear multipantograph equations on a semi-infinite interval. A Legendre rational collocation method based on Legendre rational-Gauss quadrature points is utilized to reduce the solution of such systems to systems of linear and nonlinear algebraic equations. In addition, accurate approximations are achieved by selecting few Legendre rational-Gauss collocation points. The numerical results obtained by this method have been compared with various exact solutions in order to demonstrate the accuracy and efficiency of the proposed method. Indeed, for relatively limited nodes used, the absolute error in our numerical solutions is sufficiently small. [ABSTRACT FROM AUTHOR]

We solve three versions of nonlinear time-dependent Burgers-type equations. The Jacobi-Gauss-Lobatto points are used as collocation nodes for spatial derivatives. This approach has the advantage of obtaining the solution in terms of the Jacobi parameters α and β. In addition, the problem is reduced to the solution of the system of ordinary differential equations (SODEs) in time. This system may be solved by any standard numerical techniques. Numerical solutions obtained by this methodwhen compared with the exact solutions reveal that the obtained solutions produce high-accurate results. Numerical results show that the proposed method is of high accuracy and is efficient to solve the Burgers-type equation. Also the results demonstrate that the proposed method is a powerful algorithm to solve the nonlinear partial differential equations. [ABSTRACT FROM AUTHOR]

A new spectral algorithm based on shifted second kind Chebyshev wavelets operational matrices of derivatives is introduced and used for solving linear and nonlinear second-order two-point boundary value problems. The main idea for obtaining spectral numerical solutions for these equations is essentially developed by reducing the linear or nonlinear equations with their initial and/or boundary conditions to a system of linear or nonlinear algebraic equations in the unknown expansion coefficients. Convergence analysis and some efficient specific illustrative examples including singular and Bratu type equations are considered to demonstrate the validity and the applicability of the method. Numerical results obtained are compared favorably with the analytical known solutions. [ABSTRACT FROM AUTHOR]

This paper is concerned with introducing two wavelets collocation algorithms for solving linear and nonlinearmultipoint boundary value problems. The principal idea for obtaining spectral numerical solutions for such equations is employing third- and fourthkind Chebyshev wavelets along with the spectral collocation method to transform the differential equation with its boundary conditions to a system of linear or nonlinear algebraic equations in the unknown expansion coefficients which can be efficiently solved. Convergence analysis and some specific numerical examples are discussed to demonstrate the validity and applicability of the proposed algorithms. The obtained numerical results are comparing favorably with the analytical known solutions. [ABSTRACT FROM AUTHOR]

This paper presents some efficient spectral algorithms for solving linear sixth-order two-point boundary value problems in one dimension based on the application of the Galerkin method. The proposed algorithms are extended to solve the two-dimensional sixth-order differential equations. A family of symmetric generalized Jacobi polynomials is introduced and used as basic functions. The algorithms lead to linear systems with specially structured matrices that can be efficiently inverted. The various matrix systems resulting from the proposed algorithms are carefully investigated, especially their condition numbers and their complexities. These algorithms are extensions to some of the algorithms proposed by Doha and Abd-Elhameed (2002) and Doha and Bhrawy (2008) for second- and fourth-order elliptic equations, respectively. Three numerical results are presented to demonstrate the efficiency and the applicability of the proposed algorithms. [ABSTRACT FROM AUTHOR]

A Jacobi dual-Petrov-Galerkin (JDPG) method is introduced and used for solving fully integrated reformulations of third- and fifth-order ordinary differential equations (ODEs) with constant coefficients. The reformulated equation for the Jth order ODE involves n-fold indefinite integrals for n = 1,…, J. Extension of the JDPG for ODEs with polynomial coefficients is treated using the Jacobi-Gauss-Lobatto quadrature. Numerical results with comparisons are given to confirm the reliability of the proposed method for some constant and polynomial coefficients ODEs. [ABSTRACT FROM AUTHOR]