Newfangled Linearization Formula of Certain Nonsymmetric Jacobi Polynomials: Numerical Treatment of Nonlinear Fisher’s Equation

Abd-Elhameed, W. M.; Ali, Afnan; Youssri, Y. H.

doi:https://doi.org/10.1155/2023/6833404

Journal of Function Spaces

On this page

Abstract Introduction Data Availability Conflicts of Interest References Copyright Related Articles

Special Issue

Numerical Methods for Differential and Integral Equations

View this Special Issue

Research Article | Open Access

Volume 2023 | Article ID 6833404 | https://doi.org/10.1155/2023/6833404

Newfangled Linearization Formula of Certain Nonsymmetric Jacobi Polynomials: Numerical Treatment of Nonlinear Fisher’s Equation

W. M. Abd-Elhameed,¹Afnan Ali,²and Y. H. Youssri^1,3

Academic Editor: Richard I. Avery

Received18 Jan 2022

Revised09 Apr 2022

Accepted13 Apr 2022

Published21 Aug 2023

Abstract

This article is devoted to deriving a new linearization formula of a class for Jacobi polynomials that generalizes the third-kind Chebyshev polynomials class. In fact, this new linearization formula generalizes some existing ones in the literature. The derivation of this formula is based on employing a new moment formula of this class of polynomials and after that using suitable symbolic computation to reduce the resulting linearization coefficients into simplified forms that do not contain any hypergeometric functions or sums. The new formula is employed along with some other formulas and with the utilization of the spectral tau method to obtain numerical solutions to the nonlinear Fisher equation. The presented method is used to convert the equation governed by its underlying conditions into a nonlinear system of equations. The solution of the resulting system can be obtained through any suitable standard numerical scheme. To demonstrate the efficiency and usefulness of the proposed algorithm, some examples are shown, including comparisons with some existing techniques in the literature.

1. Introduction

The study and the utilization of special functions in general and of orthogonal polynomials, in particular, is a very old and important branch of mathematics. Orthogonal polynomials are fruitfully used for obtaining numerical solutions to all types of differential equations. Among the important polynomials are the classical Jacobi polynomials. These polynomials have important parts in different disciplines. Some applications of Jacobi polynomials in some areas of science and engineering such as integral equations and food engineering can be found in [1–4]. In fact, the class of Jacobi polynomials involves six well-known polynomials. They are the Legendre, Gegenbauer, and the four kinds of Chebyshev polynomials. The existence of four different kinds of Chebyshev polynomials leads to a wide range of outcomes in a variety of fields, such as approximation, interpolation, series expansions, and quadrature and integral equations (see, for example, [5, 6]). These kinds of Chebyshev polynomials have been thoroughly investigated theoretically and numerically. For example, Oloniiju et al. in [7] used the first-kind Chebyshev polynomials to find a pseudospectral solution to a certain multidimensional fractional problem. The authors in [8] established new expressions of the high-order derivatives of Chebyshev polynomials of the third and fourth kinds. In addition, they utilized these formulas to treat numerically specific types of differential equations.

Deriving formulas that are concerned with different special functions and orthogonal polynomials is of interest. In fact, there are many formulas that serve in the numerical treatment of different types of differential equations. Obtaining expressions for the high-order derivatives of orthogonal polynomials in terms of their original ones is very useful in treating numerically the differential equations of different types if the spectral methods are applied. For example, the authors in [9] established new expressions for the high-order derivatives of the fifth-kind Chebyshev polynomials in terms of their original polynomials. These expressions include terminating hypergeometric functions of the type . Moreover, these formulas are employed to treat numerically the convection-diffusion equation. Also, among the important formulas of orthogonal polynomials are the linearization formulas of these polynomials. Because of their importance, linearization problems have attracted the attention of many authors. For example, some articles were devoted to solving the linearization problems of Jacobi polynomials and their special classes. There are different approaches in order to developing these linearization formulas. One can be referred for example to Rahman [10], Chaggara and Koepf [11]. As an application to the linearization formulas, recently, Abd-Elhameed in [12] developed linearization formulas for specific classes of Jacobi polynomials. Furthermore, a certain linearization formula along with the tau spectral method was employed to handle a type of nonlinear Riccati differential equation.

