DOCSLIB.ORG

Computation of Some Wonderful Results Involving Certain Polynomials by Salahuddin & R.K

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Computation of Some Wonderful Results Involving Certain Polynomials by Salahuddin & R.K Global Journal of Science Frontier Research Mathematics and Decision Sciences Volume 13 Issue 10 Version 1.0 Year 2013 Type : Double Blind Peer Reviewed International Research Journal Publisher: Global Journals Inc. (USA) Online ISSN: 2249-4626 & Print ISSN: 0975-5896 Computation of Some Wonderful Results Involving Certain Polynomials By Salahuddin & R.K. Khola Mewar University, India Abstract- In this paper we have developed some indefinite integrals involving certain polynomials in the form of Hypergeometric function. The results represent here are assume to be new. Keywords: hypergeometric function, lucas polynomials, gegenbaur polynomials, harmonic number, bernoulli polynomial, hermite polynomials. GJSFR-F Classification : MSC 2010 11B39, 11B68, 33C05, 33C45, 33D50, 33D60 Computation of Some Wonderful Results Involving Certain Polynomials Strictly as per the compliance and regulations of : © 2013. Salahuddin & R.K. Khola. This is a research/review paper, distributed under the terms of the Creative Commons Attribution-Noncommercial 3.0 Unported License http://creativecommons.org/licenses/by-nc/3.0/), permitting all non commercial use, distribution, and reproduction in any medium, provided the original work is properly cited. Notes Computation of Some Wonderful Results 13 0 Involving Certain Polynomials 2 r ea Salahuddin α & R.K. Khola σ Y 29 Abstract- In this paper we have developed some indefinite integrals involving certain polynomials in the form of Hypergeometric function. The results represent here are assume to be new. Keywords: hypergeometric function, lucas polynomials, gegenbaur polynomials, harmonic number, bernoulli polynomial, hermite polynomials. V I. Introduction X ue ersion I s a) We have the generalized Gaussian hypergeometric function of one variable s I ሺ௔భሻೖሺ௔మሻೖǥǤǤሺ௔ಲሻೖ௭ AFB(a1,a2,…,aA;b1,b2,…bB;z ) =σ௞ୀ଴ (1) XIII ሺ௕భሻೖሺ௕మሻೖǥǤǤሺ௕ಳሻೖ௞Ǩ where the parameters b1 , b2 , ….,bB are neither zero nor negative integers and A , B are non negative integers. ) F ) The series converges for all finite z if A B, converges for ŇzŇ<1 if A=B+1, diverges for all z, z 0 if A > B+1. b) Lucas Polynomials Research Volume Frontier Science of Journal Global The Lucas polynomials are the w-polynomials obtained by setting p(x) = x and q(x) = 1 in the Lucas polynomials sequence. It is given explicitly by =−−n 2 +n ++2 n (2) Lxn () 2 [(x x 4 ) + (4xx ) ] Authors α σ : Mewar University, Gangrar, Chittorgarh (Rajasthan), India. e-mails: [email protected], [email protected] ©2013 Global Journals Inc. (US) Computation of Some Wonderful Results Involving Certain Polynomials The first few are = Lx1() x 2 =+ Lx2 () x 2 (3) =+3 Lx3 () x 3x =+42 + Lx4 () x 4 x 2 c) Generalized Harmonic Number Notes The generalized harmonic number of order n of m is given by 2013 n ()m = 1 H n m (4) Year ¦ k=1 k 30 In the limit of n →∞ the generalized harmonic number converges to the Riemann zeta function ()m = ς limHmn ( ) n→∞ (5) V X d) Bernoulli Polynomial Issue ersion I XIII ) F ) Research Volume Frontier Science of In mathematics, the Bernoulli polynomials occur in the study of many special functions and in particular the Riemann zeta function and Hurwitz zeta function. This is in large part because they are an Appell sequence, i.e. a Sheffer sequence for the ordinary derivative operator. Unlike orthogonal polynomials, the Bernoulli polynomials are remarkable in that the number of crossing of the x-axis in the unit interval does not go up as the degree of the Global Journal polynomials goes up. In the limit of large degree, the Bernoulli polynomials, appropriately scaled, approach the sine and cosine functions. Explicit formula of Bernoulli polynomials is n n! Bx()= b xk , for n0, where b are the Bernoulli numbers. nn¦ − −k k k =0 kn!!()k The generating function for the Bernoulli polynomials is © 2 013 Global Journals Inc (US) Computation of Some Wonderful Results Involving Certain Polynomials e) Gegenbauer polynomials (ܤ) In Mathematics, Gegenbauer polynomials or ultraspherical polynomials Cn (x) are orthogonal polynomials on the interval [-1,1] with respect to the weight function α −1 ¦ 2 (1 − x ) 2 . They generalize Legendre polynomials and Chebyshev polynomials, and are special cases of Jacobi polynomials. They are named after Leopold Gegenbauer. Explicitly , Notes «»n 13 «»2 ¬¼ 0 Γ−+ α ()α =−kn()nk (− 2k) 2 Cxn ()¦ (1) (2)z (7) Γ−α r k =0 ()!(2)!kn k ea Y f) Laguerre polynomials 31 V X ue ersion I s s I XIII ) F ) The Laguerre polynomials are solutions Lxn () to the Laguerre differential equation xy''+−(1 x) y '+λ y = 0 , which is a special case of the more general associated Laguerre Research Volume differential equation, defined by xy''++(ν 1− x) y' +λ y = 0 , where λ and ν are real numbers with ν =0. The Laguerre polynomials are given by the sum Frontier n − k = (1)!n k Lx() x Science n ¦ − (8) k=0 kkn!!()k! of g) Hermite polynomials Journal Global ©2013 Global Journals Inc. (US) Computation of Some Wonderful Results Involving Certain Polynomials The Hermite polynomials Hxn ( ) are set of orthogonal polynomials over the domain (-,) 2 with weighting function e− x . The Hermite polynomials Hxn ( ) can be defined by the contour integral n! −+2 −− Hz()= err21znt dt , n π v³ 2 i Where the contour incloses the origin and is traversed in a counterclockwise direction Notes (Arfken 1985, p. 416). 2013 The first few Hermite polynomials are Year = Hx0 () 1 32 = Hx1() 2 x Hx()=−4x2 2 2 (9) =−3 Hx3 () 8 x 12 x V =−+42 Hx4 ( ) 16 x48 x 12 X h) Legendre function of the first kind Issue ersion I XIII ) F ) Research Volume Frontier The Legendre polynomials, sometimes called Legendre functions of the first kind, Legendre coefficients, or zonal harmonics (Whittaker and Watson 1990, p. 302), are solutions to Science the Legendre differential equation. If l is an integer, they are polynomials. The Legendre of polynomials Pxn ( ) are illustrated above for and n=1, 2, ..., 5. The Legendre polynomials Pxn ( ) can be defined by the contour integral −1 1 −− P ()z =−(1 2tz+ t 21 )2 tn dt , (10) Global Journal n 2πi v³ where the contour encloses the origin and is traversed in a counterclockwise direction (Arfken 1985, p. 416). © 2 013 Global Journals Inc (US) Computation of Some Wonderful Results Involving Certain Polynomials i) Legendre function of the second kind Notes 13 0 2 r ea Y 33 The second solution Q1( x) to the Legendre differential equation. The Legendre functions of the second kind satisfy the same recurrence relation as the Legendre polynomials. The first few are V + = 1 1 x Q0 ()x ln( ) X 2 1− x + ue ersion I x 1 x s Q ()x = ln -1 (11) s 1 ( ) I 2 1− x 2 − + XIII = 3x 1 1 x 3x Q2 ( x) ln( )- 4 1− x 2 j) Chebyshev polynomial of the first kind ) F ) Research Volume Frontier Science of Journal The Chebyshev polynomials of the first kind are a set of orthogonal polynomials defined as the solutions to the Chebyshev differential equation and denoted Tn (x). They are used as an approximation to a least squares fit, and are a special case of the Gegenbauer Global = polynomial with α 0. They are also intimately connected with trigonometric multiple-angle . formulas The Chebyshev polynomial of the first kind Tn ()z can be defined by the contour integral 1 (1− t 2 )t −n−1 T() z = dt , (12) n 4πi∫ 1− 2 tz + t 2 ©2013 Global Journals Inc. (US) Computation of Some Wonderful Results Involving Certain Polynomials where the contour encloses the origin and is traversed in a counterclockwise direction (Arfken 1985, p. 416). The first few Chebyshev polynomials of the first kind are = T0 ( x ) 1 = T1() x x =2 − T2 ( x ) 2 x 1 =3 − T3 ( x ) 4 x 3 x Notes A beautiful plot can be obtained by plotting Tn ()x radially, increasing the radius for each 2013 value of n , and filling in the areas between the curves (Trott 1999, pp. 10 and 84). Year 34 V X Issue ersion I XIII ) F ) The Chebyshev polynomials of the first kind are defined through the identity Research Volume Tn(cos θ)=cos nθ. k)Chebyshev polynomial of the second kind Frontier Science of Global Journal A modified set of Chebyshev polynomials defined by a slightly different generating function. They arise in the development of four-dimensionalspherical harmonics in angular momentum © 2 013 Global Journals Inc (US) Computation of Some Wonderful Results Involving Certain Polynomials theory. They are a special case of the Gegenbauer polynomial with α= 1. They are also intimately connected with trigonometric multiple-angle formulas. The first few Chebyshev polynomials of the second kind are = U0 ( x ) 1 U( x )= 2 x 1 (13) U( x )= 4 x2 − 1 Notes 2 =3 − U( x ) 8 x 4 x 13 3 0 2 l) Euler polynomial r ea Y 35 V X ue ersion I s s I XIII ) F ) Research Volume The Euler polynomial En ( x) is given by the Appell sequence with 1 g() t=( et + 1) , 2 Frontier giving the generating function Science xt ∞ n 2e t of ≡ . t ∑ En () x (14) e +1 = n! n 0 Journal The first few Euler polynomials are = Global E0 ( x ) 1 = − 1 E1()x x 2 E () x = x 2 − x (15) 2 3 1 E() x= x3 − x2 + 3 2 4 ©2013 Global Journals Inc. (US) Computation of Some Wonderful Results Involving Certain Polynomials m)Generalized Riemann zeta function Notes 2013 Year 36 V X Issue ersion I XIII ) The Riemann zeta function is an extremely important special function of mathematics and F ) physics that arises in definite integration and is intimately related with very deep results surrounding the prime number theorem.
Load more

