Research Article | | Peer-Reviewed

A Mathematical Analysis of Mamadu-Njoseh Polynomials and Their Differential Properties

Received: 10 October 2026     Accepted: 21 October 2026     Published: 31 October 2026
Views:       Downloads:
Abstract

This study develops a mathematical framework for the Mamadu-Njoseh polynomial (MNP) family and investigates its fundamental properties and differential characteristics on a specified interval with an associated weight function. The polynomials are constructed using a weighted Gram-Schmidt orthogonalization process and normalized according to a prescribed endpoint condition. Their principal properties, including orthogonality, parity structure, norms, three-term recurrence relations, polynomial coefficients, and shifted forms, are derived and examined. Furthermore, an exact Euler-type differential equation is obtained from the parity structure of the MNP family, providing a degree-dependent differential characterization of its polynomial members. The established properties provide a theoretical basis for investigating the approximation capabilities of MNPs and their potential use in numerical analysis. In particular, the polynomials can be explored as basis functions in weighted spectral and collocation methods for approximating solutions of ordinary and partial differential equations. Their possible extension to fractional differential equations also presents an avenue for further research. However, the practical effectiveness of these applications depends on additional analysis of approximation errors, convergence, numerical stability, and computational performance. The results therefore establish foundational analytical properties of the Mamadu-Njoseh polynomial family and identify directions for future research in approximation theory, differential equations, and numerical computation.

Published in American Journal of Applied Mathematics (Volume 14, Issue 5)
DOI 10.11648/j.ajam.20261405.21
Page(s) 380-388
Creative Commons

This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.

Copyright

Copyright © The Author(s), 2026. Published by Science Publishing Group

Keywords

Mamadu-Njoseh Polynomials, Orthogonal Polynomials, Weighted Gram-Schmidt Orthogonalization, Three-Term Recurrence, Parity, Spectral Approximation

