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     

Solving boundary value problems,integral, and integro-differential equations using Gegenbauer integration matrices

We introduce a hybrid Gegenbauer (ultraspherical) integration method (HGIM) for solving boundary value problems (BVPs), integral and integro-differential equations. The proposed approach recasts the original problems into their integral formulations, which are then discretized into linear systems of algebraic equations using Gegenbauer integration matrices (GIMs). The resulting linear systems are well-conditioned and can be easily solved using standard linear system solvers. A study on the error bounds of the proposed method is presented, and the spectral convergence is proven for two-point BVPs (TPBVPs). Comparisons with other competitive methods in the recent literature are included. The proposed method results in an efficient algorithm, and spectral accuracy is verified using eight test examples addressing the aforementioned classes of problems. The proposed method can be applied on a broad range of mathematical problems while producing highly accurate results. The developed numerical scheme provides a viable alternative to other solution methods when high-order approximations are required using only a relatively small number of solution nodes.     

Computation of the canonical polynomials and applications to some optimal control problems

The Tau method is a numerical technique that consists in constructing polynomial approximate solutions for ordinary differential equations. This method has two approaches: operational and recursive. The former converts the differential problem to a matrix problem and produces approximations in terms of a prescribed orthogonal polynomials basis. In the recursive approach, we construct approximate solutions in terms of a special set of polynomials {Q _k (t); k?=?0, 1, 2...} called canonical polynomials basis. In some cases, the Q _k ??s can be obtained explicitly through a recursive formula. But no analogous formulae are reported in the literature for the general cases. In this paper, utilizing the operational Tau method, we develop an algorithm that allows to generate those canonical polynomials iteratively and explicitly. In addition, we demonstrate the capability of the operational Tau method in treating quadratic optimal control problems governed by ordinary differential equations.     

Generalized and mixed type Gegenbauer polynomials

In this paper, a new generalized form of the Gegenbauer polynomials is introduced by using the integral representation method. Further, the Hermite–Gegenbauer and the Laguerre–Gegenbauer polynomials are introduced by using the operational identities associated with the generalized Hermite and Laguerre polynomials of two variables.     

Computational method based on Bernstein operational matrices for nonlinear Volterra-Fredholm-Hammerstein integral equations

In this paper, we present a method to solve nonlinear Volterra-Fredholm-Hammerstein integral equations in terms of Bernstein polynomials. Properties of these polynomials and operational matrix of integration together with the product operational matrix are first presented. These properties are then utilized to transform the integral equation to a matrix equation which corresponds to a system of nonlinear algebraic equations with unknown Bernstein coefficients. The method is computationally very simple and attractive and numerical examples illustrate the efficiency and accuracy of the method.     

Markov-Bernstein inequalities for generalized Gegenbauer weight

The Markov-Bernstein inequalities for generalized Gegenbauer weight are studied. A special basis of the vector space Pn of real polynomials in one variable of degree at most equal to n is proposed. It is produced by quasi-orthogonal polynomials with respect to this generalized Gegenbauer measure. Thanks to this basis the problem to find the Markov-Bernstein constant is separated in two eigenvalue problems. The first has a classical form and we are able to give lower and upper bounds of the Markov-Bernstein constant by using the Newton method and the classical qd algorithm applied to a sequence of orthogonal polynomials. The second is a generalized eigenvalue problem with a five diagonal matrix and a tridiagonal matrix. A lower bound is obtained by using the Newton method applied to the six term recurrence relation produced by the expansion of the characteristic determinant. The asymptotic behavior of an upper bound is studied. Finally, the asymptotic behavior of the Markov-Bernstein constant is O(n²) in both cases.     

Gegenbauer wavelet collocation method for the extended Fisher-Kolmogorov equation in two dimensions

Gegenbauer wavelets operational matrices play an important role in the numeric solution of differential equations. In this study, operational matrices of rth integration of Gegenbauer wavelets are derived and used to obtain an approximate solution of the nonlinear extended Fisher-Kolmogorov (EFK) equation in two-space dimension. Nonlinear EFK equation is converted into the linear partial differential equation by quasilinearization technique. Numerical examples have shown that present method is convergent even in the case of a small number of grid points. The results of the presented method are in a good agreement with the results in literature.     