Spectral methods are a class of important methods that treat numerically different types of differential equations. The numerical solution is expressed as a suitable combination of specific polynomials, which is the basic assumption underpinning the implementation of spectral methods. Because of its importance in the area of numerical solutions of differential and integral equations, many types of spectral methods have received a lot of attention. For further information on the numerous applications of spectral approaches in various areas, see [13–15]. Spectral approaches include the Galerkin, tau, and collocation methods. The Galerkin method can be fruitfully utilized for treating several forms of differential equations (see, for instance, [16–20]). Unlike the Galerkin technique, the tau method is more flexible in its application because it does not require selecting basis functions that meet the underlying initial/boundary conditions (see, for example, [21–24]). The collocation method is the most popular method. It may be used to solve any differential equation. The authors in [25–27] used the collocation method to obtain numerical solutions to many types of differential equations.

Fisher’s equation arises in various applications like tissue engineering, chemical reactions, and neurophysiology (see [28, 29]). This equation has been treated by both analytic and numerical techniques. For example, Wazwaz and Gorguis in [30] studied analytically the nonlinear Fisher equation by using the Adomian decomposition method. Chandraker et al. in [31] developed implicit numerical techniques for treating Fisher’s equation. From a numerical point of view, Haar wavelet’s method is applied for solving Fisher’s equation in [32]. For some other articles that deal with Fisher’s equation and its generalizations and modifications, one can consult [33–36].

Recently, Abd-Elhameed and Alkenedri in [37] investigated two generalized classes of the third- and fourth-kind Chebyshev polynomials. They developed new high-order derivative expressions of these polynomials. In addition and based on these formulas, they obtained spectral solutions to the high-even-order linear and nonlinear boundary value problems. In this article, we are interested in developing some theoretical results concerned with certain generalized third-kind Chebyshev polynomials and after that employing such polynomials to treat numerically the nonlinear Fisher equation.

The five main goals of the current paper can be listed as follows: (i)Derivation of a new moment formula of the generalized third-kind Jacobi polynomials(ii)Establishing a new linearization formula of the generalized third-kind Jacobi polynomials(iii)Deducing some existing moment and linearization formulas in the literature as special cases of our new moment and linearization formulas(iv)Employing the derived linearization formula in conjunction with the high-order derivative expression of the generalized polynomials to numerically solve the nonlinear Fisher equation using the spectral tau approach(v)Testing the efficiency and applicability of our proposed algorithm by presenting some examples accompanied by comparisons with some other methods in the literature

The rest of the paper is as follows. In Section 2, some interesting properties concerned with the classical Jacobi polynomials and their shifted ones are presented. Section 3 is devoted to developing new moment formula of the generalized third-kind Chebyshev polynomials. Some specific moment formulas are also deduced by reducing the corresponding moment coefficients via the utilization of Zeilberger’s algorithm. Section 4 establishes the main formula in this paper in which we give with proof a new linearization formula of the generalized third-kind Chebyshev polynomials. Section 5 concentrates on proposing a numerical algorithm for solving spectrally the nonlinear Fisher equation. In Section 6, some numerical examples accompanied by comparisons with some other techniques in the literature are displayed. We end the paper with some concluding remarks in Section 7.

2. Some Interesting Properties and Formulas of Jacobi Polynomials

The standard Jacobi polynomial of degree can be defined in hypergeometric form as (see, for example, Andrews et al. [38])

The Jacobi polynomials can be normalized (see [12]); that is, we can define such that and therefore,

The orthogonality property of on is where

One comments here that the following six special classes of polynomials can be extracted from with suitable choices of and . We have where , and are the ultraspherical, first-, second-, third-, and fourth kinds of Chebyshev polynomials and Legendre polynomials, respectively.

