The goal of this thesis is to study the nearest neighbor recurrence rela tions for multiple orthogonal polynomials, which are a generalization of the concept of orthogonal polynomials. They satisfy higher order recurr ence relations. Most of the people work with the so-called step-line rec urrence relation, however it is not necessarily the most natural one cou ld consider. It is also one of the objectives of the thesis to convince the reader that the nearest neighbor recurrence relations are the more i nteresting object in this context. We believe that many important properties of orthogonal polynomials can be generalized using the nearest neighbor recurrence relation as the pro per analog of the three term recurrence relation. As an exam...
AbstractWe present a simple approach in order to compute recursively the connection coefficients bet...
AbstractIn this paper we investigate general properties of the coefficients in the recurrence relati...
In this paper a new presentation of orthogonal polynomials is given. It is based on the introduction...
The goal of this thesis is to study the nearest neighbor recurrence rela tions for multiple orthogon...
Multiple orthogonal polynomials satisfy a number of recurrence relations, in particular there is a (...
Multiple orthogonal polynomials satisfy a number of recurrence relations, in particular there is a (...
An alternate proof of the Christoffel-Darboux recurrence formula for consecutive orthogonal polynomi...
Ordinary orthogonal polynomials are uniquely characterized by the three term recurrence relations up...
AbstractIt is well known that the zeros of orthogonal polynomials interlace. In this paper we study ...
25 pages, no figures.-- MSC1991 codes: primary 42C05, 33C25; secondary 41A21.-- Dedicated to Barry S...
25 pages, no figures.-- MSC1991 codes: primary 42C05, 33C25; secondary 41A21.-- Dedicated to Barry S...
We give the asymptotic behavior of the ratio of two neighboring multiple orthogonal polynomials unde...
In this paper the recurrence relations of symmetric orthogonal polynomials whose measures are relate...
AbstractWe present a simple approach in order to compute recursively the connection coefficients bet...
Recurrence relations for multiple orthogonal polynomials of classical weights by
AbstractWe present a simple approach in order to compute recursively the connection coefficients bet...
AbstractIn this paper we investigate general properties of the coefficients in the recurrence relati...
In this paper a new presentation of orthogonal polynomials is given. It is based on the introduction...
The goal of this thesis is to study the nearest neighbor recurrence rela tions for multiple orthogon...
Multiple orthogonal polynomials satisfy a number of recurrence relations, in particular there is a (...
Multiple orthogonal polynomials satisfy a number of recurrence relations, in particular there is a (...
An alternate proof of the Christoffel-Darboux recurrence formula for consecutive orthogonal polynomi...
Ordinary orthogonal polynomials are uniquely characterized by the three term recurrence relations up...
AbstractIt is well known that the zeros of orthogonal polynomials interlace. In this paper we study ...
25 pages, no figures.-- MSC1991 codes: primary 42C05, 33C25; secondary 41A21.-- Dedicated to Barry S...
25 pages, no figures.-- MSC1991 codes: primary 42C05, 33C25; secondary 41A21.-- Dedicated to Barry S...
We give the asymptotic behavior of the ratio of two neighboring multiple orthogonal polynomials unde...
In this paper the recurrence relations of symmetric orthogonal polynomials whose measures are relate...
AbstractWe present a simple approach in order to compute recursively the connection coefficients bet...
Recurrence relations for multiple orthogonal polynomials of classical weights by
AbstractWe present a simple approach in order to compute recursively the connection coefficients bet...
AbstractIn this paper we investigate general properties of the coefficients in the recurrence relati...
In this paper a new presentation of orthogonal polynomials is given. It is based on the introduction...