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.     

计算Bezout矩阵惯性的一个快速方法及其应用

本文给出了求Bezout矩阵的惯性的一个快速的无除方法,并且由此方法可很快得出一个整系数多项式方程的不同实根个数及不同对共轭复根的对数。     

Roots and polynomials as Homeomorphic spaces

We provide a unified, elementary, topological approach to the classical results stating the continuity of the complex roots of a polynomial with respect to its coefficients, and the continuity of the coefficients with respect to the roots. In fact, endowing the space of monic polynomials of a fixed degree n and the space of n roots with suitable topologies, we are able to formulate the classical theorems in the form of a homeomorphism. Related topological facts are also considered.     

A generalization of the inertia theorem for quadratic matrix polynomials

We show that the inertia of a quadratic matrix polynomial is determined in terms of the inertia of its coefficient matrices if the leading coefficient is Hermitian and nonsingular, the constant term is Hermitian, and the real part of the coefficient matrix of the first degree term is definite. In particular, we prove that the number of zero eigenvalues of such a matrix polynomial is the same as the number of zero eigenvalues of its constant term. We also give some new results for the case where the real part of the coefficient matrix of the first degree term is semidefinite.     

关于Sylvester惯性律的一种变型

借助连续性推证与Hermite矩阵特征值的Courant-Fischer定理给出关于Sylvester惯性律一种变型的简化证明.     

Statistical Inference for Student Diffusion Process

We consider the problem of parameter estimation for an ergodic diffusion with the symmetric scaled Student invariant distribution, where the spectral representation of the transition density is given in terms of the finite number of polynomial eigenfunctions (Routh–Romanovski polynomials) and absolutely continuous spectrum of the negative infinitesimal generator of observed diffusion. We prove the consistency and asymptotic normality of the proposed estimators and, based on the Stein equation for Student diffusion, consider the statistical test for the Student distributional assumptions.     

From symmetric subdivision masks of Hurwitz type to interpolatory subdivision masks

In this paper we present a general strategy to deduce a family of interpolatory masks from a symmetric Hurwitz non-interpolatory one. This brings back to a polynomial equation involving the symbol of the non-interpolatory scheme we start with. The solution of the polynomial equation here proposed, tailored for symmetric Hurwitz subdivision symbols, leads to an efficient procedure for the computation of the coefficients of the corresponding family of interpolatory masks. Several examples of interpolatory masks associated with classical approximating masks are given.     

INERTIA SETS OF SYMMETRIC SIGN PATTERN MATRICES

1　IntroductionIn qualitative and combinatorial matrix theory,we study properties ofa matrix basedon combinatorial information,such as the signs of entries in the matrix.A matrix whoseentries are from the set{ + ,-,0 } is called a sign pattern matrix ( or sign pattern,or pat-tern) .We denote the setof all n× n sign pattern matrices by Qn.For a real matrix B,sgn( B) is the sign pattern matrix obtained by replacing each positive( respectively,negative,zero) entry of B by+ ( respectively,-,0 )…     

确定代数方程根位置的快速无除算法

本文提供了一个确定整系数代数方程在指定区域内根的个数的快速无除算法,此算法的复杂性为O(n²),其中n为方程的次数.为了强凋算法的稳定性,本文均用精确的整数运算.其中多项式是无平方的、首一的.     

Improvement of convergence of an iterative method for finding polynomial factors of analytic functions

In this paper, we consider an iterative method for evaluating the coefficients of a monic factor of an analytic function using complex circular arithmetic. In a previous paper, the authors presented a factoring method that finds a cluster of zeros as a polynomial factor. We analyze the convergence behavior of this method and discuss a technique for improving convergence. Numerical examples illustrate the aspects of the improved method.     

Polynomial root radius optimization with affine constraints