Also, the following relation is noted:

Now, consider the special class of Jacobi polynomials . It is clear that this class reduces to the class of third-kind Chebyshev polynomials for the case corresponding to .

Now, define the shifted Jacobi polynomials class on as

The orthogonality relation of on is given by where is the well-known Kronecker delta function, and is given by

The classical Jacobi polynomials and their special ones are investigated in a variety of books (see, for example, Andrews et al. [38] and Mason and Handscomb [6]).

The following three lemmas are of fundamental importance to derive our proposed results in the upcoming sections.

Lemma 1 (see [37]). Letbe a nonnegative integer. The polynomialshave the following power form representation:where where denotes the well-known floor function.

Lemma 2 (see [37]). For every nonnegative integer, the following inversion formula for the polynomialsholds:where

Lemma 3 (see [37]). Thederivative of the shifted Jacobi polynomialis linked by their original ones by the relationwhere the coefficients are given by

3. New Moment Formula of the Jacobi Polynomials

This section is devoted to the implementation of a new moment formula of the Jacobi polynomials . The derivation of this formula is based on the power-form representation of these polynomials along with their inversion formula.

Theorem 4. Letanbe positive integers. One haswhere

Proof. The analytic formula of enables one to write In virtue of (13) and after doing some lengthy manipulations, we can write where and are as given in (18) and (19). This ends the proof.

Corollary 5. The moment formula of Chebyshev polynomials of the third kind is given explicitly as

Proof. Setting in (17) gives the following formula: where Regarding the sum in (24), the utilization of Zeilberger’s algorithm (see [39]) enables one to obtain the following recurrence relation for : which can be handled quickly to provide In addition, it is easy to demonstrate the following formula: Now, the two sums in (27) and (28) along with formula (23) lead to the following simplified moment formula:

Remark 6. It is worth mentioning here that the moment formula (22) is similar to that obtained in Ref. [40].

Corollary 7. For the case corresponds to, the following moment formula holds for all nonnegative integersand:

Proof. Setting in the moment formula (17) gives the following formula: where Regarding the two summations that appear in equations (32) and (33), set and utilize Zeilberger’s algorithm ([39]) to show that the following two recurrence relations are, respectively, satisfied by and : with the following initial condition: with the following initial condition: The above two recurrence relations can be directly solved to give and consequently, the linearization coefficients and reduce to the following expressions: and therefore, the linearization formula (30) can be obtained.

4. Linearization Formula of

In this section and based on the moment formula that was derived in the previous section, we present and prove a new linearization formula of the generalized third-kind Chebyshev polynomials .

Theorem 8. For all nonnegative integersand, the following linearization formula is valid:where

Proof. Starting with the power form representation of yields Based on the moment formula in (17), the last relation turns into After some algebraic computations, equation (43) can be rewritten in the following form: where and After expanding and rearranging the terms in (45) and (46), they can be written in the following expressions: Now and in order to obtain the linearization coefficients of the linearization formula of in a reduced formula that is free of any sums, we employ symbolic computation. For such purpose, set It can be shown by symbolic computation and, in particular, Zeilberger’s algorithm that the following two recurrence relations, each of order one, are satisfied, respectively, by and : with the following initial value: with the following initial value: The above two recurrence relations can be directly solved to give Therefore, the following linearization formula is obtained: here the linearization coefficients and are, respectively, given by (52) and (53). Formula (54) can be written alternatively as with the following linearization coefficients : This completes the proof of Theorem 8.

In the following two corollaries, we give two specific linearization formulas of the linearization formula (40).

Corollary 9. Settingin (40) leads to the following linearization formula:

Remark 10. The linearization formula (57) was previously obtained in [41], but here, it is derived in an alternative approach.

Corollary 11. Settingin (40) leads to the following linearization formula:with

Remark 12. The linearization formula (57) was previously obtained in [42].

