Bezoutian矩阵的一致逼近形式

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

构造一般Dixon 结式矩阵的快速算法

近几年来, 基于Dixon 结式的消去法被广泛地用来求解非线性多项式方程组, 因此国际上许多学者开始研究构造Dixon 结式矩阵的有效算法. 本文将目前最为有效的只能处理2个变元3个方程情形的递归算法扩展到n个变元n+1个多项式方程的一般情形, 并且将该算法在Maple下编程实现. 通过Maple随机产生的多项式的比较实验, 可以看出, 比之现有的所有方法, 本程序具有更高的效率. 特别是应用此程序, 首次以48阶的Dixon结式矩阵的形式, 给出了4个一般的关于每个变元的次数不超过2次的曲面存在公共交点的必要条件.     

多项式判别矩阵的若干性质及其应用

具有文字系数的多项式f(x)，其判别矩阵是f与f′的Sylvester矩阵通过添加一行一列而得，已经知道，判别矩阵的偶数阶主子式的符号确定了f(x)的相异根(实根、复根)的数目，这里介绍如何将奇数阶与偶数阶主子式相结合用以判定该多项式的相异负根或正根的数目，并进一步判定其在区间上的实根数，本文还研究了与判别矩阵相关的一些实用性质，并应用这些性质给出了4次键合多项式不能正分解的一组简洁的充分必要条件。     

多项式基相关矩阵的关系

通过定义多项式空间上的线性算子,研究与多项式基相关的联合矩阵的关系,得到了它们之间的相似关系式.     

关于与给定矩阵可交换的矩阵的多项式表示

文[1]得到：若矩阵A的Jordan标准形中没有纯量矩阵的Jordan块,那么AB=BA的充要条件为B可以化为A的n-1次多项式.本文指出这个结论是错误的.在已有相关文献的基础上,得到了与给定矩阵A可交换的矩阵B是A的多项式的十个等价刻划.     

矩阵多项式的逆矩阵的求法

给出了矩阵多项式的逆矩阵的一般求法.     

矩阵多项式的平方根矩阵

研究了矩阵多项式的开平方问题,给出了矩阵多项式能开平方的充分必要条件及其平方根矩阵的个数,包含并推广了文[1]中的主要结论.     

矩阵多项式可逆性的判定

给出了矩阵多项式可逆判定的两个构造性的定理,其方法优于文[1]。     

关于矩阵多项式的逆矩阵求法的一个注记

给出了矩阵多项式逆矩阵的一些充要条件和一种求法.     

矩阵多项式空间的进一步研究

设A为数域F上的n级矩阵,记F[A]={f(A)|f(x)∈F[x]},它显然是F~(n×n)的子空间.讨论了F[A]的基和维数,引入了f(A)的坐标和F[A]的因式子空间的概念,给出了用因式子空间表示F[A]的几个定理,刻画了F[A]的结构.     

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.     

The Bezoutian and the eigenvalue-separation problem for matrix polynomials

A generalized Bezout matrix for a pair of matrix polynomials is studied and, in particular, the structure of its kernel is described and the relations to the greatest common divisor of the given matrix polynomials are presented. The classical root-separation problems of Hermite, Routh-Hurwitz and Schur-Cohn are solved for matrix polynomials in terms of this Bezout matrix. The eigenvalue-separation results are also expressed in terms of Hankel matrices whose entries are Markov parameters of rational matrix function. Some applications of Jacobi's method to these problems are pointed out.     

Relative asymptotics for orthogonal matrix polynomials with respect to a perturbed matrix measure on the unit circle

Given a positive definite matrix measure Ω supported on the unit circle T, then main purpose of this paper is to study the asymptotic behavior of Ln(Ω)Ln(Ω)-1 and Φn(z;Ω)Φn(z;Ω)-1 where Ω(z) = Ω(z) + zδ(z - w); |w| ＞ 1,M is a positive definite matrix and δ is the Dirac matrix measure. Here, Ln ( @ ) means the leading coefficient of the orthonormal matrix polynomials Φn(z; @ ).Finally, we deduce the asymptotic behavior of Φn (w;Ω)Φn (w;Ω) * in the case when M=I.     

ORTHOGONAL MATRIX POLYNOMIALS WITH RESPECT TO A CONJUGATE BILINEAR MATRIX MOMENT FUNCTIONAL: BASIC THEORY

In this paper basic results for a theory of orthogonal matrix polynomials with respect to a conjugate bilinear matrix moment functional are proposed. Properties of orthogonal matrix polynomial sequences including a three term matrix relationship are given. Positive definite conjugate bilinear matrix moment functionals are introduced and a characterization of positive definiteness in terms of a block Haenkel moment matrix is established. For each positive definite conjugate bilinear matrix moment functional an associated matrix inner product is defined.     

Polynomials with respect to a general basis. I. Theory

As n × n Hessenberg matrix A is defined whose characteristic polynomial is relative to an arbitrary basis. This generalizes the companion, colleague, and comrade matrices when the bases are, respectively, power, Chebyshev, and orthogonal, so the term “confederate” matrix is suggested. Some properties of A are derived, including an algorithm for computing powers of A. A scheme is given for inverting the transformation matrix between the arbitrary and power bases. A Vandermonde-type matrix associated with A and a block confederate matrix are defined.     

Orthogonal matrix polynomials with respect to linear matrix moment functionals: Theory and applications

In this paper orthogonal matrix polynomials with respect to a right matrix moment functional are introduced. Basic results, important examples and applications to the approximation of matrix integrals are studied. Error bounds for the proposed matrix quadrature rules are given.     

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.     

On polynomials hypoelliptic with respect to a group of variables

For a class of polynomials a necessary and sufficient condition is found for those polynomials to be hypoelliptic with respect to a group of variables.