Discrete Painlev equations for recurrence coefficients of orthogonal polynomials

Add to your list(s) Download to your calendar using vCal

• van Assche, W (Katholieke Universiteit Leuven)
• Friday 03 July 2009, 10:00-11:00
• Seminar Room 1, Newton Institute.

If you have a question about this talk, please contact Mustapha Amrani.

This talk has been canceled/deleted

All classical orthogonal polynomials in the Askey table (and its q-extension) are orthogonal with respect to a weight w that satisfies a first order differential, (divided) difference or q-difference equation with polynomial coefficients of degree one and less than or equal to two respectively (Pearson equation). Their recurrence coefficients coefficients can be found using this Pearson equation by solving a first order difference equation. Semi-classical weights satisfy a Pearson equation with polynomial coefficients of higher degree. The recurrence coefficients then satisfy higher order difference equations. Many examples have been worked out and we will present some of the semi-classical weights that give rise to discrete Painlev equations for the recurrence coefficients of the orthogonal polynomials. This is joint work with my student Lies Boelen.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.