Remark 13. The basic linearization formula (40) in Theorem8holds for the shifted Jacobi polynomials, only ifis replaced by. The following theorem exhibits this formula in an appropriate form.

Theorem 14. For all nonnegative integersand, the following linearization formula is valid:with the following linearization coefficients :

5. The Proposed Algorithm for the Numerical Treatment of the Nonlinear Fisher Equation

In this section, we are interested in obtaining a numerical algorithm for solving the nonlinear Fisher equation. More precisely, we will employ the established linearization formula along with the derivatives formula of the shifted polynomials to obtain a numerical solution based on applying the tau method. We denote our algorithm by the nonsymmetric Jacobi Tau Method (NJTM).

Now, consider the Fisher differential equation [32]: governed by the following initial and boundary conditions: where is the positive coefficient of kinematic viscosity and and are prescribed known continuous functions. Now, for solving (62) governed by the conditions (63) and (64), we utilize the spectral tau method.

Now, assume that and let it have the following double series expansion:

Furthermore, assume an approximate solution to (62) in the form

In virtue of formula (15), it can be shown that and can be represented as follows:

Based on the linearization formula (60), the nonlinear term can be written in the following form:

Now, to apply the tau method to (62) governed by the conditions (63) and (64), we first compute the residual of the differential equation (62). It is given explicitly as

On the other hand, the residual of (63) () can be written:

Moreover, the two residuals of the boundary conditions (64) ( and ) are given by

Now, the application of the tau method leads to the following equations:

The substitution by the four residuals in equations (69), (70), (71), and (72) yields, respectively, the following equations: where and .

The proposed tau approach produces the nonlinear system of equations (74)-(77) with the unknowns of dimension . It is necessary to solve this nonlinear system to obtain the desired approximate solution. This can be accomplished by using a suitable numerical method, such as Newton’s iterative technique.

Remark 15. It is very imperative to communique here that if the termis replaced by, whereis any positive integer, then the repeated use of linearization formula (59) will generate a system that is similar to ((73))-((76)). This means our algorithm can be extended to solve this generalized Fisher problem. The details are omitted.

Remark 16. To summarize our proposed numerical algorithm, in Algorithm 1, we list in order the steps required to obtain the desired numerical solution.

Input Given and .
Step 1. Evaluate the derivatives coefficients from relation (16), and the linearization.
coefficients from relation (61).
Step 2. Assume an approximate solution in the form: .
Step 3. Compute the residuals: via Eqs. (69-72z).
Step 4. Apply the tau method to obtain the system in ((74)-(77)).
Step 5. Employ Newtons’ iterative method -FindRoot- to obtain the coefficients .
Step 6. Find the double expansion: .
Output the approximate solution: .

6. Numerical Experiments and Comparisons

Example 1. Consider the following nonlinear Fisher equation [32]: along with and the boundary conditions: with the exact solution

We apply the NJTM for the case corresponding to . In Figure 1, we depict the approximate solution of Example 1 at different values of . In Figure 2, we depict the absolute error of Example 1 at different values of . In Figure 3, we depict the absolute error of Example 1 at different values of . In Table 1, we report the maximum absolute error (MAE) for different values of and .

Example 2. Consider the following nonlinear Fisher equation [32]: along with and the boundary conditions: with the exact solution

We apply NJTM for the case corresponding to . Figure 4 displays the approximate solutions of Example 2 at different values of . Additionally, Figure 5 displays the absolute error of Example 2 at different values of . Figure 6 displays the absolute error of Example 2 at different values of . Finally, Table 2 reports the MAE for different values of and .

Example 3. Consider the following nonlinear Fisher equation ([32, 43]):along with and the boundary conditions: with the exact solution

We apply NJTM for the case corresponding to . In Figure 7, we depict the solution of Example 3 at different values of . Figure 8 shows the absolute error of Example 3 at different values of , while Figure 9 shows the absolute error of Example 3 at different values of . The MAE for different values of and is reported in Table 3.

7. Concluding Remarks

