scholarly journals Recurrence Relations for Orthogonal Polynomials and Algebraicity of Solutions of the Dirichlet Problem

2009 ◽  
pp. 219-228 ◽  
Author(s):  
Dmitry Khavinson ◽  
Nikos Stylianopoulos
Keyword(s):  
Dirichlet Problem ◽  
Orthogonal Polynomials ◽  
Recurrence Relations

Orthogonal polynomials: applications and computation

Acta Numerica ◽  
1996 ◽  
Vol 5 ◽  
pp. 45-119 ◽  
Author(s):  
Walter Gautschi
Keyword(s):  
Numerical Methods ◽  
Weight Function ◽  
Orthogonal Polynomials ◽  
Rational Function ◽  
Recurrence Relations ◽  
Recurrence Coefficients ◽  
Basic Task ◽  
Sobolev Orthogonal Polynomials ◽  
Gauss Type ◽  
Three Term Recurrence Relation

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.

Matrix Valued Orthogonal Polynomials on the Unit Circle: Some Extensions of the Classical Theory

2009 ◽  
Vol 52 (1) ◽  
pp. 95-104 ◽  
Author(s):  
L. Miranian
Keyword(s):  
Orthogonal Polynomials ◽  
Unit Circle ◽  
Classical Theory ◽  
Recurrence Relations ◽  
Matrix Representation ◽  
The Matrix ◽  
Classical Subject ◽  
First Time

AbstractIn the work presented below the classical subject of orthogonal polynomials on the unit circle is discussed in the matrix setting. An explicit matrix representation of the matrix valued orthogonal polynomials in terms of the moments of the measure is presented. Classical recurrence relations are revisited using the matrix representation of the polynomials. The matrix expressions for the kernel polynomials and the Christoffel–Darboux formulas are presented for the first time.

scholarly journals Bounds for zeros of Meixner and Kravchuk polynomials

2014 ◽  
Vol 17 (1) ◽  
pp. 47-57 ◽  
Author(s):  
A. Jooste ◽  
K. Jordaan
Keyword(s):  
Orthogonal Polynomials ◽  
Recurrence Relations ◽  
Discrete Orthogonal ◽  
Bounds For Zeros ◽  
Set Of Points ◽  
Kravchuk Polynomials

AbstractThe zeros of certain different sequences of orthogonal polynomials interlace in a well-defined way. The study of this phenomenon and the conditions under which it holds lead to a set of points that can be applied as bounds for the extreme zeros of the polynomials. We consider different sequences of the discrete orthogonal Meixner and Kravchuk polynomials and use mixed three-term recurrence relations, satisfied by the polynomials under consideration, to identify bounds for the extreme zeros of Meixner and Kravchuk polynomials.

Sign in / Sign up

Export Citation Format

Share Document