Laguerre series direct method for variational problems

A direct method for solving variational problems via Laguerre series is presented. First, an operational matrix for the integration of Laguerre polynomials is introduced. The variational problems are reduced to the solution of algebraic equations. An illustrative example is given.     

The operational matrices of Bernstein polynomials for solving the parabolic equation subject to specification of the mass

Some physical problems in science and engineering are modelled by the parabolic partial differential equations with nonlocal boundary specifications. In this paper, a numerical method which employs the Bernstein polynomials basis is implemented to give the approximate solution of a parabolic partial differential equation with boundary integral conditions. The properties of Bernstein polynomials, and the operational matrices for integration, differentiation and the product are introduced and are utilized to reduce the solution of the given parabolic partial differential equation to the solution of algebraic equations. Illustrative examples are included to demonstrate the validity and applicability of the new technique.     

Harmonic polynomials, hyperspherical harmonics, and atomic spectra

The properties of monomials, homogeneous polynomials and harmonic polynomials in d-dimensional spaces are discussed. The properties are shown to lead to formulas for the canonical decomposition of homogeneous polynomials and formulas for harmonic projection. Many important properties of spherical harmonics, Gegenbauer polynomials and hyperspherical harmonics follow from these formulas. Harmonic projection also provides alternative ways of treating angular momentum and generalised angular momentum. Several powerful theorems for angular integration and hyperangular integration can be derived in this way. These purely mathematical considerations have important physical applications because hyperspherical harmonics are related to Coulomb Sturmians through the Fock projection, and because both Sturmians and generalised Sturmians have shown themselves to be extremely useful in the quantum theory of atoms and molecules.     

Solution of Volterra's population model via block‐pulse functions and Lagrange‐interpolating polynomials

A numerical method for solving Volterra's population model for population growth of a species in a closed system is proposed. Volterra's model is a nonlinear integro‐differential equation where the integral term represents the effects of toxin. The approach is based on hybrid function approximations. The properties of hybrid functions that consist of block‐pulse and Lagrange‐interpolating polynomials are presented. The associated operational matrices of integration and product are then utilized to reduce the solution of Volterra's model to the solution of a system of algebraic equations. The method is easy to implement and computationally very attractive. Applications are demonstrated through an illustrative example. Copyright © 2008 John Wiley & Sons, Ltd.     

A New Matrix Approach For Solving Second-Order Linear Matrix Partial Differential Equations

The basic aim of this article is to present a novel efficient matrix approach for solving the second-order linear matrix partial differential equations (MPDEs) under given initial conditions. For imposing the given initial conditions to the main MPDEs, the associated matrix integro-differential equations (MIDEs) with partial derivatives are obtained from direct integration with regard to the spatial variable x and time variable t. Hence, operational matrices of differentiation and integration together with the completeness of Bernoulli polynomials are used to reduce the obtained MIDEs to the corresponding algebraic Sylvester equations. Using two well-known subspace Krylov iterative methods (i.e., GMRES(10) and Bi-CGSTAB) we provide two algorithms for solving the mentioned Sylvester equations. A numerical example is provided to show the efficiency and accuracy of the presented approach.

     

Free vibration of non-uniform Euler–Bernoulli beam under various supporting conditions using Chebyshev wavelet collocation method

This paper proposes operational matrix of rth integration of Chebyshev wavelets. A general procedure of this matrix is given. Operational matrix of rth integration is taken as rth power of operational matrix of first integration in literature. But, this study removes this disadvantage of Chebyshev wavelets method. Free vibration problems of non-uniform Euler–Bernoulli beam under various supporting conditions are investigated by using Chebyshev Wavelet Collocation Method. The proposed method is based on the approximation by the truncated Chebyshev wavelet series. A homogeneous system of linear algebraic equations has been obtained by using the Chebyshev collocation points. The determinant of coefficients matrix is equated to the zero for nontrivial solution of homogeneous system of linear algebraic equations. Hence, we can obtain ith natural frequencies of the beam and the coefficients of the approximate solution of Chebyshev wavelet series that satisfied differential equation and boundary conditions. Mode shapes functions corresponding to the natural frequencies can be obtained by normalizing of approximate solutions. The computed results well fit with the analytical and numerical results as in the literature. These calculations demonstrate that the accuracy of the Chebyshev wavelet collocation method is quite good even for small number of grid points.     