1. Introduction
Orthogonal polynomials form an important class of functions with extensive applications in approximation theory, numerical analysis, spectral methods, interpolation, quadrature, differential equations, mathematical physics, and related areas. The importance arises from the combination of algebraic structure, orthogonality, recurrence relations, differential properties, zero distributions, and approximation capabilities . The general theory of orthogonal polynomials is closely related to positive measures, moment functionals, Gram-Schmidt orthogonalization, three-term recurrence relations, and Gaussian quadrature . These properties provide the theoretical foundation for constructing efficient polynomial bases for analytical and computational applications.
For a positive weight function, the corresponding orthogonal polynomial sequence can be constructed from the monomial basis by an orthogonalization procedure. The polynomials obtained satisfy a three-term recurrence relation, one of the basic structural properties of orthogonal polynomial systems . Such recurrence relations are important for the generation of successive polynomial members, for the analysis of their zeros, norms, Christoffel-Darboux kernels, Gaussian quadrature rules and their approximation properties . Therefore, orthogonal polynomial bases have become the basis of high-order approximation and spectral discretization methods .
The classical theory of orthogonal polynomials is primarily concerned with the Jacobi, Laguerre and Hermite families. These systems have rich structures related to recurrence relations, Rodrigues-type representations, generating functions and differential equations . Their defining weights satisfy Pearson-type differential equations and the polynomial members satisfy second-order differential equations with order independent of the polynomial degree . These properties provide an important reference framework for investigating newly constructed orthogonal polynomial systems and determining whether analogous structural properties can be established.
The characterization of orthogonal polynomial families via differential equations is particularly significant. Classical families are closely related to second-order differential operators and Sturm-Liouville-type problems, a connection which underlies many of their analytical and computational applications. This theory has motivated the investigation of broader classes of orthogonal polynomials for which the corresponding differential equations may involve more complicated coefficients or higher-order structures . Thus, in recent years, much attention has been paid to non-classical and semi-classical orthogonal polynomial systems. For these systems, recurrence coefficients, structure relations, differential equations, and asymptotic properties may show considerably richer behavior than for classical families . For example, Wang et al. studied orthogonal polynomials associated with a semi-classical weight and considered the connection between recurrence coefficients and differential equations. Yakubovich studied composition-orthogonality methods for the construction of new systems of orthogonal polynomials and proved the corresponding recurrence, differential, generating-function and Rodrigues-type properties. These studies demonstrate the continuing development of systematic approaches for constructing and analysing non-classical orthogonal polynomial families.
The study of differential equations associated with orthogonal polynomials remains particularly important. For semi-classical systems, the relationship between the differential properties of the weight and the equations satisfied by the associated polynomials provides an important means of understanding their structure. Dzhamay et al. demonstrated that differential systems associated with recurrence coefficients of semi-classical orthogonal polynomials can be connected with nonlinear differential equations of Painlevé type. Similarly, Zhu et al. considered orthogonal polynomials associated with modified weights and established second-order linear differential equations, including equations related to Heun-type structures. Bracciali et al. further studied semi-classical orthogonal polynomials through Pearson-type equations and obtained structure relations, difference equations, and differential equations for the associated polynomial families. These developments highlight the importance of identifying differential equations that characterize newly constructed or generalized orthogonal polynomial systems.
Orthogonal polynomials also play a fundamental role in approximation theory and numerical computation. Their use as basis functions in spectral methods provides highly accurate approximations for differential and integral equations, particularly when the underlying solutions have sufficient regularity . Alternative orthogonal systems are therefore of interest when classical bases are not ideally suited to a particular weight function, boundary condition, differential operator, or numerical formulation. Recent studies have demonstrated the application of orthogonal polynomial bases to fractional integral and differential equations, quadrature, and other problems involving non-standard operators .
Within this broader development, the Mamadu-Njoseh polynomials (MNPs) constitute a non-classical orthogonal polynomial family introduced for numerical approximation and computational applications. The polynomials were constructed as orthogonal basis functions and applied as trial functions for the numerical solution of fifth-order boundary-value problems. Their numerical experiments considered both linear and nonlinear problems and demonstrated the applicability of the MNP basis to boundary-value problems . The MNP family has subsequently been employed in several numerical formulations. Mamadu and Njoseh investigated the use of orthogonal polynomials in orthogonal collocation methods for Fredholm integro-differential equations, thereby demonstrating the relevance of the polynomial basis to collocation procedures. Further applications have included iterative and collocation approaches for differential equations, as well as numerical approximation of fractional models. In particular, Mamadu et al. developed a finite-element orthogonal collocation approach for the time-fractional telegraph equation using MNPs as basis functions, while Mamadu et al. also investigated an implicit finite-difference method with MNP basis functions and provided an associated error analysis.
The application of MNPs has also been extended to nonlinear and stochastic problems. Akponana and Njoseh investigated MNP-based iterative approaches for nonlinear differential equations, while Onyeoghane and Njoseh employed MNPs as modifier and basis functions in enhanced iterative methods for the Heston stochastic partial differential equation. These studies demonstrate the continuing use of MNPs in numerical schemes involving ordinary, partial, fractional, and stochastic differential equations. More recent work has also explored MNP-based spectral and approximation formulations, further indicating the potential of the family as a computational basis.
Despite these developments, the existing MNP literature has mainly focused on the use of the polynomials as basis, trial, modifier or approximation functions in numerical schemes. It is essential to perform a systematic investigation of their intrinsic mathematical structure. In particular, we need a uniform treatment of their orthogonality, normalization, parity, norm relations, recurrence structure, coefficient representation, generating function, shifted formulation and differential properties, so as to lay a firmer theoretical foundation for later applications. The question of differential structure is especially important because the existence of a three-term recurrence or a degree-dependent differential identity does not automatically imply the existence of a fixed-order differential equation for the entire polynomial family.
Motivated by this gap, the present study develops a systematic mathematical framework for the Mamadu-Njoseh polynomial family. The MNPs are constructed through weighted Gram-Schmidt orthogonalization and normalized at the right endpoint. Their fundamental properties, including orthogonality, parity, norm relations, recurrence relations, coefficient representations, and shifted forms, are established. The three-term recurrence provides an efficient mechanism for generating successive polynomial members, while the associated coefficient recurrence provides an algebraic procedure for computing their coefficients.
The analysis relies heavily on the parity of the defining weight. Since the weight is even, the resulting MNPs inherit an alternating parity: even-indexed polynomials are even functions, odd-indexed polynomials are odd functions. This property provides a simplified representation of the polynomial family and facilitates the derivation of coefficient and differential relations. The first ten MNP members are explicitly constructed to demonstrate the consistency of the proposed formulation and to provide concrete basis functions for subsequent theoretical and numerical investigations. A further objective is to investigate the differential structure of the MNP family. An exact Euler-type differential relation is derived directly from the parity-based polynomial representation. This relation provides a rigorous differential characterization of each individual MNP. However, because its order depends on the polynomial degree, it should not be identified with a fixed second-order differential equation for the entire family. Establishing whether a genuine fixed-order differential equation exists for the MNPs under the present weight and normalization constitutes a separate mathematical problem and requires independent analysis.
The orthogonality and approximation properties of the MNPs also establish their potential as basis functions for weighted spectral and projection methods. Their existing applications to boundary-value problems, integro-differential equations, fractional telegraph equations, and stochastic partial differential equations further demonstrate their computational relevance. The present work therefore provides a mathematical foundation for extending MNP-based techniques to approximation schemes, collocation methods, spectral methods, fractional differential equations, and other computational problems.
The main contributions of this study are the systematic construction of the Mamadu-Njoseh polynomial family, the establishment of its fundamental orthogonality and parity properties, the derivation of its recurrence and coefficient relations, the explicit construction of its initial members, and the investigation of its differential structure. Particular emphasis is placed on distinguishing exact degree-dependent polynomial annihilating relations from genuine fixed-order differential equations. This distinction provides a mathematically precise basis for further theoretical investigations of the MNP family and its applications in numerical analysis.
2. Mamadu-Njoseh Polynomials
Let φn denote the vector space of all algebraic polynomials of degree at most n. Consider the interval .
I= [-1,1]
and the weight function
w(x)=1+x2
Since
1+x2>0,  x∈ [-1,1],
we define the weighted inner product
⟨u,v⟩w=∫-11(1+x2)u(x)v(x) dx.(1)
The Mamadu-Njoseh polynomial of degree n, denoted by φn(x), is the degree-n polynomial satisfying .
φn(x)=∑r=0nCr(n)xr,(2)
together with
⟨φm,φn⟩w=0,  m≠n,(3)
and the normalization
φn(1)=1.(4)
Thus, the MNP sequence {φn(x)}n=0∞ is an orthogonal polynomial system on [-1,1] with respect to w(x)=1+x2.
2.1. Construction by Gram-Schmidt Orthogonalization
The MNPs can be constructed from the monomial sequence 1,x,x2,x3,… using the Gram-Schmidt process under .
⟨u,v⟩w=∫-11(1+x2)u(x)v(x) dx.(5)
Let φ0(x)=1. For n≥1, suppose φ0,φ1,…,φn-1, have already been constructed. Define
qn(x)=xn-∑j=0n-1⟨xn,φj⟩w⟨φj,φj⟩wφj(x).(6)
Then
⟨qn,φj⟩w=0,  j=0,1,…,n-1.
Finally, normalize by
φn(x)=qn(x)qn(1).
Consequently,
φn(1)=1.
This provides an algorithmic definition of the MNPs.
2.2. General Properties
2.2.1. Orthogonality
The Mamadu-Njoseh polynomials satisfy .
∫-11(1+x2)φm(x)φn(x) dx=hnδmn,(7)
where
δmn=1,m=n,0,m≠n,
and
hn=∥φn∥w2.
By construction, the polynomialφnis orthogonal to every polynomial of lower degree. Sincedeg(φm)=m<n,we obtain⟨φm,φn⟩w=0.Form=n,⟨φn,φn⟩w=hn.Hence⟨φm,φn⟩w=hnδmn.
2.2.2. Parity Properties
The weight function satisfies
w(-x)=1+(-x)2=1+x2=w(x)
Therefore, the weight is symmetric about the origin. Consequently, the MNPs can be chosen with the parity property .
φn(-x)=(-1)nφnx.(8)
Hence
φ2k(-x)=φ2k(x),
while
φ2k+1(-x)=-φ2k+1(x).
Thus, φ0,φ2,φ4,…are even, and φ1,φ3,φ5,…are odd.
2.2.3. Norm and Inner-Product Relations
Define
hn=∫-11(1+x2)φn2(x) dx.(9)
Then
∥φn∥w=hn.
The corresponding normalized polynomial is
φ̂nx=φnxhn.(10)
It follows that
⟨φ̂m,φ̂n⟩w=δmn.
Hence {φ̂n} is an orthonormal system, whereas the conventional MNPs satisfy the endpoint normalization
φn(1)=1.
For example,
h0=∫-11(1+x2) dx=83.
For φ1(x)=x,
h1=∫-11(1+x2)x2 dx=1615.
2.2.4. Recurrence Relation
Let φn(x) denote the Mamadu-Njoseh polynomial, so that the coefficient of xn is 1. For the weight wx=1+x2, -1≤x≤1, the monic polynomials satisfy .
φn+1(x)=xφn(x)-βnφn-1(x),  n≥1,(11)
where
βn=∫-11(1+x2)φn2(x) dx∫-11(1+x2)φn-12(x) dx.(12)
The normalized MNPs are then
φn(x)=φn(x)φn(1).(13)
Consequently, (11) can be concisely written as
φn+1(x)=Anxφn(x)-Bnφn-1(x),(14)
where
An=φn(1)φn+1(1),
and
Bn=βnφn-1(1)φn+1(1).
This is the recurrence (11) or (14) we will actually use to construct the normalized MNPs. Thus, the first ten MNPs for n=0,1,…,9,
ϕ0=1,
ϕ1=x,
ϕ2=5x2-23,
ϕ3=14x3-9x5,
ϕ4=357x4-322x2+3772,
ϕ5=1221x5-1410x3+325x136,
ϕ6=17589x6-24750x4+8685x2-4601064,
ϕ7=65780x7-109109x5+51590x3-6125x2136,
ϕ8=4052477x8-7739732x6+4610606x4-879956x2+2662170016,
and
ϕ9=15968797x9-34505172x7+24814062x5-6609876x3+477981x145792.
For practical computation, the recurrence becomes
φn+1(x)=Anxφn(x)-Bnφn-1(x). (15)
For n=1,…,8, the coefficients are:
nAnBn15323242251725385483748436632023164020235906149214140492166118032841283393284177566513402592035405934025920839524579208858431863873620885843
For example, the first recurrence is
φ2=53xφ1-23φ0.
Since
φ1=x,  φ0=1,
we obtain
φ2=53x2-23=5x2-23.
The next is
φ3=4225xφ2-1725φ1.
Substituting φ2 and φ1,
φ3=4225x5x2-23-1725x=145x3-95x=14x3-9x5.
This demonstrates exactly how the recurrence generates the subsequent members.
Now, due to the parity relation, write
φnx=∑j=0n2cn,jxn-2j,(16)
with leading coefficient
cn,0=1.
Substituting (16) into (11), we have,
∑j=0n+12cn+1,jxn+1-2j=∑j=0⌊n/2⌋cn,jxn+1-2j-βn∑j=0n-12cn-1,jxn-1-2j.(17)
Re-index the second sum to obtain,
n-1-2j=n+1-2(j+1).(18)
Therefore,
cn+1,j=cn,j-βncn-1,j-1,  j≥1.(19)
with
cn,0=1,
which is a coefficient recurrence for the MNPs. Thus the MNP recurrence has a direct algebraic-to-coefficient formulation.
Now, let differentiate (11) for the first time yields
φn+1'=φn+xφn'-βnφn-1'.(20)
Differentiating again for the second time,
φn+1″=2φn'+xφn″-βnφn-1″.(21)
These are exact differential-difference relations. Notice that (11) is a recurrence in the degree n, whereas φn', φn″ are derivatives in the variable x. Therefore, the three-term recurrence by itself does not immediately imply a second-order ODE.
2.2.5. Generating-Function Formulation
Define the formal generating function for the MNPs by
G(x,t)=∑n=0∞φn(x)tn.(22)
Multiply (11) by tn+1 and sum for n≥1, we obtain,
∑n=1∞φn+1tn+1=x∑n=1∞φntn+1-∑n=1∞βnφn-1tn+1. (23)
The left side is G-1-xt, and the first term on the right is xt(G-1). For the last term, put k=n-1, such taht
∑n=1∞βnφn-1tn+1=t2∑k=0∞βk+1φktk.
Therefore
G-1-xt=xt(G-1)-t2∑k=0∞βk+1φktk.
Hence
(1-xt)G(x,t)=1-t2∑k=0∞βk+1φk(x)tk.(24)
This is the exact generating-function identity implied by the MNP recurrence.
2.2.6. Shifted Mamadu-Njoseh Polynomials
The MNPs are naturally defined on [-1,1]. For a problem defined on [a,b], introduce the linear transformation .
t=2x-a-bb-a.
Then
x=a ⇒ t=-1,
and
x=b ⇒ t=1.
The shifted MNP is therefore defined by
φn [a,b](x)=φn2x-a-bb-a.(25)
This transformation is used in applications of MNPs to boundary-value problems on other intervals.
3. Exact MNP Differential Equation
Here we can construct an exact differential equation for every MNP using the parity structure.
Let us introduce the Euler differential operator
Θ=xddx. (26)
Its action on a monomial is Θxk=kxk. Since
Pn(x)=cn,0xn+cn,1xn-2+⋯+cn,mxn-2m,
where m=n2, we have
Θxn-2j=(n-2j)xn-2j.
Consequently,
 [Θ-n]xn=0,
 [Θ-(n-2)]xn-2=0,
