The Bezoutian and the algebraic Riccati equation

The classical Bezoutian is a square matrix which counts the common zeros of two polynomials in the complex plane. The usual proofs of this property are based on connections between the Bezoutian and the Sylvester resultant matrix. These proofs do not make transparent the nature of the Bezoutian as a finite dimensional operator. This paper establishes that the Bezoutian is a solution of a suitable operator Riccati equation which makes evident the connections between the Bezoutian as an operator and the common zeros of polynomials. One application to the inversion of block Hankel (Toeplitz) matrices is given. Brief discussions of other Bezoutian operators are included. Apparently, even in the classical case the connection between the Bezoutian and the Riccati equation has not been studied previously.     

Bezoutian矩阵的一致逼近形式

借助闭区间上的连续函数可以用Bernstein 多项式一致逼近这一事实,将多项式对所生成的经典Bezoutian 矩阵和Bernstein Bezoutian 矩阵推广到C [0,1]上函数对所对应的情形,给出了 Bezoutian 矩阵一致逼近形式的定义,并且得到如下结论：给出了经典 Bezoutian 矩阵的 Barnett 型分解公式和三角分解公式的一致逼近形式;提供了经典Bezoutian 矩阵和Bernstein Bezoutian 矩阵的一致逼近形式的两类算法;得到了上述两种矩阵的一致逼近形式中元素间的两个恒等关系式。最后,利用数值实例对恒等关系式进行验证,结果表明两类算法是有效的。     

Inertia theorems for matrix polynomials

The Lyapunov method for determining the inertia of a matrix in terms of inertia of solutions of a certain linear matrix equation is extended to matrix polynomials.Generalization of well-known inertia theorems are obtained using the recently developed concept of Bezoutian for several matrix polynomials.     

Bezoutian and Schur-Cohn problem for operator polynomials

A generalized Bezout operator (Bezoutian) for a pair of operator polynomials is introduced and its kernel is described in terms of common spectral data of the underlying polynomials. The location of the spectrum of an operator polynomial with compact spectrum with respect to the unit circle (infinite-dimensional version of the Schur-Cohn problem) is expressed via the inertia of a suitable Bezoutian. An application to the geometric dichotomy problem for difference equations with operator coefficients is given as well.     

Generalized polynomial Bezoutian with respect to a Jacobson chain basis over an arbitrary field

We introduce a so-called generalized polynomial Bezoutian with respect to a Jacobson chain basis over an arbitrary field. Some characterization of this kind of matrix, such as the Barnett-type factorization and the intertwining relation with generalized hypercompanion matrix, are obtained. The diagonal reduction formula via the generalized confluent Vandermonde matrix similar to that of classical Bezoutian is presented. The method used is based on polynomial module and operator representation.     

Lyapunov,Bézout,and Hankel

Given a polynomial f of degree n, we denote by C its companion matrix, and by S the truncated shift operator of order n. We consider Lyapunov-type equations of the form X?SXC=>W and X?CXS=W. We derive some properties of these equations which make it possible to characterize Bezoutian matrices as solutions of the first equation with suitable right-hand sides W (similarly for Hankel and the second equation) and to write down explicit expressions for these solutions. This yields explicit factorization formulae for polynomials in C, for the Schur-Cohn matrix, and for matrices satisfying certain intertwining relations, as well as for Bezoutian matrices.     

Second order partial differential equations for gradients of orthogonal polynomials in two variables

In this work, we introduce the classical orthogonal polynomials in two variables as the solutions of a matrix second order partial differential equation involving matrix polynomial coefficients, the usual gradient operator, and the divergence operator. Here we show that the successive gradients of these polynomials also satisfy a matrix second order partial differential equation closely related to the first one.     

Electrostatic models for zeros of polynomials: Old,new, and some open problems

We give a survey concerning both very classical and recent results on the electrostatic interpretation of the zeros of some well-known families of polynomials, and the interplay between these models and the asymptotic distribution of their zeros when the degree of the polynomials tends to infinity. The leading role is played by the differential equation satisfied by these polynomials. Some new developments, applications and open problems are presented.     

Generalized Bezoutian and the inversion problem for block matrices,I. General scheme

The unified approach to the matrix inversion problem initiated in this work is based on the concept of the generalized Bezoutian for several matrix polynomials introduced earlier by the authors. The inverse X^–1 of a given block matrix X is shown to generate a set of matrix polynomials satisfying certain conditions and such that X^–1 coincides with the Bezoutian associated with that set. Thus the inversion of X is reduced to determining the underlying set of polynomials. This approach provides a fruitful tool for obtaining new results as well as an adequate interpretation of the known ones.     

Bezoutians and projections

With each polynomial p of degree n whose roots lie inside the unit disc we may associate the n-dimensional space of all solutions of the recurrence relation whose coefficients are those of p (considered as a subspace of 1²). The main result consists in establishing a close relation between the Bezoutian of two such polynomials (of the same degree) and the projection operator onto one of the corresponding spaces along the complement of the other. The note forms a loose continuation of the author's investigations of the infinite companion matrix—the generating function of the infinite companion matrix of a polynomial p appears thus as a particular case; the corresponding Bezoutian is that of the pair p and zⁿ.     

Random block matrices generalizing the classical Jacobi and Laguerre ensembles

In this paper we consider random block matrices which generalize the classical Laguerre ensemble and the Jacobi ensemble. We show that the random eigenvalues of the matrices can be uniformly approximated by the zeros of matrix orthogonal polynomials and obtain a rate for the maximum difference between the eigenvalues and the zeros. This relation between the random block matrices and matrix orthogonal polynomials allows a derivation of the asymptotic spectral distribution of the matrices.     