A note on the polynomial solution of a class of dual integral equations arising in mixed boundary value problems of elasticity

Summary The present paper is concerned with finding an effective polynomial solution to a class of dual integral equations which arise in many mixed boundary value problems in the theory of elasticity. The dual integral equations are first transformed into a Fredholm integration equation of the second kind via an auxiliary function, which is next reduced to an infinite system of linear algebraic equations by representing the unknown auxiliary function in the form of an infinite series of Jacobi polynomials. The approximate solution of this infinite system of equations can be obtained by a suitable truncation. It is shown that the unknown function involving the dual integral equations can also be expressed in the form of an infinite series of Jacobi polynomials with the same expansion coefficients with no numerical integration involved. The main advantage of the present approach is that the solution of the dual integral equations thus obtained is numerically more stable than that obtained by reducing themdirectly into an infinite system of equations, insofar as the expansion coefficients are determined essentially by solving asecond kind integral equation.     

On the numerical solution of stochastic quadratic integral equations via operational matrix method

In this paper, stochastic operational matrix of integration based on delta functions is applied to obtain the numerical solution of linear and nonlinear stochastic quadratic integral equations (SQIEs) that appear in modelling of many real problems. An important advantage of this method is that it dose not need any integration to compute the constant coefficients. Also, this method can be utilized to solve both linear and nonlinear problems. By using stochastic operational matrix of integration together collocation points, solving linear and nonlinear SQIEs converts to solve a nonlinear system of algebraic equations, which can be solved by using Newton's numerical method. Moreover, the error analysis is established by using some theorems. Also, it is proved that the rate of convergence of the suggested method is O(h²). Finally, this method is applied to solve some illustrative examples including linear and nonlinear SQIEs. Numerical experiments confirm the good accuracy and efficiency of the proposed method.     

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.     

A fractional‐order Jacobi Tau method for a class of time‐fractional PDEs with variable coefficients

This paper presents a shifted fractional‐order Jacobi orthogonal function (SFJF) based on the definition of the classical Jacobi polynomial. A new fractional integral operational matrix of the SFJF is presented and derived. We propose the spectral Tau method, in conjunction with the operational matrices of the Riemann–Liouville fractional integral for SFJF and derivative for Jacobi polynomial, to solve a class of time‐fractional partial differential equations with variable coefficients. In this algorithm, the approximate solution is expanded by means of both SFJFs for temporal discretization and Jacobi polynomials for spatial discretization. The proposed tau scheme, both in temporal and spatial discretizations, successfully reduced such problem into a system of algebraic equations, which is far easier to be solved. Numerical results are provided to demonstrate the high accuracy and superiority of the proposed algorithm over existing ones. Copyright © 2015 John Wiley & Sons, Ltd.     

Chebyshev rational matrix approximation with a priori error bounds for linear and Riccati matrix equations

This paper deals with initial value problems for Lipschitz continuous coefficient matrix Riccati equations. Using Chebyshev polynomial matrix approximations the coefficients of the Riccati equation are approximated by matrix polynomials in a constructive way. Then using the Fröbenius method developed in [1], given an admissible error ϵ > 0 and the previously guaranteed existence domain, a rational matrix polynomial approximation is constructed so that the error is less than ϵ in all the existence domain. The approach is also considered for the construction of matrix polynomial approximations of nonhomogeneous linear differential systems avoiding the integration of the transition matrix of the associated homogeneous problem.     

Bi-axial Gegenbauer Functions of the Second Kind

Bi-axially symmetric monogenic generating functions on ^{p + q} have been used recently to define generalisations of Gegenbauer polynomials. These polynomials are orthogonal on the unit ball in ^p. Generalised Cauchy transforms of these polynomials are used to define corresponding bi-axial Gegenbauer functions of the second kind. It is demonstrated that these functions of the second kind satisfy second order differential equations related to those satisfied by the corresponding bi-axial Gegenbauer polynomials.