The spectral connection matrix for classical real orthogonal polynomials

Sets of orthogonal polynomials are bases for polynomial spaces Pn. As a result, polynomials can be expressed in coefficients relative to a particular family of orthogonal polynomials. The connection problem refers to the task of converting from coefficients in one of these bases to coefficients in another. The entries of the matrix that applies such a change of basis, known as the connection coefficients, are well-known values that can be computed via direct computation or matrix inversion; however this can be computationally expensive. Thus their accurate and efficient computation is a relevant topic of research in numerical linear algebra, and can be found in the current literature. The two manuscripts included in this thesis address the connection problem. In the first manuscript, a connection within the classical real orthogonal polynomials of a single parameter (Hermite, Laguerre,and Gegenbauer) is discussed. The spectral connection matrix related to a connection matrix is defined. It is also shown that this spectral connection matrix in each case within the singleparameter classical families is quasiseparable, with specific generators provided. Additionally this manuscript proposes an algorithm that efficiently computes the desired connection matrix given the generators of its corresponding spectral connection matrix. The second manuscript dramatically generalizes the result of the first. It addresses the structure of the spectral connection matrix associated with a much broader group of connections. The target family is allowed to be any of the classical types, including Jacobi. The source family is allowed to be any of the classical types or Bessel, which is not considered classical here. In these cases it is shown that once again the spectral connection matrix is quasiseparable, and specific generators are provided. The algorithm from the first manuscript allows for the efficient computation of the desired connection matrix given the generators of the associated spectral connection matrix. The appendix at the conclusion provides some details for the reader’s reference. It begins with a review of orthogonal polynomials, and highlights the classical types. It then provides a review of some basic linear algebra concepts that are relevant to the manuscripts, and concludes with a survey of quasiseparable matrices. The appendix also references research activity in the field.

[1]  D. Tritton A first course in fluid dynamics , 1984 .

[2]  A. W. Kemp,et al.  A treatise on generating functions , 1984 .

[3]  R. Askey Orthogonal Polynomials and Special Functions , 1975 .

[4]  Mourad E. H. Ismail,et al.  Theory and Applications of Special Functions , 2005 .

[5]  T. Bella,et al.  The spectral connection matrix for classical orthogonal polynomials of a single parameter , 2014 .

[6]  Linearization and connection coefficients of orthogonal polynomials , 1992 .

[7]  P. Dewilde,et al.  Time-Varying Systems and Computations , 1998 .

[8]  M. Voit Central limit theorems for random walks on N 0 that are associated with orthogonal polynomials , 1990 .

[9]  Pascal Maroni,et al.  Connection coefficients for orthogonal polynomials: symbolic computations, verifications and demonstrations in the Mathematica language , 2012, Numerical Algorithms.

[10]  R. Askey Orthogonal expansions with positive coefficients , 1965 .

[11]  I. Areaa,et al.  Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Continuous case] , 2003 .

[12]  Ryszard Szwarc Connection Coefficients of Orthogonal Polynomials , 1992, Canadian Mathematical Bulletin.

[13]  T. MacRobert Higher Transcendental Functions , 1955, Nature.

[14]  W. Gautschi Orthogonal polynomials: applications and computation , 1996, Acta Numerica.

[15]  Israel Gohberg,et al.  Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations , 2005 .

[16]  Mark Tygert,et al.  Fast Algorithms for Spherical Harmonic Expansions , 2006, SIAM J. Sci. Comput..

[17]  Pascal Maroni,et al.  Connection coefficients between orthogonal polynomials and the canonical sequence: an approach based on symbolic computation , 2008, Numerical Algorithms.

[18]  Stanisław Lewanowicz,et al.  Quick construction of recurrence relations for the Jacobi coefficients , 1992 .

[19]  Jens Keiner,et al.  Computing with Expansions in Gegenbauer Polynomials , 2009, SIAM J. Sci. Comput..

[20]  Ryszard Szwarc CONNECTION COEFFICIENTS OF ORTHOGONAL POLYNOMIALS WITH APPLICATIONS TO CLASSICAL ORTHOGONAL POLYNOMIALS , 1993 .

[21]  Yan V. Fyodorov Recent Perspectives in Random Matrix Theory and Number Theory: Introduction to the random matrix theory: Gaussian Unitary Ensemble and beyond , 2005 .

[22]  Victor Y. Pan,et al.  Fast evaluation and interpolation at the Chebyshev sets of points , 1989 .

[23]  JENS KEINER,et al.  Gegenbauer polynomials and semiseparable matrices. , 2008 .

[24]  I. Gohberg,et al.  A modification of the Dewilde-van der Veen method for inversion of finite structured matrices , 2002 .

[25]  A. V. D. Veen,et al.  Inner-outer factorization and the inversion of locally finite systems of equations , 2000 .

[26]  Bradley K. Alpert,et al.  A Fast Algorithm for the Evaluation of Legendre Expansions , 1991, SIAM J. Sci. Comput..

[27]  Victor Y. Pan,et al.  Polynomial and Rational Evaluation and Interpolation (with Structured Matrices) , 1999, ICALP.

[28]  S. Bochner,et al.  Über Sturm-Liouvillesche Polynomsysteme , 1929 .

[29]  Eduardo Godoy,et al.  Recurrence relations for connection coefficients between two families of orthogonal polynomials , 1995 .

[30]  James B. Seaborn,et al.  Hypergeometric Functions and Their Applications , 1991 .

[31]  A. Erdélyi,et al.  Higher Transcendental Functions , 1954 .

[32]  Alle-Jan van der Veen,et al.  Fast Stable Solver for Sequentially Semi-separable Linear Systems of Equations , 2002, HiPC.

[33]  Israel Gohberg,et al.  Computations with quasiseparable polynomials and matrices , 2008, Theor. Comput. Sci..

[34]  Victor Y. Pan,et al.  A unified superfast algorithm for boundary rational tangential interpolation problems and for inversion and factorization of dense structured matrices , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[35]  Nicholas J. Higham,et al.  Fast Solution of Vandermonde-Like Systems Involving Orthogonal Polynomials , 1988 .

[36]  I. Gohberg,et al.  On a new class of structured matrices , 1999 .

[37]  Iván Area,et al.  Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: discrete case , 1997 .

[38]  The generalized Bochner condition about classical orthogonal polynomials revisited , 2006 .