and so on. Therefore every term in φn is annihilated by ∏j=0m [Θ-(n-2j)]. Hence we obtain the exact MNP differential equation
∏j=0n2xddx-n-2jφn(x)=0,(27)
or,
∏j=0⌊n/2⌋xddx-(n-2j)φn(x)φn(1)=0,(28)
in the normalized MNP. This is a genuine differential equation, not a conjecture. Let us verify it for the first few MNPs.
When n=0, ϕ0(x)=1. The equation is Θϕ0=0. Indeed, xddx(1)=0. Therefore, Θϕ0=0.
When n=1, ϕ1(x)=x. The equation is Θ-1ϕ1=0. Since Θx=x, we obtain (Θ-1)x=0. Hence, xddx-1ϕ1=0.
When n=2, ϕ2x=5x2-23. The differential equation is Θ(Θ-2)ϕ2=0. Indeed, Θϕ2=10x23,
and (Θ-2)ϕ2=43. Therefore, Θ(Θ-2)ϕ2=Θ43=0.
When n=3, ϕ3(x)=14x3-9x5. The equation becomes Θ(Θ-1)(Θ-3)ϕ3=0. Indeed, the two powers occurring are x3,x, and (Θ-3)x3=0, while (Θ-1)x=0. Thus both terms are annihilated.
Equation (27) is exact; however, it does not yet constitute a fixed second-order differential equation of the standard type commonly associated with classical polynomial families. In a classical setting, a polynomial sequence satisfies a differential equation whose order remains fixed, independently of the polynomial degree. For example, Legendre polynomials satisfy.
(1-x2)y″-2xy'+n(n+1)y=0,
where the differential order remains 2 for every n.
In contrast, although (27) provides an exact differential relation for the Mamadu-Njoseh polynomials, further analysis is required to determine whether it can be reduced to a fixed second-order differential equation with coefficients independent of (n) in the standard classical sense. Establishing such an equation, if it exists, constitutes an important direction for future research.
4. Approximation Theorem
Let
Lw2(-1,1)=f: ∫-11(1+x2)|f(x)|2 dx<∞.(29)
Since the MNPs constitute an orthogonal polynomial system, a function f can be approximated by
fN(x)=∑n=0Nanφn(x).(30)
The best weighted L2-projection is obtained by choosing
an=⟨f,φn⟩whn=∫-11(1+x2)f(x)φn(x) dx∫-11(1+x2)φn2(x) dx.(31)
Thus, the approximation is
fN(x)=∑n=0N⟨f,φn⟩whnφn(x).(32)
The weighted projection error satisfies
∥f-fN∥w2=∥f∥w2-∑n=0Nhnan2,
provided the expansion is interpreted as the orthogonal projection in Lw2. This identity is particularly useful in convergence studies.
5. Fractional Mamadu-Njoseh Polynomials
A fractional extension of the MNP family has been introduced. For α≥0, define
φnαx=∑r=0nCrnxrαΓrα+1,(33)
where,
Γ(z)=∫0∞tz-1e-t dt,
is the Gamma function.
The fractional basis is designed so that fractional differentiation produces a particularly simple structure. A published formulation gives the corresponding fractional orthogonality and derivative properties. For example, under the appropriate fractional derivative Dα,
Dαφn(α)(x)=-φn-1(α)(x),(34)
with higher derivatives satisfying
Daαφn(α)(x)=(-1)aφn-a(α)(x),(35)
under the conventions and normalization of that fractional formulation. This makes the fractional MNP basis attractive for fractional differential equations.
6. Discussion
The construction and analysis of the Mamadu-Njoseh polynomials (MNPs) presented in this study establish a systematic orthogonal polynomial family on the interval [-1,1] with respect to the positive weight function w(x)=1+x2. Since 1+x2>0 throughout the interval, the associated weighted inner product defines a valid positive-definite inner-product space. The Gram-Schmidt procedure applied to the monomial basis consequently produces a unique sequence of orthogonal polynomials up to a multiplicative constant, which is fixed here by the normalization φn(1)=1. The derived MNPs exhibit a clear parity structure resulting from the symmetry of the weight function. Specifically, the even-indexed polynomials are even functions, whereas the odd-indexed polynomials are odd functions. This property significantly simplifies their algebraic representation and provides an efficient means of constructing the polynomial coefficients. The first several members obtained from the recurrence confirm this structure explicitly.
A three-term recurrence relation was established for the MNP sequence. This recurrence provides an efficient computational mechanism for generating higher-degree polynomials without repeatedly performing the complete Gram-Schmidt orthogonalization process. The coefficient recurrence obtained from the parity representation further demonstrates that the algebraic structure of the MNPs can be generated recursively.
An exact differential relation for every MNP was obtained using the Euler operator Θ=xddx. Since each φn contains only powers xn,xn-2,xn-4,…, every member is annihilated by the operator ∏j=0⌊n/2⌋Θ-(n-2j). Thus,
∏j=0⌊n/2⌋xddx-(n-2j)φn(x)=0
This provides an exact Euler-type differential equation for each individual MNP. However, its order depends on n, namely ⌊n/2⌋+1. Consequently, it should be distinguished from a fixed second-order differential equation of the type satisfied by classical polynomial families.
The weighted orthogonality of the MNPs also provides a natural approximation framework. Any function in the weighted space Lw2-1,1 can be approximated through finite MNP expansions. The associated coefficients are obtained by weighted projection, thereby providing a direct spectral approximation procedure. This property makes the MNP family potentially useful for numerical methods for ordinary, partial, and fractional differential equations.
The fractional extension introduces a basis involving powers of xα scaled by Gamma functions. Such a formulation can be useful in fractional differential-equation problems, although the precise fractional derivative, normalization, orthogonality, and associated operational properties must be specified and independently established before these properties are treated as general consequences of the classical MNP construction.
7. Conclusion
This study develops a systematic mathematical framework for the Mamadu-Njoseh polynomial (MNP) family on the interval [-1,1] with weight function w(x)=1+x2, constructed through weighted Gram-Schmidt orthogonalization and normalized by φn(1)=1. The fundamental properties of the MNPs, including orthogonality, parity, norms, three-term recurrence, coefficient representation, shifted forms, and the first ten polynomi)al members, are established. An exact Euler-type differential relation is derived from their parity structure, providing a rigorous degree-dependent differential characterization, although it does not constitute a fixed second-order differential equation for the entire family. The results establish the MNPs as a useful polynomial basis for weighted approximation and provide a foundation for their further application in spectral, collocation, numerical, and fractional differential equation methods.
Author Contributions
Ebimene James Mamadu: Conceptualization, Formal Analysis, Methodology, & writing–original draft
Marcus Ifeanyi Ossaiugbo: Formal analysis & writing– review & editing
Jude Chukwuyem Nwankwo: Validation & writing– review & editing
Ebikonbo-Owei Anthony Mamadu: writing– review & editing
Joyce Amaka Mamadu: Writing – review & editing
Ignatius Nkonyeasua Njoseh: Validation
Henrietta Ify Jarikre: Writing – review & editing
Conflicts of Interest
The authors declare that there are no conflicts of interest regarding the publication of this paper.
References
[1] Szegő G. Orthogonal polynomials. Am Math Soc. 1975; 4th ed.
[2] Chihara TS. An introduction to orthogonal polynomials. Gordon and Breach. 1978.
[3] Ismail MEH. Classical and quantum orthogonal polynomials in one variable. Cambridge Univ Press. 2005.
[4] Marcellán F, Van Assche W, eds. Orthogonal polynomials and special functions: computation and applications. Springer. 2006.
[5] Branquinho A, Foulquié-Moreno A, Mañas M. Oscillatory banded Hessenberg matrices, multiple orthogonal polynomials and Markov chains. Phys Scr. 2023; 98(10): 105223.
[6] Cuyt AAM, Lee W, Yang X. On tensor decomposition, sparse interpolation and Padé approximation. Jaén J Approx. 2016; 8(1): 33-58.
[7] Branquinho A, Foulquié-Moreno A, Mañas M, Álvarez Fernández C, Fernández-Díaz JE. Multiple orthogonal polynomials and random walks. arXiv. 2021; arXiv: 2103.13715.
[8] Fernández L, de la Iglesia MD. Quasi-birth-and-death processes and multivariate orthogonal polynomials. J Math Anal Appl. 2021; 499(1): 125029.
[9] Branquinho A, Foulquié-Moreno A, Mañas M, Fernández-Díaz JE. Hypergeometric multiple orthogonal polynomials and random walks. arXiv. 2021; arXiv: 2107.00770.
[10] Dunkl CF, Xu Y. Orthogonal polynomials of several variables. Cambridge Univ Press. 2014; 2nd ed.
[11] Gautschi W. Orthogonal polynomials: computation and approximation. Oxford Univ Press. 2004.
[12] Canuto C, Hussaini MY, Quarteroni A, Zang TA. Spectral methods: evolution to complex geometries and applications to fluid dynamics. Springer. 2007.
[13] Kounchev O. Multidimensional Chebyshev systems—just a definition. arXiv. 2011; arXiv: 0808.2213.
[14] Hafeez MB, Krawczuk M. Spectral finite element method: a review of applications. Arch Comput Methods Eng. 2023.
[15] Fernández L, de la Iglesia MD. QBD processes associated with Jacobi-Koornwinder bivariate polynomials and urn models. Mediterr J Math. 2023; 20(6): 290.
[16] Ismail MEH. Classical and quantum orthogonal polynomials in one variable. Encyclopedia of Mathematics and Its Applications. Cambridge Univ Press. 2005; 98.
[17] Koornwinder T. Two-variable analogues of the classical orthogonal polynomials. In: Askey RA, ed. Theory and application of special functions. Academic Press. 1975: 435-495.
[18] Bracciali CF, Pérez TE. Bivariate orthogonal polynomials, 2D Toda lattices and Lax-type pairs. Appl Math Comput. 2017; 309: 142-155.
[19] Bracciali CF, Piñar MA. On multivariate orthogonal polynomials and elementary symmetric functions. Numer Algorithms. 2023; 92(1): 183-206.
[20] Martínez-Finkelshtein A, Orive R, Sánchez-Lara J. Electrostatic partners and zeros of orthogonal and multiple orthogonal polynomials. Constr Approx. 2022; 58(2): 271-342.
[21] Nikishin EM, Sorokin VN. Rational approximations and orthogonality. Am Math Soc. 1991; 92.
[22] Van Assche W. Padé and Hermite-Padé approximation and orthogonality. arXiv. 2006; arXiv: math/0609094.
[23] Borges CF, Gragg WB. A parallel divide and conquer algorithm for the generalized real symmetric definite tridiagonal eigenproblem. In: Reichel L, Ruttan A, Varga RS, eds. Numerical linear algebra. de Gruyter. 1993: 11-29.
[24] Christoffel EB. Über die Gaußische Quadratur und eine Verallgemeinerung derselben. J Reine Angew Math. 1858; 55: 61-82.
[25] Wang D, Dai D, Zhang Y. Semiclassical orthogonal polynomials associated with Freud-type weights. Math Methods Appl Sci. 2020.
[26] Yakubovich S. A method of composition orthogonality and new sequences of orthogonal polynomials and functions for non-classical weights. arXiv. 2020; arXiv: 2006.11752.
[27] Dzhamay A, Filipuk G, Stokes A. Differential equations for the recurrence coefficients of semiclassical orthogonal polynomials and their relation to the Painlevé equations via the geometric approach. Stud Appl Math. 2022; 148(4): 1431-1479.
[28] Zhu M, Chen Y, Yu J, Li C. Orthogonal polynomials: from Heun equations to Painlevé equations. J Math Phys. 2025; 66(1): 013508.
[29] Bracciali CF, Marcellán F, Svaera M. Differential equations for a class of semiclassical orthogonal polynomials on the unit circle. J Math Anal Appl. 2025; 541(1): 128654.
[30] Odjeva JO, Njoseh IN. Solution to fractional order advection-dispersion problems using Galerkin method with Mamadu-Njoseh polynomials. Niger J Sci Environ. 2023; 21(3): 202-218.
[31] Ojada DO, Njoseh IN. Mamadu-Njoseh spectral collocation method for fractional Klein-Gordon equation. Niger J Sci Environ. 2023; 21(1): 75-93.
[32] Onyeoghane JN, Njoseh IN. Enhanced iterative methods using Mamadu-Njoseh polynomials for solving the Heston stochastic partial differential equation. J Adv Math Comput Sci. 2024; 39(12): 1-9.
[33] Njoseh IN, Mamadu EJ. Numerical solutions of fifth order boundary value problems using Mamadu-Njoseh polynomials. Sci World J. 2016; 11(4): 21-24.
[34] Tsetimi J, Mamadu EJ. A new numerical approach for solution to Cauchy partial differential equations using Mamadu-Njoseh polynomials. Cienc Tec Vitivinic. 2021; 36(3): 1-8.
[35] Mamadu EJ, Nwankwo JC, Njoseh IN. Development of Mamadu-Njoseh polynomial neural networks for physics-informed learning. Sci Technol Nexus. 2026; 2(1): 3-11.
[36] Mamadu EJ, Njoseh IN. Certain orthogonal polynomials in orthogonal collocation methods of solving Fredholm integro-differential equations (FIDEs). Trans Niger Assoc Math Phys. 2016; 2: 59-64.
[37] Mamadu EJ, Ojarikre HI, Maduku EO. Finite element orthogonal collocation approach for time fractional telegraph equation with Mamadu-Njoseh polynomials. J Appl Math Phys. 2023; 11(9): 2585-2596.
[38] Mamadu EJ, Ojarikre HI, Njoseh IN. An error analysis of implicit finite difference method with Mamadu-Njoseh basis functions for time fractional telegraph equation. Asian Res J Math. 2023; 19(7): 20-30.
[39] Akponana EB, Njoseh IN. Approximate solution of Newell-Whitehead-Segel equation using iterative methods with Mamadu-Njoseh polynomials. Niger J Sci Environ. 2022; 20(1): 1-10.
Cite This Article
  • APA Style

    Mamadu, E. J., Ossaiugbo, M. I., Nwankwo, J. C., Mamadu, E. A., Mamadu, J. A., et al. (2026). A Mathematical Analysis of Mamadu-Njoseh Polynomials and Their Differential Properties. American Journal of Applied Mathematics, 14(5), 380-388. https://doi.org/10.11648/j.ajam.20261405.21

    Copy | Download

    ACS Style

    Mamadu, E. J.; Ossaiugbo, M. I.; Nwankwo, J. C.; Mamadu, E. A.; Mamadu, J. A., et al. A Mathematical Analysis of Mamadu-Njoseh Polynomials and Their Differential Properties. Am. J. Appl. Math. 2026, 14(5), 380-388. doi: 10.11648/j.ajam.20261405.21

    Copy | Download

    AMA Style

    Mamadu EJ, Ossaiugbo MI, Nwankwo JC, Mamadu EA, Mamadu JA, et al. A Mathematical Analysis of Mamadu-Njoseh Polynomials and Their Differential Properties. Am J Appl Math. 2026;14(5):380-388. doi: 10.11648/j.ajam.20261405.21

    Copy | Download

  • @article{10.11648/j.ajam.20261405.21,
      author = {Ebimene James Mamadu and Marcus Ifeanyi Ossaiugbo and Jude Chukwuyem Nwankwo and Ebikonbo-Owei Anthony Mamadu and Joyce Amaka Mamadu and Ignatius Nkonyeasua Njoseh and Henrietta Ify Jarikre},
      title = {A Mathematical Analysis of Mamadu-Njoseh Polynomials and Their Differential Properties},
      journal = {American Journal of Applied Mathematics},
      volume = {14},
      number = {5},
      pages = {380-388},
      doi = {10.11648/j.ajam.20261405.21},
      url = {https://doi.org/10.11648/j.ajam.20261405.21},
      eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajam.20261405.21},
      abstract = {This study develops a mathematical framework for the Mamadu-Njoseh polynomial (MNP) family and investigates its fundamental properties and differential characteristics on a specified interval with an associated weight function. The polynomials are constructed using a weighted Gram-Schmidt orthogonalization process and normalized according to a prescribed endpoint condition. Their principal properties, including orthogonality, parity structure, norms, three-term recurrence relations, polynomial coefficients, and shifted forms, are derived and examined. Furthermore, an exact Euler-type differential equation is obtained from the parity structure of the MNP family, providing a degree-dependent differential characterization of its polynomial members. The established properties provide a theoretical basis for investigating the approximation capabilities of MNPs and their potential use in numerical analysis. In particular, the polynomials can be explored as basis functions in weighted spectral and collocation methods for approximating solutions of ordinary and partial differential equations. Their possible extension to fractional differential equations also presents an avenue for further research. However, the practical effectiveness of these applications depends on additional analysis of approximation errors, convergence, numerical stability, and computational performance. The results therefore establish foundational analytical properties of the Mamadu-Njoseh polynomial family and identify directions for future research in approximation theory, differential equations, and numerical computation.},
     year = {2026}
    }
    

    Copy | Download

  • TY  - JOUR
    T1  - A Mathematical Analysis of Mamadu-Njoseh Polynomials and Their Differential Properties
    AU  - Ebimene James Mamadu
    AU  - Marcus Ifeanyi Ossaiugbo
    AU  - Jude Chukwuyem Nwankwo
    AU  - Ebikonbo-Owei Anthony Mamadu
    AU  - Joyce Amaka Mamadu
    AU  - Ignatius Nkonyeasua Njoseh
    AU  - Henrietta Ify Jarikre
    Y1  - 2026/10/31
    PY  - 2026
    N1  - https://doi.org/10.11648/j.ajam.20261405.21
    DO  - 10.11648/j.ajam.20261405.21
    T2  - American Journal of Applied Mathematics
    JF  - American Journal of Applied Mathematics
    JO  - American Journal of Applied Mathematics
    SP  - 380
    EP  - 388
    PB  - Science Publishing Group
    SN  - 2330-006X
    UR  - https://doi.org/10.11648/j.ajam.20261405.21
    AB  - This study develops a mathematical framework for the Mamadu-Njoseh polynomial (MNP) family and investigates its fundamental properties and differential characteristics on a specified interval with an associated weight function. The polynomials are constructed using a weighted Gram-Schmidt orthogonalization process and normalized according to a prescribed endpoint condition. Their principal properties, including orthogonality, parity structure, norms, three-term recurrence relations, polynomial coefficients, and shifted forms, are derived and examined. Furthermore, an exact Euler-type differential equation is obtained from the parity structure of the MNP family, providing a degree-dependent differential characterization of its polynomial members. The established properties provide a theoretical basis for investigating the approximation capabilities of MNPs and their potential use in numerical analysis. In particular, the polynomials can be explored as basis functions in weighted spectral and collocation methods for approximating solutions of ordinary and partial differential equations. Their possible extension to fractional differential equations also presents an avenue for further research. However, the practical effectiveness of these applications depends on additional analysis of approximation errors, convergence, numerical stability, and computational performance. The results therefore establish foundational analytical properties of the Mamadu-Njoseh polynomial family and identify directions for future research in approximation theory, differential equations, and numerical computation.
    VL  - 14
    IS  - 5
    ER  - 

    Copy | Download

Author Information
  • Department of Mathematics, Faculty of Science, Delta State University, Abraka, Nigeria

  • Department of Mathematics, Faculty of Science, Delta State University, Abraka, Nigeria

  • Department of Mathematics, Faculty of Science, University of Delta, Agbor, Nigeria

  • Department of Mathematics, Faculty of Science, Delta State University, Abraka, Nigeria

  • Department of Mathematics, Faculty of Science, Delta State University, Abraka, Nigeria

  • Department of Mathematics, Faculty of Science, Delta State University, Abraka, Nigeria

  • Department of Mathematics, Faculty of Science, Delta State University, Abraka, Nigeria