On sieved orthogonal polynomials. IX: Orthogonality on the unit circle (Q1207873): Difference between revisions

The process of sieving a sequence of orthogonal polynomials consists of constructing orthogonal polynomials by means of a recurrence relation in which the recurrence coefficients are all constant except for the subsequence of indices which are a multiple of \(k\) and this sequence is given by an a priori given sequence of recurrence coefficients. This construction was originally worked out on the interval \([-1,1]\) for ultraspherical polynomials by \textit{W. Al-Salam}, \textit{W. R. Allaway} and \textit{R. Askey} [Trans. Am. Math. Soc. 284, 39-55 (1984; Zbl 0547.33005)]. Later Ismail found various other new systems of orthogonal polynomials on the real line using the sieving process. Here the sieving is done for orthogonal polynomials on the unit circle, in which case the recurrence coefficients are the so called reflection coefficients. A similar approach has also been given (for the quadratic and cubic case) by \textit{F. Marcellán} and \textit{G. Sansigre} [in `Orthogonal polynomials and their applications', IMACS Ann. Comput. Appl. Math. 9, 341-345 (1991)].