scholarly journals Strong asymptotics of the recurrence coefficients of orthogonal polynomials associated to the generalized Jacobi weight

2003 ◽  
Vol 125 (2) ◽  
pp. 198-237 ◽  
Author(s):  
M. Vanlessen
2015 ◽  
Vol 92 (3) ◽  
pp. 709-713
Author(s):  
A. I. Aptekarev ◽  
G. López Lagomasino ◽  
A. Martínez-Finkelshtein

2017 ◽  
Vol 06 (01) ◽  
pp. 1750003
Author(s):  
Shulin Lyu ◽  
Yang Chen

We consider the generalized Jacobi weight [Formula: see text], [Formula: see text]. As is shown in [D. Dai and L. Zhang, Painlevé VI and Henkel determinants for the generalized Jocobi weight, J. Phys. A: Math. Theor. 43 (2010), Article ID:055207, 14pp.], the corresponding Hankel determinant is the [Formula: see text]-function of a particular Painlevé VI. We present all the possible asymptotic expansions of the solution of the Painlevé VI equation near [Formula: see text] and [Formula: see text] for generic [Formula: see text]. For four special cases of [Formula: see text] which are related to the dimension of the Hankel determinant, we can find the exceptional solutions of the Painlevé VI equation according to the results of [A. Eremenko, A. Gabrielov and A. Hinkkanen, Exceptional solutions to the Painlevé VI equation, preprint (2016), arXiv:1602.04694 ], and thus give another characterization of the Hankel determinant.


Acta Numerica ◽  
1996 ◽  
Vol 5 ◽  
pp. 45-119 ◽  
Author(s):  
Walter Gautschi

We give examples of problem areas in interpolation, approximation, and quadrature, that call for orthogonal polynomials not of the classical kind. We then discuss numerical methods of computing the respective Gauss-type quadrature rules and orthogonal polynomials. The basic task is to compute the coefficients in the three-term recurrence relation for the orthogonal polynomials. This can be done by methods relying either on moment information or on discretization procedures. The effect on the recurrence coefficients of multiplying the weight function by a rational function is also discussed. Similar methods are applicable to computing Sobolev orthogonal polynomials, although their recurrence relations are more complicated. The paper concludes with a brief account of available software.


2006 ◽  
Vol 139 (1-2) ◽  
pp. 346-370 ◽  
Author(s):  
A.I. Aptekarev ◽  
V. Kalyagin ◽  
G. López Lagomasino ◽  
I.A. Rocha

Sign in / Sign up

Export Citation Format

Share Document