scholarly journals New Formulae for the High-Order Derivatives of Some Jacobi Polynomials: An Application to Some High-Order Boundary Value Problems

2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
W. M. Abd-Elhameed
Keyword(s):  
Galerkin Method ◽  
Boundary Value Problems ◽  
Chebyshev Polynomials ◽  
Hypergeometric Functions ◽  
Jacobi Polynomials ◽  
Boundary Value ◽  
High Order ◽  
Sixth Order ◽  
Special Cases ◽  
Derivatives Of

This paper is concerned with deriving some new formulae expressing explicitly the high-order derivatives of Jacobi polynomials whose parameters difference is one or two of any degree and of any order in terms of their corresponding Jacobi polynomials. The derivatives formulae for Chebyshev polynomials of third and fourth kinds of any degree and of any order in terms of their corresponding Chebyshev polynomials are deduced as special cases. Some new reduction formulae for summing some terminating hypergeometric functions of unit argument are also deduced. As an application, and with the aid of the new introduced derivatives formulae, an algorithm for solving special sixth-order boundary value problems are implemented with the aid of applying Galerkin method. A numerical example is presented hoping to ascertain the validity and the applicability of the proposed algorithms.

scholarly journals Efficient Solutions of Multidimensional Sixth-Order Boundary Value Problems Using Symmetric Generalized Jacobi-Galerkin Method

2012 ◽  
Vol 2012 ◽  
pp. 1-19 ◽  
Author(s):  
E. H. Doha ◽  
W. M. Abd-Elhameed
Keyword(s):  
Galerkin Method ◽  
Boundary Value Problems ◽  
Jacobi Polynomials ◽  
Boundary Value ◽  
Efficient Solutions ◽  
Sixth Order ◽  
Condition Numbers ◽  
Basic Functions ◽  
The Galerkin Method ◽  
Fourth Order Elliptic Equations

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.

scholarly journals Some Algorithms for Solving Third-Order Boundary Value Problems Using Novel Operational Matrices of Generalized Jacobi Polynomials

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
W. M. Abd-Elhameed
Keyword(s):  
Boundary Value Problems ◽  
Jacobi Polynomials ◽  
Boundary Value ◽  
Operational Matrix ◽  
Operational Matrices ◽  
Algebraic Equations ◽  
Third Order ◽  
Generalized Jacobi Polynomials ◽  
Nonlinear Algebraic Equations ◽  
Derivatives Of

The main aim of this research article is to develop two new algorithms for handling linear and nonlinear third-order boundary value problems. For this purpose, a novel operational matrix of derivatives of certain nonsymmetric generalized Jacobi polynomials is established. The suggested algorithms are built on utilizing the Galerkin and collocation spectral methods. Moreover, the principle idea behind these algorithms is based on converting the boundary value problems governed by their boundary conditions into systems of linear or nonlinear algebraic equations which can be efficiently solved by suitable solvers. We support our algorithms by a careful investigation of the convergence analysis of the suggested nonsymmetric generalized Jacobi expansion. Some illustrative examples are given for the sake of indicating the high accuracy and efficiency of the two proposed algorithms.

scholarly journals Galerkin Method for Nonlinear Higher-Order Boundary Value Problems Based on Chebyshev Polynomials

2021 ◽  
Vol 2128 (1) ◽  
pp. 012035
Author(s):  
W. Abbas ◽  
Mohamed Fathy ◽  
M. Mostafa ◽  
A. M. A Hesham
Keyword(s):  
Galerkin Method ◽  
Boundary Value Problems ◽  
Chebyshev Polynomials ◽  
Nonlinear Boundary ◽  
Analytic Solution ◽  
Boundary Value ◽  
Higher Order ◽  
Nonlinear Boundary Value Problems ◽  
Algebraic Set ◽  
The Galerkin Method

Abstract In the current paper, we develop an algorithm to approximate the analytic solution for the nonlinear boundary value problems in higher-order based on the Galerkin method. Chebyshev polynomials are introduced as bases of the solution. Meanwhile, some theorems are deducted to simplify the nonlinear algebraic set resulted from applying the Galerkin method, while Newton’s method is used to solve the resulting nonlinear system. Numerous examples are presented to prove the usefulness and effectiveness of this algorithm in comparison with some other methods.

scholarly journals Sinc-Galerkin method for solving linear sixth-order boundary-value problems

2003 ◽  
Vol 73 (247) ◽  
pp. 1325-1344 ◽  
Author(s):  
Mohamed El-Gamel ◽  
John R. Cannon ◽  
Ahmed I. Zayed
Keyword(s):  
Galerkin Method ◽  
Boundary Value Problems ◽  
Boundary Value ◽  
Sixth Order

scholarly journals New Specific and General Linearization Formulas of Some Classes of Jacobi Polynomials

Mathematics ◽  
2020 ◽  
Vol 9 (1) ◽  
pp. 74
Author(s):  
Waleed Mohamed Abd-Elhameed ◽  
Afnan Ali
Keyword(s):  
Chebyshev Polynomials ◽  
Hypergeometric Functions ◽  
Jacobi Polynomials ◽  
Algebraic Computation ◽  
Ultraspherical Polynomials ◽  
Current Article ◽  
Linearization Coefficients

The main purpose of the current article is to develop new specific and general linearization formulas of some classes of Jacobi polynomials. The basic idea behind the derivation of these formulas is based on reducing the linearization coefficients which are represented in terms of the Kampé de Fériet function for some particular choices of the involved parameters. In some cases, the required reduction is performed with the aid of some standard reduction formulas for certain hypergeometric functions of unit argument, while, in other cases, the reduction cannot be done via standard formulas, so we resort to certain symbolic algebraic computation, and specifically the algorithms of Zeilberger, Petkovsek, and van Hoeij. Some new linearization formulas of ultraspherical polynomials and third-and fourth-kinds Chebyshev polynomials are established.

Non-polynomial splines approach to the solution of sixth-order boundary-value problems

2008 ◽  
Vol 195 (1) ◽  
pp. 270-284 ◽  
Author(s):  
Siraj-ul-Islam ◽  
Ikram A. Tirmizi ◽  
Fazal-i-Haq ◽  
M. Azam Khan
Keyword(s):  
Boundary Value Problems ◽  
Boundary Value ◽  
Sixth Order ◽  
Polynomial Splines
Sign in / Sign up

Export Citation Format

Share Document