pith. the verified trust layer for science. sign in

arxiv: 1403.2938 · v2 · pith:AOAHPLOTnew · submitted 2014-03-12 · 🧮 math.CA

Matrix-valued Gegenbauer polynomials

classification 🧮 math.CA
keywords matrix-valuedpolynomialsgegenbaueroperatorsdifferentialmatrixobtainedshift
0
0 comments X p. Extension
Add this Pith Number to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{AOAHPLOT}

Prints a linked pith:AOAHPLOT badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

We introduce matrix-valued weight functions of arbitrary size, which are analogues of the weight function for the Gegenbauer or ultraspherical polynomials for the parameter $\nu>0$. The LDU-decomposition of the weight is explicitly given in terms of Gegenbauer polynomials. We establish a matrix-valued Pearson equation for these matrix weights leading to explicit shift operators relating the weights for parameter $\nu$ and $\nu+1$. The matrix coefficients of the Pearson equation are obtained using a special matrix-valued differential operator in a commutative algebra of symmetric differential operators. The corresponding orthogonal polynomials are the matrix-valued Gegenbauer polynomials which are eigenfunctions for the symmetric matrix-valued differential operators. Using the shift operators we find the squared norm and we establish a simple Rodrigues formula. The three-term recurrence relation is obtained explicitly using the shift operators as well. We give an explicit non-trivial expression for the matrix entries of the matrix-valued Gegenbauer polynomials in terms of scalar-valued Gegenbauer and Racah polynomials using the LDU-decomposition and differential operators. The case $\nu=1$ reduces to the case of matrix-valued Chebyshev polynomials previously obtained using group theoretic considerations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.