Delta算子Riccati方程研究的新结果

基于Delta算子描述，统一研究连续时间代数Riccati方程(CARE)和离散时间代数Riccati方程(DARE)的定界估计问题，提出了统一代数Riccati方程(UARE)解矩阵的上下界，给出UARE中P与R和Q的几个基本关系．     

Matrix-theoretical derivations of some results of Borcea–Shapiro on hyperbolic polynomials

We use matrix analysis to give simple proofs of two theorems of Borcea–Shapiro which yield majorization relations between certain hyperbolic polynomials. We also prove a conjecture of Borcea involving majorization and the zeros of polynomials. To cite this article: R. Pereira, C. R. Acad. Sci. Paris, Ser. I 341 (2005).     

Error analysis of signal zeros from a related companion matrix eigenvalue problem

An error analysis of the so-called signal zeros of polynomials linked to exponentially damped signals is performed and error bounds are derived. The analysis uses the link between polynomials and companion matrices and allows us to show that the related companion matrix eigenvalue problem is governed by the condition number of a rectangular Vandermonde matrix which has the zeros of interest as nodes. Conditions under which the zeros are well conditioned are discussed.     

Minimal Nonsquare <Emphasis Type="Italic">J</Emphasis>-Spectral Factorization,Generalized Bezoutians and Common Zeros for Rational Matrix Functions

The problem that we solve in this paper is to find (square or nonsquare) minimal J-spectral factors of a rational matrix function with constant signature. Explicit formulas for these J-spectral factors are given in terms of a solution of a particular algebraic Riccati equation. Also, we discuss the common zero structure of rational matrix functions that arise from the analysis of nonsquare J-spectral factors. This zero structure is obtained in terms of the kernel of a generalized Bezoutian.     

Matrix orthogonal polynomials whose derivatives are also orthogonal

In this paper we prove some characterizations of the matrix orthogonal polynomials whose derivatives are also orthogonal, which generalize other known ones in the scalar case. In particular, we prove that the corresponding orthogonality matrix functional is characterized by a Pearson-type equation with two matrix polynomials of degree not greater than 2 and 1. The proofs are given for a general sequence of matrix orthogonal polynomials, not necessarily associated with a hermitian functional. We give several examples of non-diagonalizable positive definite weight matrices satisfying a Pearson-type equation, which show that the previous results are non-trivial even in the positive definite case.A detailed analysis is made for the class of matrix functionals which satisfy a Pearson-type equation whose polynomial of degree not greater than 2 is scalar. We characterize the Pearson-type equations of this kind that yield a sequence of matrix orthogonal polynomials, and we prove that these matrix orthogonal polynomials satisfy a second order differential equation even in the non-hermitian case. Finally, we prove and improve a conjecture of Durán and Grünbaum concerning the triviality of this class in the positive definite case, while some examples show the non-triviality for hermitian functionals which are not positive definite.     

Zeros of a family of hypergeometric para‐orthogonal polynomials on the unit circle

Para‐orthogonal polynomials derived from orthogonal polynomials on the unit circle are known to have all their zeros on the unit circle. In this note we study the zeros of a family of hypergeometric para‐orthogonal polynomials. As tools to study these polynomials, we obtain new results which can be considered as extensions of certain classical results associated with three term recurrence relations and differential equations satisfied by orthogonal polynomials on the real line. One of these results which might be considered as an extension of the classical Sturm comparison theorem, enables us to obtain monotonicity with respect to the parameters for the zeros of these para‐orthogonal polynomials. Finally, a monotonicity of the zeros of Meixner‐Pollaczek polynomials is proved.     

Relatively prime polynomials and nonsingular Hankel matrices over finite fields

The probability for two monic polynomials of a positive degree n with coefficients in the finite field Fq to be relatively prime turns out to be identical with the probability for an n×n Hankel matrix over Fq to be nonsingular. Motivated by this, we give an explicit map from pairs of coprime polynomials to nonsingular Hankel matrices that explains this connection. A basic tool used here is the classical notion of Bezoutian of two polynomials. Moreover, we give simpler and direct proofs of the general formulae for the number of m-tuples of relatively prime polynomials over Fq of given degrees and for the number of n×n Hankel matrices over Fq of a given rank.     

Majorization and multiplier sequences

We present applications of matrix methods to the analytic theory of polynomials. We first show how matrix analysis can be used to give new proofs of a number of classical results on roots of polynomials. Then we use matrix methods to establish a new log-majorization result on roots of polynomials. The theory of multiplier sequences gives the common link between the applications.     

Unification of Stieltjes‐Calogero type relations for the zeros of classical orthogonal polynomials

The classical orthogonal polynomials (COPs) satisfy a second‐order differential equation of the form σ(x)y^′′+τ(x)y^′+λy = 0, which is called the equation of hypergeometric type (EHT). It is shown that two numerical methods provide equivalent schemes for the discrete representation of the EHT. Thus, they lead to the same matrix eigenvalue problem. In both cases, explicit closed‐form expressions for the matrix elements have been derived in terms only of the zeros of the COPs. On using the equality of the entries of the resulting matrices in the two discretizations, unified identities related to the zeros of the COPs are then introduced. Hence, most of the formulas in the literature known for the roots of Hermite, Laguerre and Jacobi polynomials are recovered as the particular cases of our more general and unified relationships. Furthermore, we present some novel results that were not reported previously. Copyright © 2014 John Wiley & Sons, Ltd.