The root radius of a polynomial is the maximum of the moduli of its roots (zeros). We consider the following optimization problem: minimize the root radius over monic polynomials of degree n, with either real or complex coefficients, subject to k linearly independent affine constraints on the coefficients. We show that there always exists an optimal polynomial with at most \(k-1\) inactive roots, that is, roots whose moduli are strictly less than the optimal root radius. We illustrate our results using some examples arising in feedback control.     

Hermitian‐type generalized singular value decomposition with applications

For a pair of given Hermitian matrix A and rectangular matrix B with the same row number, we reformulate a well‐known simultaneous Hermitian‐type generalized singular value decomposition (HGSVD) with more precise structure and parameters and use it to derive some algebraic properties of the linear Hermitian matrix function A?BXB* and Hermitian solution of the matrix equation BXB* = A, and the canonical form of a partitioned Hermitian matrix and some optimization problems on its inertia and rank. Copyright © 2012 John Wiley & Sons, Ltd.     

Polynomial numerical hulls of matrix polynomials,II

In this article, we study some algebraic and geometrical properties of polynomial numerical hulls of matrix polynomials and joint polynomial numerical hulls of a finite family of matrices (possibly the coefficients of a matrix polynomial). Also, we study polynomial numerical hulls of basic A-factor block circulant matrices. These are block companion matrices of particular simple monic matrix polynomials. By studying the polynomial numerical hulls of the Kronecker product of two matrices, we characterize the polynomial numerical hulls of unitary basic A-factor block circulant matrices.     

谱任意的符号模式矩阵

一个n阶符号模式矩阵A称为是谱任意的,如果对任意的实系数n次首1多项式r(x),在A的定性矩阵类Q(A)中至少存在一个实矩阵B,使得B的特征多项式是r(x),文中证明了当n为奇数时n阶谱任意符号模式矩阵是存在的。     

Polynomials with all their roots on <Emphasis Type="Italic">S</Emphasis><Superscript>1</Superscript>

We give a characterization of monic polynomials with coefficients in the ring of integers of a Galois number field having all of their roots on the unit circle. Such a characterization is given in terms of finitely many sums of powers of the roots of the considered polynomials.     

Kronecker's theorem and Lehmer's problem for polynomials in several variables

Mahler defined the measure of a polynomial in several variables to be the geometric mean of the modulus of the polynomial averaged over the torus. The classical theorem of Kronecker which characterizes monic polynomials with integer coefficients all of whose roots are inside the unit disk can be regarded as characterizing those polynomials of one variable whose measure is exactly 1. Here this result is generalized to polynomials in several variables. The method employed also gives easy generalizations of recent results of Schinzel and Dobrowolski on Lehmer's problem.     

On the multiplicity of the eigenvalues of a graph

Given a graph G with characteristic polynomial ϕ(t), we consider the ML-decomposition ϕ(t) = q ₁(t)q ₂(t)² ... q _m (t)^m, where each q _i (t) is an integral polynomial and the roots of ϕ(t) with multiplicity j are exactly the roots of q _j (t). We give an algorithm to construct the polynomials q _i (t) and describe some relations of their coefficients with other combinatorial invariants of G. In particular, we get new bounds for the energy E(G) = |λ_i| of G, where λ₁, λ₂, ..., λ_n are the eigenvalues of G (with multiplicity). Most of the results are proved for the more general situation of a Hermitian matrix whose characteristic polynomial has integral coefficients. This work was done during a visit of the second named author to UNAM.     

平移多项式的判别序列

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

Several variants of the Hermitian and skew‐Hermitian splitting method for a class of complex symmetric linear systems

This paper is concerned with several variants of the Hermitian and skew‐Hermitian splitting iteration method to solve a class of complex symmetric linear systems. Theoretical analysis shows that several Hermitian and skew‐Hermitian splitting based iteration methods are unconditionally convergent. Numerical experiments from an n‐degree‐of‐freedom linear system are reported to illustrate the efficiency of the proposed methods. Copyright © 2014 John Wiley & Sons, Ltd.