THE KRALL POLYNOMIALS: A NEW CLASS OF ORTHOGONAL POLYNOMIALS

Abstract

A new set of orthogonal polynomials is found that are solutions to a sixth order formally self adjoint differential equation. These polynomials are shown to generalize the Legendre and Legendre type polynomials. We also show that these polynomials satisfy many properties shared by the classical orthogonal polynomials of Jacobi, Laguerre and Hermite.     

Orthogonal polynomials and higher order singular Sturm-Liouville systems

In addition to the classic orthogonal polynomials which satisfy second order differential equations, there are a number of orthogonal polynomials which satisfy differential equations of orders four or six. Like the classic sets, they have distributional weight functions, are the eigenfunctions for certain self-adjoint boundary-value problems, and sometimes are involved with indefinite boundary-value problems.The purpose of this survey is to summarize the work of the last decade and to exhibit the state of the art as it now stands. Of particular interest is the development of the theory of singular Sturm-Liouville systems, which is so necessary in order to describe the boundary-value problems associated with these polynomials.     

Some remarks on a paper by L. Carlitz

We study a family of orthogonal polynomials which generalizes a sequence of polynomials considered by L. Carlitz. We show that they are a special case of the Sheffer polynomials and point out some interesting connections with certain Sobolev orthogonal polynomials.     

On the orthogonality of residual polynomials\newline of minimax polynomial preconditioning

Summary. This paper studies polynomials used in polynomial preconditioning for solving linear systems of equations. Optimum preconditioning polynomials are obtained by solving some constrained minimax approximation problems. The resulting residual polynomials are referred to as the de Boor-Rice and Grcar polynomials. It will be shown in this paper that the de Boor-Rice and Grcar polynomials are orthogonal polynomials over several intervals. More specifically, each de Boor-Rice or Grcar polynomial belongs to an orthogonal family, but the orthogonal family varies with the polynomial. This orthogonality property is important, because it enables one to generate the minimax preconditioning polynomials by three-term recursive relations. Some results on the convergence properties of certain preconditioning polynomials are also presented. Received February 1, 1992/Revised version received July 7, 1993     

A new presentation of orthogonal polynomials with applications to their computation

In this paper a new presentation of orthogonal polynomials is given. It is based on the introduction of two auxiliary sequences of arbitrary monic polynomials and it leads to a very simple derivation of the usual determinantal formulae for orthogonal polynomials and of their recurrence relations either in the definite or in the indefinite case. New expressions for the coefficients of these recurrence relations are obtained and they are compared to the usual ones from the point of view of their numerical stability. The qd-algorithm is also recovered very easily.     

On higher order Padé-type approximants with some prescribed coefficients in the numerator

In this work, we consider the construction of higher order rational approximants to a formal power series, with some prescribed coefficients in their numerators, precisely those of the higher order powers. The denominators of such approximants are related to the so-called Sobolev-type orthogonal polynomials. The elementary properties of these orthogonal polynomials are studied in the regular case.This research was partially supported by Junta de Andalucía, Grupo de Investigación 1107.     

From Asymptotics to Spectral Measures: Determinate Versus Indeterminate Moment Problems

In the field of orthogonal polynomials theory, the classical Markov theorem shows that for determinate moment problems the spectral measure is under control of the polynomials asymptotics. The situation is completely different for indeterminate moment problems, in which case the interesting spectral measures are to be constructed using Nevanlinna parametrization. Nevertheless it is interesting to observe that some spectral measures can still be obtained from weaker forms of the Markov theorem. The exposition will be illustrated by orthogonal polynomials related to elliptic functions: in the determinate case by examples due to Stieltjes and some of their generalizations and in the indeterminate case by more recent examples.     

Sequences of orthogonal Laurent polynomials,bi-orthogonality and quadrature formulas on the unit circle

In this paper, the construction of orthogonal bases in the space of Laurent polynomials on the unit circle is considered. As an application, a connection with the so-called bi-orthogonal systems of trigonometric polynomials is established and quadrature formulas on the unit circle based on Laurent polynomials are studied.     

Ramanujan continued fractions via orthogonal polynomials

Some Ramanujan continued fractions are evaluated using asymptotics of polynomials orthogonal with respect to measures with absolutely continuous components.     

Noncommutative biorthogonal polynomials

We define and study biorthogonal sequences of polynomials over noncommutative rings, generalizing previous treatments of biorthogonal polynomials over commutative rings and of orthogonal polynomials over noncommutative rings. We extend known recurrence relations for specific cases of biorthogonal polynomials and prove a general version of Favard?s theorem.     

Riemann-Hilbert problem associated with Angelesco systems

Angelesco systems of measures with Jacobi-type weights are considered. For such systems, strong asymptotics for the related multiple orthogonal polynomials are found as well as the Szeg?-type functions. In the procedure, an approach from the Riemann-Hilbert problem plays a fundamental role.     

