DOCSLIB.ORG

An Infinite Dimensional Umbral Calculus

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
An Infinite Dimensional Umbral Calculus An infinite dimensional umbral calculus Dmitri Finkelshtein Department of Mathematics, Swansea University, Singleton Park, Swansea SA2 8PP, U.K.; e-mail: [email protected] Yuri Kondratiev Fakult¨atf¨urMathematik, Universit¨atBielefeld, 33615 Bielefeld, Germany; e-mail: [email protected] Eugene Lytvynov Department of Mathematics, Swansea University, Singleton Park, Swansea SA2 8PP, U.K.; e-mail: [email protected] Maria Jo~aoOliveira Departamento de Ci^enciase Tecnologia, Universidade Aberta, 1269-001 Lisbon, Por- tugal; CMAF-CIO, University of Lisbon, 1749-016 Lisbon, Portugal; e-mail: [email protected] Abstract The aim of this paper is to develop foundations of umbral calculus on the space D0 of distri- d 0 butions on R , which leads to a general theory of Sheffer polynomial sequences on D . We define a sequence of monic polynomials on D0, a polynomial sequence of binomial type, and a Sheffer sequence. We present equivalent conditions for a sequence of monic polynomials on D0 to be of binomial type or a Sheffer sequence, respectively. We also construct a lift- ing of a sequence of monic polynomials on R of binomial type to a polynomial sequence of 0 0 binomial type on D , and a lifting of a Sheffer sequence on R to a Sheffer sequence on D . Examples of lifted polynomial sequences include the falling and rising factorials on D0, Abel, Hermite, Charlier, and Laguerre polynomials on D0. Some of these polynomials have already appeared in different branches of infinite dimensional (stochastic) analysis and played there a fundamental role. arXiv:1701.04326v2 [math.FA] 5 Mar 2018 Keywords: Generating function; polynomial sequence on D0; polynomial sequence of binomial type on D0; Sheffer sequence on D0; shift-invariance; umbral calculus on D0. 2010 MSC. Primary: 05A40, 46E50. Secondary: 60H40, 60G55. 1 Introduction In its modern form, umbral calculus is a study of shift-invariant linear operators acting on polynomials, their associated polynomial sequences of binomial type, and Sheffer sequences (including Appell sequences). We refer to the seminal papers [29, 38, 39], 1 see also the monographs [24, 37]. Umbral calculus has applications in combinatorics, theory of special functions, approximation theory, probability and statistics, topology, and physics, see e.g. the survey paper [12] for a long list of references. Many extensions of umbral calculus to the case of polynomials of several, or even infinitely many variables were discussed e.g. in [5,10,14,28,32,35,36,41,42], for a longer list of such papers see the introduction to [13]. Appell and Sheffer sequences of poly- nomials of several noncommutative variables arising in the context of free probability, Boolean probability, and conditionally free probability were discussed in [2{4], see also the references therein. The paper [13] was a pioneering (and seemingly unique) work in which elements of basis-free umbral calculus were developed on an infinite dimensional space, more precisely, on a real separable Hilbert space H. This paper discussed, in particular, shift- invariant linear operators acting on the space of polynomials on H, Appell sequences, and examples of polynomial sequences of binomial type. In fact, examples of Sheffer sequences, i.e., polynomial sequences with generating function of a certain exponential type, have appeared in infinite dimensional analysis on numerous occasions. Some of these polynomial sequences are orthogonal with respect to a given probability measure on an infinite dimensional space, while others are related to analytical structures on such spaces. Typically, these polynomials are either defined on a co-nuclear space Φ0 (i.e, the dual of a nuclear space Φ), or on an appropriate subset of Φ0. Furthermore, in majority of examples, the nuclear space Φ consists of (smooth) functions on an underlying space X. For simplicity, we choose to work in this paper with the Gel'fand triple 2 d 0 0 Φ = D ⊂ L (R ; dx) ⊂ D = Φ : Here D is the nuclear space of smooth compactly supported functions on Rd, d 2 N, and D0 is the dual space of D, where the dual pairing between D0 and D is obtained by continuously extending the inner product in L2(Rd; dx). Let us mention several known examples of Sheffer sequences on D0 or its subsets: (i) In infinite dimensional Gaussian analysis, also called white noise analysis, Her- mite polynomial sequences on D0 (or rather on S0 ⊂ D0, the Schwartz space of tempered distributions) appear as polynomials orthogonal with respect to Gaus- sian white noise measure, see e.g. [6,15,16,31]. (ii) Charlier polynomial sequences on the configuration space of counting Radon mea- sures on Rd,Γ ⊂ D0, appear as polynomials orthogonal with respect to Poisson point process on Rd, see [17,19,22]. (iii) Laguerre polynomial sequences on the cone of discrete Radon measures on Rd, K ⊂ D0, appear as polynomials orthogonal with respect to the gamma random measure, see [21,22]. 2 (iv) Meixner polynomial sequences on D0 appear as polynomials orthogonal with re- spect to the Meixner white noise measure, see [25,26]. (v) Special polynomials on the configuration space Γ ⊂ D0 are used to construct the K-transform, see e.g. [7,18,20]. Recall that the K-transform determines the duality between point processes on Rd and their correlation measures. These polynomials will be identified in this paper as the infinite dimensional analog of the falling factorials (a special case of the Newton polynomials). (vi) Polynomial sequences on D0 with generating function of a certain exponential type are used in biorthogonal analysis related to general measures on D0, see [1,23]. Note, however, that even the very notion of a general polynomial sequence on an infinite dimensional space has never been discussed! The classical umbral calculus on the real line gives a general theory of Sheffer sequences and related (umbral) operators. So our aim in this paper is to develop foundations of umbral calculus on the space D0, which will eventually lead to a general theory of Sheffer sequences on D0 and their umbral operators. In fact, at a structural level, many results of this paper will have remarkable similarities to the classical setting of polynomials on R. For example, the form of the generating function of a Sheffer sequence on D0 will be similar to the generating function of a Sheffer sequence on R: the constants appearing in the latter function are replaced in the former function by appropriate linear continuous operators. There is a principal point in our approach that we would like to stress. The paper [13] deals with polynomials on a general Hilbert space H, while the monograph [6] develops Gaussian analysis on a general co-nuclear space Φ0, without the assumption that Φ0 consists of generalized functions on Rd (or on a general underlying space). In fact, we will discuss in Remark 7.5 below that the case of the infinite dimensional Hermite polynomials is, in a sense, exceptional and does not require from the co-nuclear space Φ0 any special structure. In all other cases, the choice Φ0 = D0 is crucial. Having said this, let us note that our ansatz can still be applied to a rather general co-nuclear space of generalized functions over a topological space X, equipped with a reference measure. We also stress that the topological aspects of the spaces D, D0, and their sym- metric tensor powers are crucial for us since all the linear operators (appearing as `coefficients' in our theory) are continuous in the respective topologies. Furthermore, this assumption of continuity is principal and cannot be omitted. The origins of the classical umbral calculus are in combinatorics. So, by analogy, one can think of umbral calculus on D0 as a kind of spatial combinatorics. To give the reader P1 a better feeling of this, let us consider the following example. Let γ = i=1 δxi 2 Γ be a configuration. Here δxi denotes the Dirac measure with mass at xi. We will construct (the kernel of) the falling factorial, denoted by (γ)n, as a function from Γ to 3 D0 n. (Here and below denotes the symmetric tensor product.) This will allow us γ 1 to define `γ choose n' by n := n! (γ)n. And we will get the following explicit formula which supports this term: γ X = δx δx · · · δx ; (1.1) n i1 i2 in fi1;:::;in}⊂N i.e., the sum is obtained by choosing all possible n-point subsets from the (locally finite) set fxigi2N. The latter set can be obviously identified with the configuration γ. The paper is organized as follows. In Section 2 we discuss preliminaries. In partic- 0 ular, we recall the construction of a general Gel'fand triple Φ ⊂ H0 ⊂ Φ , where Φ is a nuclear space and Φ0 is the dual of Φ (a co-nuclear space) with respect to the center 0 0 Hilbert space H0. We consider the space P(Φ ) of polynomials on Φ and equip it with a nuclear space topology. Its dual space, denoted by F(Φ0), has a natural (commutative) algebraic structure with respect to the symmetric tensor product. We also define a family of shift operators, (E(ζ))ζ2Φ0 , and the space of shift-invariant continuous linear operators on P(Φ0), denoted by S(P(Φ0)). In Section 3, we give the definitions of a polynomial sequence on Φ0, a monic polynomial sequence on Φ0, and a monic polynomial sequence on Φ0 of binomial type. Starting from Section 4, we choose the Gel'fand triple as D ⊂ L2(Rd; dx) ⊂ D0. The main result of this section is Theorem 4.1, which gives three equivalent conditions for a monic polynomial sequence to be of binomial type.
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]
  • Odd and Even Lidstone-Type Polynomial Sequences. Part 1: Basic Topics F.A
    Costabile et al. Advances in Difference Equations (2018)2018:299 https://doi.org/10.1186/s13662-018-1733-5 R E S E A R C H Open Access Odd and even Lidstone-type polynomial sequences. Part 1: basic topics F.A. Costabile1,M.I.Gualtieri1,A.Napoli1* and M. Altomare1 *Correspondence: [email protected] Abstract 1Department of Mathematics and Computer Science, University of Two new general classes of polynomial sequences called respectively odd and even Calabria, Rende, Italy Lidstone-type polynomials are considered. These classes include classic Lidstone polynomials of first and second kind. Some characterizations of the two classes are given, including matrix form, conjugate sequences, generating function, recurrence relations, and determinant forms. Some examples are presented and some applications are sketched. MSC: 41A58; 11B83 Keywords: Lidstone polynomials; Polynomial sequences; Infinite matrices 1 Introduction “Je m’occupe, dans ce Memoir, de certains polynômes en x formant une suite A0, A1,..., An,... dont le terme An est un polynôme de degré n et dans laquelle deux termes consécutifs dAn sont liés par la relation dx = nAn–1...”.[9] By paraphrasing Appell [9], we will consider a sequence of polynomials L0, L1,...,Lk, Lk+1,... such that two consecutive terms satisfy the differential relation d2 L (x)=c L (x), c ∈ R, k =1,2,.... (1) dx2 k k k–1 k We call this sequence Lidstone-type polynomial sequence (LPS). Really Lidstone [27] extended an Aitken’s theorem on general linear interpolation [8]to EveretttypeIandEveretttypeIIinterpolatoryformulas[32]. As an example, he considered d2 the dx2 operator and expansions of polynomials of odd and even degree involving two points, which are expressed in terms of a basis of polynomials satisfying (1).
    [Show full text]
  • Relationship of Bell's Polynomial Matrix and K-Fibonacci Matrix
    American Scientific Research Journal for Engineering, Technology, and Sciences (ASRJETS) ISSN (Print) 2313-4410, ISSN (Online) 2313-4402 © Global Society of Scientific Research and Researchers http://asrjetsjournal.org/ Relationship of Bell’s Polynomial Matrix and k-Fibonacci Matrix Mawaddaturrohmaha, Sri Gemawatib* a,bDepartment of Mathematics, University of Riau, Pekanbaru 28293, Indonesia aEmail: [email protected] bEmail: [email protected] Abstract The Bell‟s polynomial matrix is expressed as , where each of its entry represents the Bell‟s polynomial number.This Bell‟s polynomial number functions as an information code of the number of ways in which partitions of a set with certain elements are arranged into several non-empty section blocks. Furthermore, thek- Fibonacci matrix is expressed as , where each of its entry represents the k-Fibonacci number, whose first term is 0, the second term is 1 and the next term depends on a positive integer k. This article aims to find a matrix based on the multiplication of the Bell‟s polynomial matrix and the k-Fibonacci matrix. Then from the relationship between the two matrices the matrix is obtained. The matrix is not commutative from the product of the two matrices, so we get matrix Thus, the matrix , so that the Bell‟s polynomial matrix relationship can be expressed as Keywords: Bell‟s Polynomial Number; Bell‟s Polynomial Matrix; k-Fibonacci Number; k-Fibonacci Matrix. 1. Introduction Bell‟s polynomial numbers are studied by mathematicians since the 19th century and are named after their inventor Eric Temple Bell in 1938[5] Bell‟s polynomial numbers are represented by for each n and kelementsof the natural number, starting from 1 and 1 [2, p 135] Bell‟s polynomial numbers can be formed into Bell‟s polynomial matrix so that each entry of Bell‟s polynomial matrix is Bell‟s polynomial number and is represented by [11].
    [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]
  • Polynomial Sequences Generated by Linear Recurrences
    Innocent Ndikubwayo Polynomial Sequences Generated by Linear Recurrences: Location and Reality of Zeros Polynomial Sequences Generated by Linear Recurrences: Location and Reality of Zeros Linear Recurrences: Location by Sequences Generated Polynomial Innocent Ndikubwayo ISBN 978-91-7911-462-6 Department of Mathematics Doctoral Thesis in Mathematics at Stockholm University, Sweden 2021 Polynomial Sequences Generated by Linear Recurrences: Location and Reality of Zeros Innocent Ndikubwayo Academic dissertation for the Degree of Doctor of Philosophy in Mathematics at Stockholm University to be publicly defended on Friday 14 May 2021 at 15.00 in sal 14 (Gradängsalen), hus 5, Kräftriket, Roslagsvägen 101 and online via Zoom, public link is available at the department website. Abstract In this thesis, we study the problem of location of the zeros of individual polynomials in sequences of polynomials generated by linear recurrence relations. In paper I, we establish the necessary and sufficient conditions that guarantee hyperbolicity of all the polynomials generated by a three-term recurrence of length 2, whose coefficients are arbitrary real polynomials. These zeros are dense on the real intervals of an explicitly defined real semialgebraic curve. Paper II extends Paper I to three-term recurrences of length greater than 2. We prove that there always exist non- hyperbolic polynomial(s) in the generated sequence. We further show that with at most finitely many known exceptions, all the zeros of all the polynomials generated by the recurrence lie and are dense on an explicitly defined real semialgebraic curve which consists of real intervals and non-real segments. The boundary points of this curve form a subset of zero locus of the discriminant of the characteristic polynomial of the recurrence.
    [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]
  • Bell Polynomials and Binomial Type Sequences Miloud Mihoubi
    CORE Metadata, citation and similar papers at core.ac.uk Provided by Elsevier - Publisher Connector Discrete Mathematics 308 (2008) 2450–2459 www.elsevier.com/locate/disc Bell polynomials and binomial type sequences Miloud Mihoubi U.S.T.H.B., Faculty of Mathematics, Operational Research, B.P. 32, El-Alia, 16111, Algiers, Algeria Received 3 March 2007; received in revised form 30 April 2007; accepted 10 May 2007 Available online 25 May 2007 Abstract This paper concerns the study of the Bell polynomials and the binomial type sequences. We mainly establish some relations tied to these important concepts. Furthermore, these obtained results are exploited to deduce some interesting relations concerning the Bell polynomials which enable us to obtain some new identities for the Bell polynomials. Our results are illustrated by some comprehensive examples. © 2007 Elsevier B.V. All rights reserved. Keywords: Bell polynomials; Binomial type sequences; Generating function 1. Introduction The Bell polynomials extensively studied by Bell [3] appear as a standard mathematical tool and arise in combina- torial analysis [12]. Moreover, they have been considered as important combinatorial tools [11] and applied in many different frameworks from, we can particularly quote : the evaluation of some integrals and alterning sums [6,10]; the internal relations for the orthogonal invariants of a positive compact operator [5]; the Blissard problem [12, p. 46]; the Newton sum rules for the zeros of polynomials [9]; the recurrence relations for a class of Freud-type polynomials [4] and many others subjects. This large application of the Bell polynomials gives a motivation to develop this mathematical tool.
    [Show full text]
  • A FAMILY of SEQUENCES of BINOMIAL TYPE 3 and If Jp +1= N Then This Difference Is 0
    A FAMILY OF SEQUENCES OF BINOMIAL TYPE WOJCIECH MLOTKOWSKI, ANNA ROMANOWICZ Abstract. For delta operator aD bDp+1 we find the corresponding polynomial se- − 1 2 quence of binomial type and relations with Fuss numbers. In the case D 2 D we show that the corresponding Bessel-Carlitz polynomials are moments of the− convolu- tion semigroup of inverse Gaussian distributions. We also find probability distributions νt, t> 0, for which yn(t) , the Bessel polynomials at t, is the moment sequence. { } 1. Introduction ∞ A sequence wn(t) n=0 of polynomials is said to be of binomial type (see [10]) if deg w (t)= n and{ for} every n 0 and s, t R we have n ≥ ∈ n n (1.1) w (s + t)= w (s)w − (t). n k k n k Xk=0 A linear operator Q of the form c c c (1.2) Q = 1 D + 2 D2 + 3 D3 + ..., 1! 2! 3! acting on the linear space R[x] of polynomials, is called a delta operator if c1 = 0. Here D denotes the derivative operator: D1 := 0 and Dtn := n tn−1 for n 1. We6 will write Q = g(D), where · ≥ c c c (1.3) g(x)= 1 x + 2 x2 + 3 x3 + .... 1! 2! 3! There is one-to-one correspondence between sequences of binomial type and delta ∞ operators, namely if Q is a delta operator then there is unique sequence w (t) of { n }n=0 binomial type satisfying Qw0(t) = 0 and Qwn(t)= n wn−1(t) for n 1.
    [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]
  • Arxiv:2003.00778V1 [Math.NA] 2 Mar 2020 Rpitsbitdt Elsevier to Submitted Preprint No.SR/WOS-A/PM-20/2018 File Their Vide .Introduction 1
    New wavelet method based on Shifted Lucas polynomials: A tau approach Rakesh Kumar*a, Reena Koundala, K. Srivastavaa aSchool of Mathematics, Computer & Information Sciences, Central University of Himachal Pradesh, Dharamshala, India Abstract In current work, non-familiar shifted Lucas polynomials are introduced. We have constructed a computational wavelet tech- nique for solution of initial/boundaryvalue second order differential equations. For this numerical scheme, we have developed weight function and Rodrigues’ formula for Lucas polynomials. Further, Lucas polynomials and their properties are used to propose shifted Lucas polynomials and then utilization of shifted Lucas polynomials provides us shifted Lucas wavelet. We furnished the operational matrix of differentiation and the product operational matrix of the shifted Lucas wavelets. More- over, convergence and error analysis ensure accuracy of the proposed method. Illustrative examples show that the present method is numerically fruitful, effective and convenient for solving differential equations Keywords: Shifted Lucas wavelet, operational matrices , weight function, Rodrigues’ formula, Tau approach. 1. Introduction The various properties like orthogonality, compact support, arbitrary regularity and high order vanishing moments make the theory of wavelets more powerful. With all of these properties, wavelets have attracted the consideration of every re- searcher due to their applications in wave propagation, pattern recognition, computer graphics and medical image technology [1]. The quality smoothness and better interpolation are manufacturing the wavelets technique based on orthogonal polyno- mials, more friendly to get the solutions of different kinds of differential equations. We can also say that other than numerical arXiv:2003.00778v1 [math.NA] 2 Mar 2020 methods, wavelets theory provide us a new direction for solutions of the differential equations.
    [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]
  • Fitting and Graphing Discrete Distributions
    Chapter 3 Fitting and graphing discrete distributions {ch:discrete} Discrete data often follow various theoretical probability models. Graphic displays are used to visualize goodness of fit, to diagnose an appropriate model, and determine the impact of individual observations on estimated parameters. Not everything that counts can be counted, and not everything that can be counted counts. Albert Einstein Discrete frequency distributions often involve counts of occurrences of events, such as ac- cident fatalities, incidents of terrorism or suicide, words in passages of text, or blood cells with some characteristic. Often interest is focused on how closely such data follow a particular prob- ability distribution, such as the binomial, Poisson, or geometric distribution, which provide the basis for generating mechanisms that might give rise to the data. Understanding and visualizing such distributions in the simplest case of an unstructured sample provides a building block for generalized linear models (Chapter 9) where they serve as one component. The also provide the basis for a variety of recent extensions of regression models for count data (Chapter ?), allow- ing excess counts of zeros (zero-inflated models), left- or right- truncation often encountered in statistical practice. This chapter describes the well-known discrete frequency distributions: the binomial, Pois- son, negative binomial, geometric, and logarithmic series distributions in the simplest case of an unstructured sample. The chapter begins with simple graphical displays (line graphs and bar charts) to view the distributions of empirical data and theoretical frequencies from a specified discrete distribution. It then describes methods for fitting data to a distribution of a given form and simple, effective graphical methods than can be used to visualize goodness of fit, to diagnose an appropriate model (e.g., does a given data set follow the Poisson or negative binomial?) and determine the impact of individual observations on estimated parameters.
    [Show full text]