Bezout operators for analytic operator functions,I. A general concept of Bezout operator

The notion of a Bezout operator, previously known for some special classes of scalar entire functions and for matrix and operator polynomials, is introduced for general analytic operator functions. Our approach is based on representing the operator functions involved in realized form. Basic properties of Bezout operators are established and known Bezout operators are shown to be specific realizations of our general concept.The work of this author was supported by the United States-Israel Binational Science Foundation Grant 88-00304.     

Structured Low Rank Approximation of a Bezout Matrix

The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given Bezout matrix a new Bezout matrix of lower rank whose entries are near the corresponding entries of that input matrix. We present an algorithm based on a version of structured nonlinear total least squares (SNTLS) method for computing approximate GCD and demonstrate the practical performance of our algorithm on a diverse set of univariate polynomials. The work is partially supported by a National Key Basic Research Project of China 2004CB318000 and Chinese National Science Foundation under Grant 10401035.     

The Bezoutian, state space realizations and Fisher’s information matrix of an ARMA process

In this paper we derive some properties of the Bezout matrix and relate the Fisher information matrix for a stationary ARMA process to the Bezoutian. Some properties are explained via realizations in state space form of the derivatives of the white noise process with respect to the parameters. A factorization of the Fisher information matrix as a product in factors which involve the Bezout matrix of the associated AR and MA polynomials is derived. From this factorization we can characterize singularity of the Fisher information matrix.     

平移多项式的判别序列

研究平移多项式的判别序列的性质,并给出平移多项式的正根判别序列的显式表达式.     

Bezout equations over bivariate polynomial matrices related by an entire function

This study addresses Bezout equations over bivariate polynomial matrices, where the relationship between two variables is described by a real entire function. This paper proposes a solution method that makes optimal use of minor primeness to reduce such Bezout equations to simple equations over univariate scalar polynomials. The proposed solution method requires only matrix calculations, thus making it very useful, especially in the absence of modern computer algebra systems.     

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.     

A heuristic verification of the degree of the approximate GCD of two univariate polynomials

We consider the problem of computing verified real interval perturbations of the coefficients of two univariate polynomials such that there exist corresponding perturbed polynomials which have an exact greatest common divisor (GCD) of a given degree k. Based on the certification of the rank deficiency of a submatrix of the Bezout matrix of two univariate polynomials, we propose an algorithm to compute verified real perturbations. Numerical experiments show the performance of our algorithm.     

Common multiples and common divisors of matrix polynomials, II. Vandermonde and resultant matrices

In this paper explicit formulas are given for least common multiples and greatest common divisors of a finite number of matrix polynomials in terms of the coefficients of the given polynomials. An important role is played by block matrix generalizations of the classical Vandermonde and resultant matrices. Special attention is given to the evaluation of the degrees and other characteristics. Applications to matrix polynomial equations and factorization problems are made.     

The inverse problem for Krein orthogonal matrix functions

In the mid-fifties, in a seminal paper, M. G. Krein introduced continuous analogs of Szeg? orthogonal polynomials on the unit circle and established their main properties. In this paper, we generalize these results and subsequent results that he obtained jointly with Langer to the case of matrix-valued functions. Our main theorems are much more involved than their scalar counterparts. They contain new conditions based on Jordan chains and root functions. The proofs require new techniques based on recent results in the theory of continuous analogs of resultant and Bezout matrices and solutions of certain equations in entire matrix functions.     

An extended version of Schur-Cohn-Fujiwara theorem in stability theory

This paper is concerned with root localization of a complex polynomial with respect to the unit circle in the more general case. The classical Schur-Cohn-Fujiwara theorem converts the inertia problem of a polynomial to that of an appropriate Hermitian matrix under the condition that the associated Bezout matrix is nonsingular. To complete it, we discuss an extended version of the Schur-Cohn-Fujiwara theorem to the singular case of that Bezout matrix. Our method is mainly based on a perturbation technique for a Bezout matrix. As an application of these results and methods, we further obtain an explicit formula for the number of roots of a polynomial located on the upper half part of the unit circle as well.     

Generalized inversion of finite rank Hankel and Toeplitz operators with rational matrix symbols

The goal of the paper is a generalized inversion of finite rank Hankel operators and Hankel or Toeplitz operators with block matrices having finitely many rows. To attain it a left coprime fractional factorization of a strictly proper rational matrix function and the Bezout equation are used. Generalized inverses of these operators and generating functions for the inverses are explicitly constructed in terms of the fractional factorization.     

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.     

ON HERMITE MATRIX POLYNOMIALS AND HERMITE MATRIX FUNCTIONS

In this paper properties of Hermite matrix polynomials and Hermite matrix functions are studied. The concept ot total set with respect to a matrix functional is introduced and the total property of the Hermite matrix polynomials is proved. Asymptotic behaviour of Hermite matrix polynomials is studied and the relationship of Hermite matrix functions with certain matrix differential equations is developed. A new expression of the matrix exponential for a wide class of matrices in terms of Hermite matrix polynomials is proposed.     

A new extension of Hermite matrix polynomials and its applications

In this paper, an extension of the Hermite matrix polynomials is introduced. Some relevant matrix functions appear in terms of the two-variable Hermite matrix polynomials. Furthermore, in order to give qualitative properties of this family of matrix polynomials, the Chebyshev matrix polynomials of the second kind are introduced.     

On the Semiring of Skew Polynomials over a Bezout Semiring

Mathematical Notes - In the paper, we study the semiring of skew polynomials over a Rickart Bezout semiring. Namely, let every left annihilator ideal of a semiring $$S$$ be an ideal. Then the...     

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.     

Zero data and interpolation problems for rectangular matrix polynomials

Zero data of rectangular matrix polynomials are described in various forms. The basic interpolation problem of constructing rectangular matrix polynomials from their zero data is solved. Certain rectangular factorizations are analyzed in terms of spectral data.     

Riemann‐Hilbert problem and matrix discrete Painlevé II systems

Matrix Szeg? biorthogonal polynomials for quasi‐definite matrices of Hölder continuous weights are studied. A Riemann‐Hilbert problem is uniquely solved in terms of the matrix Szeg? polynomials and its Cauchy transforms. The Riemann‐Hilbert problem is given as an appropriate framework for the discussion of the Szeg? matrix and the associated Szeg? recursion relations for the matrix orthogonal polynomials and its Cauchy transforms. Pearson‐type differential systems characterizing the matrix of weights are studied. These are linear systems of ordinary differential equations that are required to have trivial monodromy. Linear ordinary differential equations for the matrix Szeg? polynomials and its Cauchy transforms are derived. It is shown how these Pearson systems lead to nonlinear difference equations for the Verblunsky matrices and two examples, of Fuchsian and non‐Fuchsian type, are considered. For both cases, a new matrix version of the discrete Painlevé II equation for the Verblunsky matrices is found. Reductions of these matrix discrete Painlevé II systems presenting locality are discussed.     

Riemann–Hilbert Problems,Matrix Orthogonal Polynomials and Discrete Matrix Equations with Singularity Confinement

In this paper, matrix orthogonal polynomials in the real line are described in terms of a Riemann–Hilbert problem. This approach provides an easy derivation of discrete equations for the corresponding matrix recursion coefficients. The discrete equation is explicitly derived in the matrix Freud case, associated with matrix quartic potentials. It is shown that, when the initial condition and the measure are simultaneously triangularizable, this matrix discrete equation possesses the singularity confinement property, independently if the solution under consideration is given by the recursion coefficients to quartic Freud matrix orthogonal polynomials or not.