On the inversion of certain moment matrices

An explicit representation of the elements of the inverses of certain patterned matrices involving the moments of nonnegative weight functions is derived in this paper. It is shown that a sequence of monic orthogonal polynomials can be generated from a given weight function in terms of Hankel-type determinants and that the corresponding matrix inverse can be expressed in terms of their associated coefficients and orthogonality factors. This result enables one to obtain an explicit representation of a certain type of approximants which apply to a wide class of positive continuous functions. Convenient expressions for the coefficients of standard classical orthogonal polynomials such as Legendre, Jacobi, Laguerre and Hermite polynomials are also provided. Several examples illustrate the results.     

Sensitivity analysis for Szegő polynomials

Szegő polynomials are orthogonal with respect to an inner product on the unit circle. Numerical methods for weighted least-squares approximation by trigonometric polynomials conveniently can be derived and expressed with the aid of Szegő polynomials. This paper discusses the conditioning of several mappings involving Szegő polynomials and, thereby, sheds light on the sensitivity of some approximation problems involving trigonometric polynomials. This Research supported in part by NSF grant DMS-0107858.     

Rectangular matrix Padé approximants and square matrix orthogonal polynomials

In this paper we study Padé-type and Padé approximants for rectangular matrix formal power series, as well as the formal orthogonal polynomials which are a consequence of the definition of these matrix Padé approximants. Recurrence relations are given along a diagonal or two adjacent diagonals of the table of orthogonal polynomials and their adjacent ones. A matrix qd-algorithm is deduced from these relations. Recurrence relations are also proved for the associated polynomials. Finally a short presentation of right matrix Padé approximants gives a link between the degrees of orthogonal polynomials in right and left matrix Padé approximants in order to show that the latter are identical. This revised version was published online in June 2006 with corrections to the Cover Date.     

On Koornwinder classical orthogonal polynomials in two variables

In 1975, Tom Koornwinder studied examples of two variable analogues of the Jacobi polynomials in two variables. Those orthogonal polynomials are eigenfunctions of two commuting and algebraically independent partial differential operators. Some of these examples are well known classical orthogonal polynomials in two variables, such as orthogonal polynomials on the unit ball, on the simplex or the tensor product of Jacobi polynomials in one variable, but the remaining cases are not considered classical by other authors. The definition of classical orthogonal polynomials considered in this work provides a different perspective on the subject. We analyze in detail Koornwinder polynomials and using the Koornwinder tools, new examples of orthogonal polynomials in two variables are given.     

Parameter-based Fisher's information of orthogonal polynomials

The Fisher information of the classical orthogonal polynomials with respect to a parameter is introduced, its interest justified and its explicit expression for the Jacobi, Laguerre, Gegenbauer and Grosjean polynomials found.     

A class of bivariate orthogonal polynomials and cubature formula

Summary. The existence of Gaussian cubature for a given measure depends on whether the corresponding multivariate orthogonal polynomials have enough common zeros. We examine a class of orthogonal polynomials of two variables generated from that of one variable. Received February 9, 1993 / Revised version received January 18, 1994     

On the orthogonal polynomials in several variables

We study the connection between orthogonal polynomials in several variables and families of commuting symmetric operators of a special form.     

Is the recurrence relation for orthogonal polynomials always stable?

Attention is drawn to a phenomenon of pseudostability in connection with the three-term recurrence relation for discrete orthogonal polynomials. The computational implications of this phenomenon are illustrated in the case of discrete Legendre and Krawtchouk polynomials. The phenomenon also helps to explain a form of instability in Stieltjes's procedure for generating recursion coefficients of discrete orthogonal polynomials.Work supported in part by the National Science Foundation under grant DMS-9023403.     

Upward Extension of the Jacobi Matrix for Orthogonal Polynomials

Orthogonal polynomials on the real line always satisfy a three-term recurrence relation. The recurrence coefficients determine a tridiagonal semi-infinite matrix (Jacobi matrix) which uniquely characterizes the orthogonal polynomials. We investigate new orthogonal polynomials by adding to the Jacobi matrixrnew rows and columns, so that the original Jacobi matrix is shifted downward. Thernew rows and columns contain 2rnew parameters and the newly obtained orthogonal polynomials thus correspond to an upward extension of the Jacobi matrix. We give an explicit expression of the new orthogonal polynomials in terms of the original orthogonal polynomials, their associated polynomials, and the 2rnew parameters, and we give a fourth order differential equation for these new polynomials when the original orthogonal polynomials are classical. Furthermore we show how the 1?orthogonalizing measure for these new orthogonal polynomials can be obtained and work out the details for a one-parameter family of Jacobi polynomials for which the associated polynomials are again Jacobi polynomials.