6 research outputs found

    On the connection coefficients and recurrence relations arising from expansions in series of modified generalized Laguerre polynomials: Applications on a semi-infinite domain

    No full text
    Herein, three important theorems were stated and proved. The first relates the modified generalized Laguerre expansion coefficients of the derivatives of a function in terms of its original expansion coefficients; and an explicit expression for the derivatives of modified generalized Laguerre polynomials of any degree and for any order as a linear combination of modified generalized Laguerre polynomials themselves is also deduced. The second theorem gives new modified generalized Laguerre coefficients of the moments of one single modified generalized Laguerre polynomials of any degree. Finally, the third theorem expresses explicitly the modified generalized Laguerre coefficients of the moments of a general-order derivative of an infinitely differentiable function in terms of its modified generalized Laguerre coefficients. Some spectral applications of these theorems for solving ordinary differential equations with varying coefficients and some specific applied differential problems, by reducing them to recurrence relations in their expansion coefficients of the solution are considered

    Modal spectral Tchebyshev Petrov–Galerkin stratagem for the time-fractional nonlinear Burgers’ equation

    Get PDF
    Herein, we construct an explicit modal numerical solver based on the spec-tral Petrov–Galerkin method via a specific combination of shifted Cheby-shev polynomial basis for handling the nonlinear time-fractional Burger-type partial differential equation in the Caputo sense. The process reduces the problem to a nonlinear system of algebraic equations. Solving this alge-braic equation system will yield the approximate solution’s unknown coef-ficients. Many relevant properties of Chebyshev polynomials are reported, some connection and linearization formulas are reported and proved, and all elements of the obtained matrices are evaluated neatly. Also, conver-gence and error analyses are established. Various illustrative examples demonstrate the applicability and accuracy of the proposed method and depict the absolute and estimated error figures. Besides, the current ap-proach’s high efficiency is proved by comparing it with other techniques in the literature

    New algorithms for solving third- and fifth-order two point boundary value problems based on nonsymmetric generalized Jacobi Petrov–Galerkin method

    No full text
    Two families of certain nonsymmetric generalized Jacobi polynomials with negative integer indexes are employed for solving third- and fifth-order two point boundary value problems governed by homogeneous and nonhomogeneous boundary conditions using a dual Petrov–Galerkin method. The idea behind our method is to use trial functions satisfying the underlying boundary conditions of the differential equations and the test functions satisfying the dual boundary conditions. The resulting linear systems from the application of our method are specially structured and they can be efficiently inverted. The use of generalized Jacobi polynomials simplify the theoretical and numerical analysis of the method and also leads to accurate and efficient numerical algorithms. The presented numerical results indicate that the proposed numerical algorithms are reliable and very efficient

    New ultraspherical wavelets collocation method for solving 2nth-order initial and boundary value problems

    Get PDF
    In this paper, a new spectral algorithm based on employing ultraspherical wavelets along with the spectral collocation method is developed. The proposed algorithm is utilized to solve linear and nonlinear even-order initial and boundary value problems. This algorithm is supported by studying the convergence analysis of the used ultraspherical wavelets expansion. The principle idea for obtaining the proposed spectral numerical solutions for the above-mentioned problems is actually based on using wavelets collocation method to reduce the linear or nonlinear differential equations with their initial or boundary conditions into systems of linear or nonlinear algebraic equations in the unknown expansion coefficients. Some specific important problems such as Lane–Emden and Burger’s type equations can be solved efficiently with the suggested algorithm. Some numerical examples are given for the sake of testing the efficiency and the applicability of the proposed algorithm
    corecore