Recommended publications
  • Asymptotic Properties of Biorthogonal Polynomials Systems Related to Hermite and Laguerre Polynomials
    Asymptotic properties of biorthogonal polynomials systems related to Hermite and Laguerre polynomials Yan Xu School of Mathematics and Quantitative Economics, Center for Econometric analysis and Forecasting, Dongbei University of Finance and Economics, Liaoning, 116025, PR China Abstract In this paper, the structures to a family of biorthogonal polynomials that ap- proximate to the Hermite and Generalized Laguerre polynomials are discussed respectively. Therefore, the asymptotic relation between several orthogonal polynomials and combinatorial polynomials are derived from the systems, which in turn verify the Askey scheme of hypergeometric orthogonal polynomials. As the applications of these properties, the asymptotic representations of the gen- eralized Buchholz, Laguerre, Ultraspherical (Gegenbauer), Bernoulli, Euler, Meixner and Meixner-Pllaczekare polynomials are derived from the theorems di- rectly. The relationship between Bernoulli and Euler polynomials are shown as a special case of the characterization theorem of the Appell sequence generated by α scaling functions. Keywords: Hermite Polynomial, Laguerre Polynomial, Appell sequence, Askey Scheme, B-splines, Bernoulli Polynomial, Euler polynomials. 2010 MSC: 42C05, 33C45, 41A15, 11B68 arXiv:1503.05387v1 [math.CA] 3 Feb 2015 ✩This work is supported by the Natural Science Foundation of China (11301060), China Postdoctoral Science Foundation (2013M541234, 2014T70258) and Outstanding Scientific In- novation Talents Program of DUFE (DUFE2014R20). ∗Email: yan [email protected] Preprint submitted to Constructive Approximation June 2, 2021 1. Introduction The Hermite polynomials follow from the generating function 2 xz z ∞ Hm(x) m e − 2 = z , z C, x R (1.1) m! ∈ ∈ m=0 X which gives the Cauchy-type integral 2 m! xz z (m+1) H (x)= e − 2 z− dz.
    [Show full text]
  • Chebyshev Polynomials of the Second, Third and Fourth Kinds in Approximation, Indefinite Integration, and Integral Transforms *
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Journal of Computational and Applied Mathematics 49 (1993) 169-178 169 North-Holland CAM 1429 Chebyshev polynomials of the second, third and fourth kinds in approximation, indefinite integration, and integral transforms * J.C. Mason Applied and Computational Mathematics Group, Royal Military College of Science, Shrivenham, Swindon, Wiltshire, United Kingdom Dedicated to Dr. D.F. Mayers on the occasion of his 60th birthday Received 18 February 1992 Revised 31 March 1992 Abstract Mason, J.C., Chebyshev polynomials of the second, third and fourth kinds in approximation, indefinite integration, and integral transforms, Journal of Computational and Applied Mathematics 49 (1993) 169-178. Chebyshev polynomials of the third and fourth kinds, orthogonal with respect to (l+ x)‘/‘(l- x)-‘I* and (l- x)‘/*(l+ x)-‘/~, respectively, on [ - 1, 11, are less well known than traditional first- and second-kind polynomials. We therefore summarise basic properties of all four polynomials, and then show how some well-known properties of first-kind polynomials extend to cover second-, third- and fourth-kind polynomials. Specifically, we summarise a recent set of first-, second-, third- and fourth-kind results for near-minimax constrained approximation by series and interpolation criteria, then we give new uniform convergence results for the indefinite integration of functions weighted by (1 + x)-i/* or (1 - x)-l/* using third- or fourth-kind polynomial expansions, and finally we establish a set of logarithmically singular integral transforms for which weighted first-, second-, third- and fourth-kind polynomials are eigenfunctions.
    [Show full text]
  • Generalizations of Chebyshev Polynomials and Polynomial Mappings
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 359, Number 10, October 2007, Pages 4787–4828 S 0002-9947(07)04022-6 Article electronically published on May 17, 2007 GENERALIZATIONS OF CHEBYSHEV POLYNOMIALS AND POLYNOMIAL MAPPINGS YANG CHEN, JAMES GRIFFIN, AND MOURAD E.H. ISMAIL Abstract. In this paper we show how polynomial mappings of degree K from a union of disjoint intervals onto [−1, 1] generate a countable number of spe- cial cases of generalizations of Chebyshev polynomials. We also derive a new expression for these generalized Chebyshev polynomials for any genus g, from which the coefficients of xn can be found explicitly in terms of the branch points and the recurrence coefficients. We find that this representation is use- ful for specializing to polynomial mapping cases for small K where we will have explicit expressions for the recurrence coefficients in terms of the branch points. We study in detail certain special cases of the polynomials for small degree mappings and prove a theorem concerning the location of the zeroes of the polynomials. We also derive an explicit expression for the discrimi- nant for the genus 1 case of our Chebyshev polynomials that is valid for any configuration of the branch point. 1. Introduction and preliminaries Akhiezer [2], [1] and, Akhiezer and Tomˇcuk [3] introduced orthogonal polynomi- als on two intervals which generalize the Chebyshev polynomials. He observed that the study of properties of these polynomials requires the use of elliptic functions. In thecaseofmorethantwointervals,Tomˇcuk [17], investigated their Bernstein-Szeg˝o asymptotics, with the theory of Hyperelliptic integrals, and found expressions in terms of a certain Abelian integral of the third kind.
    [Show full text]
  • New Bell–Sheffer Polynomial Sets
    axioms Article New Bell–Sheffer Polynomial Sets Pierpaolo Natalini 1,* and Paolo Emilio Ricci 2 1 Dipartimento di Matematica e Fisica, Università degli Studi Roma Tre, Largo San Leonardo Murialdo, 1, 00146 Roma, Italy 2 Sezione di Matematica, International Telematic University UniNettuno, Corso Vittorio Emanuele II, 39, 00186 Roma, Italy; [email protected] * Correspondence: [email protected] Received: 20 July 2018; Accepted: 2 October 2018; Published: 8 October 2018 Abstract: In recent papers, new sets of Sheffer and Brenke polynomials based on higher order Bell numbers, and several integer sequences related to them, have been studied. The method used in previous articles, and even in the present one, traces back to preceding results by Dattoli and Ben Cheikh on the monomiality principle, showing the possibility to derive explicitly the main properties of Sheffer polynomial families starting from the basic elements of their generating functions. The introduction of iterated exponential and logarithmic functions allows to construct new sets of Bell–Sheffer polynomials which exhibit an iterative character of the obtained shift operators and differential equations. In this context, it is possible, for every integer r, to define polynomials of higher type, which are linked to the higher order Bell-exponential and logarithmic numbers introduced in preceding papers. Connections with integer sequences appearing in Combinatorial analysis are also mentioned. Naturally, the considered technique can also be used in similar frameworks, where the iteration of exponential and logarithmic functions appear. Keywords: Sheffer polynomials; generating functions; monomiality principle; shift operators; combinatorial analysis 1. Introduction In recent articles [1,2], new sets of Sheffer [3] and Brenke [4] polynomials, based on higher order Bell numbers [2,5–7], have been studied.
    [Show full text]
  • Chebyshev and Fourier Spectral Methods 2000
    Chebyshev and Fourier Spectral Methods Second Edition John P. Boyd University of Michigan Ann Arbor, Michigan 48109-2143 email: [email protected] http://www-personal.engin.umich.edu/jpboyd/ 2000 DOVER Publications, Inc. 31 East 2nd Street Mineola, New York 11501 1 Dedication To Marilyn, Ian, and Emma “A computation is a temptation that should be resisted as long as possible.” — J. P. Boyd, paraphrasing T. S. Eliot i Contents PREFACE x Acknowledgments xiv Errata and Extended-Bibliography xvi 1 Introduction 1 1.1 Series expansions .................................. 1 1.2 First Example .................................... 2 1.3 Comparison with finite element methods .................... 4 1.4 Comparisons with Finite Differences ....................... 6 1.5 Parallel Computers ................................. 9 1.6 Choice of basis functions .............................. 9 1.7 Boundary conditions ................................ 10 1.8 Non-Interpolating and Pseudospectral ...................... 12 1.9 Nonlinearity ..................................... 13 1.10 Time-dependent problems ............................. 15 1.11 FAQ: Frequently Asked Questions ........................ 16 1.12 The Chrysalis .................................... 17 2 Chebyshev & Fourier Series 19 2.1 Introduction ..................................... 19 2.2 Fourier series .................................... 20 2.3 Orders of Convergence ............................... 25 2.4 Convergence Order ................................. 27 2.5 Assumption of Equal Errors ...........................
    [Show full text]
  • Dymore User's Manual Chebyshev Polynomials
    Dymore User's Manual Chebyshev polynomials Olivier A. Bauchau August 27, 2019 Contents 1 Definition 1 1.1 Zeros and extrema....................................2 1.2 Orthogonality relationships................................3 1.3 Derivatives of Chebyshev polynomials..........................5 1.4 Integral of Chebyshev polynomials............................5 1.5 Products of Chebyshev polynomials...........................5 2 Chebyshev approximation of functions of a single variable6 2.1 Expansion of a function in Chebyshev polynomials...................6 2.2 Evaluation of Chebyshev expansions: Clenshaw's recurrence.............7 2.3 Derivatives and integrals of Chebyshev expansions...................7 2.4 Products of Chebyshev expansions...........................8 2.5 Examples.........................................9 2.6 Clenshaw-Curtis quadrature............................... 10 3 Chebyshev approximation of functions of two variables 12 3.1 Expansion of a function in Chebyshev polynomials................... 12 3.2 Evaluation of Chebyshev expansions: Clenshaw's recurrence............. 13 3.3 Derivatives of Chebyshev expansions.......................... 14 4 Chebychev polynomials 15 4.1 Examples......................................... 16 1 Definition Chebyshev polynomials [1,2] form a series of orthogonal polynomials, which play an important role in the theory of approximation. The lowest polynomials are 2 3 4 2 T0(x) = 1;T1(x) = x; T2(x) = 2x − 1;T3(x) = 4x − 3x; T4(x) = 8x − 8x + 1;::: (1) 1 and are depicted in fig.1. The polynomials can be generated from the following recurrence rela- tionship Tn+1 = 2xTn − Tn−1; n ≥ 1: (2) 1 0.8 0.6 0.4 0.2 0 −0.2 −0.4 CHEBYSHEV POLYNOMIALS −0.6 −0.8 −1 −1 −0.8 −0.6 −0.4 −0.2 0 0.2 0.4 0.6 0.8 1 XX Figure 1: The seven lowest order Chebyshev polynomials It is possible to give an explicit expression of Chebyshev polynomials as Tn(x) = cos(n arccos x): (3) This equation can be verified by using elementary trigonometric identities.
    [Show full text]
  • New Formulae of Squares of Some Jacobi Polynomials Via Hypergeometric Functions
    Hacettepe Journal of Mathematics and Statistics Volume 46 (2) (2017), 165 176 New formulae of squares of some Jacobi polynomials via hypergeometric functions W.M. Abd- Elhameed∗ y Abstract In this article, a new formula expressing explicitly the squares of Jacobi polynomials of certain parameters in terms of Jacobi polynomials of ar- bitrary parameters is derived. The derived formula is given in terms of ceratin terminating hypergeometric function of the type 4F3(1). In some cases, this 4F3(1) can be reduced by using some well-known re- duction formulae in literature such as Watson's and Pfa-Saalschütz's identities. In some other cases, this 4F3(1) can be reduced by means of symbolic computation, and in particular Zeilberger's, Petkovsek's and van Hoeij's algorithms. Hence, some new squares formulae for Jacobi polynomials of special parameters can be deduced in reduced forms which are free of any hypergeometric functions. Keywords: Jacobi polynomials; linearization coecients; generalized hypergeo- metric functions; computer algebra, standard reduction formulae 2000 AMS Classication: 33F10; 33C20; 33Cxx; 68W30 Received : 23.02.2016 Accepted : 19.05.2016 Doi : 10.15672/HJMS.20164518618 1. Introduction The Jacobi polynomials are of fundamental importance in theoretical and applied mathematical analysis. The class of Jacobi polynomials contains six well-known fami- lies of orthogonal polynomials, they are, ultraspherical, Legendre and the four kinds of Chebyshev polynomials. The Jacobi polynomials in general and their six special polyno- mials in particular are extensively employed in obtaining numerical solutions of ordinary, fractional and partial dierential equations. In this respect, these polynomials are em- ployed for the sake of obtaining spectral solutions for various kinds of dierential equa- tions.
    [Show full text]
  • Approximation Atkinson Chapter 4, Dahlquist & Bjork Section 4.5
    Approximation Atkinson Chapter 4, Dahlquist & Bjork Section 4.5, Trefethen's book Topics marked with ∗ are not on the exam 1 In approximation theory we want to find a function p(x) that is `close' to another function f(x). We can define closeness using any metric or norm, e.g. Z 2 2 kf(x) − p(x)k2 = (f(x) − p(x)) dx or kf(x) − p(x)k1 = sup jf(x) − p(x)j or Z kf(x) − p(x)k1 = jf(x) − p(x)jdx: In order for these norms to make sense we need to restrict the functions f and p to suitable function spaces. The polynomial approximation problem takes the form: Find a polynomial of degree at most n that minimizes the norm of the error. Naturally we will consider (i) whether a solution exists and is unique, (ii) whether the approximation converges as n ! 1. In our section on approximation (loosely following Atkinson, Chapter 4), we will first focus on approximation in the infinity norm, then in the 2 norm and related norms. 2 Existence for optimal polynomial approximation. Theorem (no reference): For every n ≥ 0 and f 2 C([a; b]) there is a polynomial of degree ≤ n that minimizes kf(x) − p(x)k where k · k is some norm on C([a; b]). Proof: To show that a minimum/minimizer exists, we want to find some compact subset of the set of polynomials of degree ≤ n (which is a finite-dimensional space) and show that the inf over this subset is less than the inf over everything else.
    [Show full text]
  • Some Classical Multiple Orthogonal Polynomials
    Some classical multiple orthogonal polynomials ∗ Walter Van Assche and Els Coussement Department of Mathematics, Katholieke Universiteit Leuven 1 Classical orthogonal polynomials One aspect in the theory of orthogonal polynomials is their study as special functions. Most important orthogonal polynomials can be written as terminating hypergeometric series and during the twentieth century people have been working on a classification of all such hypergeometric orthogonal polynomial and their characterizations. The very classical orthogonal polynomials are those named after Jacobi, Laguerre, and Hermite. In this paper we will always be considering monic polynomials, but in the literature one often uses a different normalization. Jacobi polynomials are (monic) polynomials of degree n which are orthogonal to all lower degree polynomials with respect to the weight function (1 x)α(1+x)β on [ 1, 1], where α,β > 1. The change of variables x 2x 1 gives Jacobi polynomials− on [0, 1]− for the weight function− w(x) = xβ(1 x)α, and we7→ will− denote (α,β) − these (monic) polynomials by Pn (x). They are defined by the orthogonality conditions 1 P (α,β)(x)xβ(1 x)αxk dx =0, k =0, 1,...,n 1. (1.1) n − − Z0 (α) The monic Laguerre polynomials Ln (x) (with α > 1) are orthogonal on [0, ) to all − α x ∞ polynomials of degree less than n with respect to the weight w(x)= x e− and hence satisfy the orthogonality conditions ∞ (α) α x k Ln (x)x e− x dx =0, k =0, 1,...,n 1. (1.2) 0 − arXiv:math/0103131v1 [math.CA] 21 Mar 2001 Z Finally, the (monic) Hermite polynomials Hn(x) are orthogonal to all lower degree polyno- x2 mials with respect to the weight function w(x)= e− on ( , ), so that −∞ ∞ ∞ x2 k H (x)e− x dx =0, k =0, 1,...,n 1.
    [Show full text]
  • General Bivariate Appell Polynomials Via Matrix Calculus and Related Interpolation Hints
    mathematics Article General Bivariate Appell Polynomials via Matrix Calculus and Related Interpolation Hints Francesco Aldo Costabile, Maria Italia Gualtieri and Anna Napoli * Department of Mathematics and Computer Science, University of Calabria, 87036 Rende (CS), Italy; [email protected] (F.A.C.); [email protected] (M.I.G.) * Correspondence: [email protected] Abstract: An approach to general bivariate Appell polynomials based on matrix calculus is proposed. Known and new basic results are given, such as recurrence relations, determinant forms, differential equations and other properties. Some applications to linear functional and linear interpolation are sketched. New and known examples of bivariate Appell polynomial sequences are given. Keywords: Polynomial sequences; Appell polynomials; bivariate Appell sequence 1. Introduction Appell polynomials have many applications in various disciplines: probability the- ory [1–5], number theory [6], linear recurrence [7], general linear interpolation [8–12], operators approximation theory [13–17]. In [18], P. Appell introduced a class of polynomi- als by the following equivalent conditions: fAngn2IN is an Appell sequence (An being a Citation: Costabile, F.A.; polynomial of degree n) if either Gualtieri, M.I.; Napoli, A. General 8 Bivariate Appell Polynomials via d An(x) > = nA − (x), n ≥ 1, Matrix Calculus and Related > n 1 <> dx Interpolation Hints. Mathematics 2021, A (0) = a , a 6= 0, a 2 IR, n ≥ 0, 9, 964. https://doi.org/ > n n 0 n > 10.3390/math9090964 :> A0(x) = 1, Academic Editor: Clemente Cesarano or ¥ n xt t A(t)e = ∑ An(x) , Received: 13 March 2021 n=0 n! Accepted: 23 April 2021 ¥ tk Published: 25 April 2021 where A(t) = ∑ ak , a0 6= 0, ak 2 IR, k ≥ 0.
    [Show full text]
  • The Relation of the D-Orthogonal Polynomials to the Appell Polynomials
    View metadata, citation and similar papers at core.ac.uk brought to you byCORE provided by Elsevier - Publisher Connector JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS ELSEVIER Journal of Computational and Applied Mathematics 70 (1996) 279-295 The relation of the d-orthogonal polynomials to the Appell polynomials Khalfa Douak Universitb Pierre et Marie Curie, Laboratoire d'Analyse Numbrique, Tour 55-65, 4 place Jussieu, 75252 Paris Cedex 05, France Received 10 November 1994; revised 28 June 1995 Abstract We are dealing with the concept of d-dimensional orthogonal (abbreviated d-orthogonal) polynomials, that is to say polynomials verifying one standard recurrence relation of order d + 1. Among the d-orthogonal polynomials one singles out the natural generalizations of certain classical orthogonal polynomials. In particular, we are concerned, in the present paper, with the solution of the following problem (P): Find all polynomial sequences which are at the same time Appell polynomials and d-orthogonal. The resulting polynomials are a natural extension of the Hermite polynomials. A sequence of these polynomials is obtained. All the elements of its (d + 1)-order recurrence are explicitly determined. A generating function, a (d + 1)-order differential equation satisfied by each polynomial and a characterization of this sequence through a vectorial functional equation are also given. Among such polynomials one singles out the d-symmetrical ones (Definition 1.7) which are the d-orthogonal polynomials analogous to the Hermite classical ones. When d = 1 (ordinary orthogonality), we meet again the classical orthogonal polynomials of Hermite. Keywords: Appell polynomials; Hermite polynomials; Orthogonal polynomials; Generating functions; Differential equations; Recurrence relations AMS classification: 42C99; 42C05; 33C45 O.
    [Show full text]
  • Some New Identities Involving Sheffer-Appell Polynomial Sequences Via Matrix Approach
    SOME NEW IDENTITIES INVOLVING SHEFFER-APPELL POLYNOMIAL SEQUENCES VIA MATRIX APPROACH MOHD SHADAB, FRANCISCO MARCELLAN´ AND SAIMA JABEE∗ Abstract. In this contribution some new identities involving Sheffer-Appell polyno- mial sequences using generalized Pascal functional and Wronskian matrices are de- duced. As a direct application of them, identities involving families of polynomials as Euler, Bernoulli, Miller-Lee and Apostol-Euler polynomials, among others, are given. 1. introduction Sequences of polynomials play an important role in many problems of pure and applied mathematics in the framework of approximation theory, statistics, combinatorics and classical analysis (see, for example, [19, 22{25]). The sequence of Sheffer polynomials constitutes one of the most important family of polynomial sequences. A polynomial sequence fsn(x)gn≥0 is said to be a Sheffer polynomial sequence [6, 9, 24, 27] if its generating function has the following form: 1 X yn A(y)exH(y) = s (x) ; (1.1) n n! n=0 where A(y) = A0 + A1y + ··· ; and 2 H(y) = H1y + H2y + ··· ; with A0 6= 0 and H1 6= 0. Let us recall an alternative definition of the Sheffer polynomial sequences [24, Pg. 17]. P1 yn P1 yn Indeed, let h(y) = n=1 hn n! ; h1 6= 0; and l(y) = n=0 ln n! , l0 6= 0; be, respectively, delta series and invertible series with complex coefficients. Then there exists a unique sequence of Sheffer polynomials fsn(x)gn≥0 satisfying the orthogonality conditions k hl(y)h(y) jsn(x)i = n!δn;k 8 n; k = 0; (1.2) where δn;k is the Kronecker delta.
    [Show full text]