In this article, a novel linearization formula of a class of Jacobi polynomials that generalizes the third-kind Chebyshev polynomials was established. The establishment of this linearization formula depends on using a new moment formula of these polynomials together with the employment of suitable symbolic computation. The linearization formula and the high-order derivative formula of a certain class of Jacobi polynomials are utilized along with the spectral tau method to develop a new numerical algorithm for treating the nonlinear Fisher equation. We do believe that our theoretical results and the proposed numerical results are new. Furthermore, other types of nonlinear differential equations may be treated using similar techniques. Some illustrative examples were presented accompanied by some comparisons to validate the accuracy and efficiency and the proposed tau algorithm.

Data Availability

No data is associated with this research.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

References

Y. Yang, J. Wang, S. Zhang, and E. Tohidi, “Convergence analysis of space-time Jacobi spectral collocation method for solving time-fractional Schrodinger equations,” Applied Mathematics and Computation, vol. 387, article 124489, 2020.
View at: Publisher Site | Google Scholar
G. Deng, Y. Yang, and E. Tohidi, “High accurate pseudo-spectral Galerkin scheme for pantograph type Volterra integro-differential equations with singular kernels,” Applied Mathematics and Computation, vol. 396, article 125866, 2021.
View at: Publisher Site | Google Scholar
Y. Yang, G. Rzadkowski, A. Pasban, E. Tohidi, and S. Shateyi, “A high accurate scheme for numerical simulation of two-dimensional mass transfer processes in food engineering,” Alexandria Engineering Journal, vol. 60, no. 2, pp. 2629–2639, 2021.
View at: Publisher Site | Google Scholar
B. Zogheib, E. Tohidi, H. M. Baskonus, and C. Cattani, “Method of lines for multi-dimensional coupled viscous Burgers’ equations via nodal Jacobi spectral collocation method,” Physica Scripta, vol. 96, no. 12, article 124011, 2021.
View at: Publisher Site | Google Scholar
T. J. Rivlin, Chebyshev Polynomials, Courier Dover Publications, 2020.
J. C. Mason and D. C. Handscomb, Chebyshev Polynomials, Chapman and Hall, New York, NY, CRC, Boca Raton, 2002.
S. D. Oloniiju, S. P. Goqo, and P. Sibanda, “A Chebyshev pseudo-spectral method for the multi-dimensional fractional Rayleigh problem for a generalized Maxwell fluid with Robin boundary conditions,” Applied Numerical Mathematics, vol. 152, pp. 253–266, 2020.
View at: Publisher Site | Google Scholar
E. H. Doha, W. M. Abd-Elhameed, and M. A. Bassuony, “On the coefficients of differentiated expansions and derivatives of Chebyshev polynomials of the third and fourth kinds,” Acta Mathematica Scientia, vol. 35, no. 2, pp. 326–338, 2015.
View at: Publisher Site | Google Scholar
W. M. Abd-Elhameed and Y. H. Youssri, “New formulas of the high-order derivatives of fifth-kind Chebyshev polynomials: spectral solution of the convection–diffusion equation,” Numerical Methods for Partial Differential Equations, 2021.
View at: Publisher Site | Google Scholar
M. Rahman, “A non-negative representation of the linearization coefficients of the product of Jacobi polynomials,” Canadian Journal of Mathematics, vol. 33, no. 4, pp. 915–928, 1981.
View at: Publisher Site | Google Scholar
H. Chaggara and W. Koepf, “On linearization coefficients of Jacobi polynomials,” Applied Mathematics Letters, vol. 23, no. 5, pp. 609–614, 2010.
View at: Publisher Site | Google Scholar
W. M. Abd-Elhameed, “New formulae between Jacobi polynomials and some fractional Jacobi functions generalizing some connection formulae,” Analysis and Mathematical Physics, vol. 9, no. 1, pp. 73–98, 2019.
View at: Publisher Site | Google Scholar
C. Canuto, M. Y. Hussaini, A. Quarteroni, and T. A. Zang, Spectral Methods in Fluid Dynamics, Springer-Verlag, 1988.
View at: Publisher Site
B. Shizgal, Spectral Methods in Chemistry and Physics, Springer, 2015.
J. Hesthaven, S. Gottlieb, and D. Gottlieb, Spectral Methods for Time-Dependent Problems, volume 21, Cambridge University Press, 2007.
View at: Publisher Site
S. Sabermahani and Y. Ordokhani, “Fibonacci wavelets and Galerkin method to investigate fractional optimal control problems with bibliometric analysis,” Journal of Vibration and Control, vol. 27, no. 15-16, pp. 1778–1792, 2021.
View at: Publisher Site | Google Scholar
K. Sadri and H. Aminikhah, “Chebyshev polynomials of sixth kind for solving nonlinear fractional PDEs with proportional delay and its convergence analysis,” Journal of Function Spaces, vol. 2022, Article ID 9512048, 20 pages, 2022.
View at: Publisher Site | Google Scholar
M. A. Ramadan, T. Radwan, M. A. Nassar, and M. A. Abd El Salam, “A comparison study of numerical techniques for solving ordinary differential equations defined on a semi-infinite domain using rational Chebyshev functions,” Journal of Function Spaces, vol. 2021, Article ID 1111417, 12 pages, 2021.
View at: Publisher Site | Google Scholar
Y. Yang, E. Tohidi, X. Ma, and S. Kang, “Rigorous convergence analysis of Jacobi spectral Galerkin methods for Volterra integral equations with noncompact kernels,” Journal of Computational and Applied Mathematics, vol. 366, article 112403, 2020.
View at: Publisher Site | Google Scholar
Y. Yang, G. Deng, and E. Tohidi, “High accurate convergent spectral Galerkin methods for nonlinear weakly singular Volterra integro-differential equations,” Computational and Applied Mathematics, vol. 40, no. 4, pp. 1–32, 2021.
View at: Publisher Site | Google Scholar
A. Faghih and P. Mokhtary, “An efficient formulation of Chebyshev tau method for constant coefficients systems of multi-order FDEs,” Journal of Scientific Computing, vol. 82, no. 1, pp. 1–25, 2020.
View at: Publisher Site | Google Scholar
F. Mohammadi and C. Cattani, “A generalized fractional-order Legendre wavelet tau method for solving fractional differential equations,” Journal of Computational and Applied Mathematics, vol. 339, pp. 306–316, 2018.
View at: Publisher Site | Google Scholar
W. M. Abd-Elhameed and Y. H. Youssri, “Spectral tau algorithm for certain coupled system of fractional differential equations via generalized Fibonacci polynomial sequence,” Iranian Journal of Science and Technology, Transactions A: Science, vol. 43, no. 2, pp. 543–554, 2019.
View at: Publisher Site | Google Scholar
A. G. Atta, G. M. Moatimid, and Y. H. Youssri, “Generalized Fibonacci operational tau algorithm for fractional Bagley-Torvik equation,” Progress in Fractional Differentiation and Applications, vol. 6, no. 3, pp. 215–224, 2020.
View at: Publisher Site | Google Scholar
F. Costabile and A. Napoli, “Collocation for high order differential equations with two-points Hermite boundary conditions,” Applied Numerical Mathematics, vol. 87, pp. 157–167, 2015.
View at: Publisher Site | Google Scholar
F. Costabile and A. Napoli, “A method for high-order multipoint boundary value problems with Birkhoff-type conditions,” International Journal of Computer Mathematics, vol. 92, no. 1, pp. 192–200, 2015.
View at: Publisher Site | Google Scholar
V. Saw and S. Kumar, “The Chebyshev collocation method for a class of time fractional convection- diffusion equation with variable coefficients,” Mathematicsl Methods in the Applied Sciences, vol. 44, no. 8, pp. 6666–6678, 2021.
View at: Publisher Site | Google Scholar
J. A. Sherratt, “On the transition from initial data to travelling waves in the Fisher-KPP equation,” Dynamics and Stability of Systems, vol. 13, no. 2, pp. 167–174, 1998.
View at: Publisher Site | Google Scholar
J. Canosa, “On a nonlinear diffusion equation describing population growth,” IBM Journal of Research and Development, vol. 17, no. 4, pp. 307–313, 1973.
View at: Publisher Site | Google Scholar
A. M. Wazwaz and A. Gorguis, “An analytic study of Fisher's equation by using Adomian decomposition method,” Applied Mathematics and Computation, vol. 154, no. 3, pp. 609–620, 2004.
View at: Publisher Site | Google Scholar
V. Chandraker, A. Awasthi, and S. Jayaraj, “Implicit numerical techniques for Fisher equation,” Journal of Information and Optimization Sciences, vol. 39, no. 1, pp. 1–13, 2018.
View at: Publisher Site | Google Scholar
G. Hariharan, K. Kannan, and K. R. Sharma, “Haar wavelet method for solving Fisher’s equation,” Applied Mathematics and Computation, vol. 211, no. 2, pp. 284–292, 2009.
View at: Publisher Site | Google Scholar
K. Al-Khaled, “Numerical study of Fisher's reaction-diffusion equation by the Sinc collocation method,” Journal of Computational and Applied Mathematics, vol. 137, no. 2, pp. 245–255, 2001.
View at: Publisher Site | Google Scholar
M. M. Khader and M. Adel, “Numerical and theoretical treatment based on the compact finite difference and spectral collocation algorithms of the space fractional-order Fisher’s equation,” International Journal of Modern Physics C, vol. 31, no. 9, article 2050122, 2020.
View at: Publisher Site | Google Scholar
M. Bastani and D. K. Salkuyeh, “A highly accurate method to solve Fisher’s equation,” Pramana, vol. 78, no. 3, pp. 335–346, 2012.
View at: Publisher Site | Google Scholar
D. Olmos and B. D. Shizgal, “A pseudospectral method of solution of Fisher's equation,” Journal of Computational and Applied Mathematics, vol. 193, no. 1, pp. 219–242, 2006.
View at: Publisher Site | Google Scholar
W. M. Abd-Elhameed and A. M. Alkenedri, “Spectral solutions of linear and nonlinear BVPs using certain Jacobi polynomials generalizing third- and fourth-kinds of Chebyshev polynomials,” Computer Modeling in Engineering & Sciences, vol. 126, no. 3, pp. 955–989, 2021.
View at: Publisher Site | Google Scholar
G. E. Andrews, R. Askey, and R. Roy, Special Functions, Cambridge University Press, Cambridge, 2013.
W. Koepf, Hypergeometric Summation, Springer Universitext Series, 2nd edition, 2014, http://www.hypergeometric-summation.org.
E. H. Doha, W. M. Abd-Elhameed, and M. A. Bassuony, “New algorithms for solving high even-order differential equations using third and fourth Chebyshev-Galerkin methods,” Journal of Computational Physics, vol. 236, pp. 563–579, 2013.
View at: Publisher Site | Google Scholar
E. H. Doha and W. M. Abd-Elhameed, “New linearization formulae for the products of Chebyshev polynomials of third and fourth kinds,” The Rocky Mountain Journal of Mathematics, vol. 46, no. 2, pp. 443–460, 2016.
View at: Publisher Site | Google Scholar
W. M. Abd-Elhameed, “New product and linearization formulae of Jacobi polynomials of certain parameters,” Integral Transforms and Special Functions, vol. 26, no. 8, pp. 586–599, 2015.
View at: Publisher Site | Google Scholar
H. B. Jebreen, “On the numerical solution of Fisher’s equation by an efficient algorithm based on multiwavelets,” AIMS Mathematics, vol. 6, no. 3, pp. 2369–2384, 2020.
View at: Publisher Site | Google Scholar

Copyright

Copyright © 2023 W. M. Abd-Elhameed et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

136

Downloads

171

Citations