On Some Spectral Characteristics of Multiparameter Polynomial Matrices

Definitions of certain spectral characteristics of polynomial matrices (such as the analytical (algebraic) and geometric multiplicities of a point of the spectrum, deflating subspaces, matrix solvents, and block eigenvalues and eigenvectors) are generalized to the multiparameter case, and properties of these characteristics are analyzed. Bibliogrhaphy: 4 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 309, 2004, pp. 166–173.     

四元数自共轭矩阵的几个定理

In this paper we disscus semi - positive definite self-conjugate matrices on quaternion. The following theorem is proved;Suppose A, B are both semi-positive difinite self-conjugate matrices of order n on quaternion. Then( 1 ) there exists P∈GL_n(Q), such that(?).(2) AB and BA are both the centralizable matrices and they are similar to same a real diagonal matrix.     

State-Space Minimal Realizations and Latent Structures of Column-Reduced and Nonsingular Polynomial Matrices

The concept of a column-reduced polynomial matrix is an importantone in the theory of linear systems. The theory of Jordan chainsand minimal realizations is developed for such matrices. Also,the relationships between generalized latent vectors of thenonsingular polynomial matrix and their associated generalizedeigenvectors of the system map are explored in this paper. Thispermits the spectral analysis of an arbitrary nonsingular polynomialmatrix, extending previous work for the monic case.     

正定自共轭四元数矩阵的均值

本文引进了两个正定自共轭四元数矩阵的算术均值，几何均值，调和均值三概念，给出了正定自共轭四元数矩阵的算术－几何－调和均值不等式，得到了正定自共轭四元数矩阵的几何均值的一个最大性质及其相关的某些性质．     

关于四元数矩阵乘积迹的不等式

设 H~(m×n)为 m×n 四元数矩阵的集合,σ_1(A)≥…≥σ_n(A)为 A∈H~(mxn)的奇异值。本文证明了:1)设 A∈H~(mxm),B∈H~(mxm),r=min(m,m),则|tr(4B)|≤c r σ_i(A)σ_i(B).2)设 A_i∈H~(mxm),i=1,2,…,n,(A_1A_2…A_n)k为 A_1A_2…A_n 的任一个 k 阶主子阵,则|tr(A_1.A_2…A_n)_k|≤sun form i=1 to k σ_i(A_1)…σ_i(A_n).我们还得到四元数矩阵迹的其它一些不等式。这些结果推广和改进了文[1],[2]中的结果,进一步解决了 Bellman 猜想。     

The Maximal and Minimal Ranks of Some Expressions of Generalized Inverses of Matrices

In this paper, we first determine the maximal and minimal ranks of A — BXC with respect to X. Using those results, we then find the maximal and minimal ranks of the expressions AA^– — A^– A — BB^– A — AC^– C and B^– BA — ACC^– with respect to the choice of generalized inverses A^–, B^– and C^–. In particular, we consider the commutativity of A and A^–, A^k and A^–.The research of the author was supported in part by the Natural Sciences and Engineering Research Council of Canada.     

The Polynomial Method for Random Matrices

We define a class of “algebraic” random matrices. These are random matrices for which the Stieltjes transform of the limiting eigenvalue distribution function is algebraic, i.e., it satisfies a (bivariate) polynomial equation. The Wigner and Wishart matrices whose limiting eigenvalue distributions are given by the semicircle law and the Marčenko–Pastur law are special cases. Algebraicity of a random matrix sequence is shown to act as a certificate of the computability of the limiting eigenvalue density function. The limiting moments of algebraic random matrix sequences, when they exist, are shown to satisfy a finite depth linear recursion so that they may often be efficiently enumerated in closed form. In this article, we develop the mathematics of the polynomial method which allows us to describe the class of algebraic matrices by its generators and map the constructive approach we employ when proving algebraicity into a software implementation that is available for download in the form of the RMTool random matrix “calculator” package. Our characterization of the closure of algebraic probability distributions under free additive and multiplicative convolution operations allows us to simultaneously establish a framework for computational (noncommutative) “free probability” theory. We hope that the tools developed allow researchers to finally harness the power of infinite random matrix theory.     

四元数自共轭矩阵与行列式的几个定理

本文继续使用文献[1],[2],[3],[4],[5]的符号和术语。对四元数体Q上的自共轭矩阵与行列式进行讨论得到几个重要定理。为此,先作几点说明。 2.设A为四元数体Q上的一个n阶矩阵,若A=(即,A=a_(ij),a_(ij)∈Q。恒有a_(ij)=a_(ji))。则说A是四元数体Q上的一个自共轭矩阵。自共轭四元矩阵A的行列式记为‖A‖。     

关于四元数矩阵之迹的几个定理

R.Rellman对两个正定实矩阵建立了与Cauchy—Schwarz不等式相类似的结果,引起人们的关注,对Rellman不等式进行深入的研究.但对四元数矩阵之迹的研究至今未见.如所熟知,四元数体的非交换性,已经给四元数代数理论的研究带来了巨大的困难,它也必然影响到四元数矩阵迹的性质.事实上,关于实(或复)矩阵的几个简单性质:     

四元数矩阵的特征值与奇异值估计

In this paper, we give accurate estimation of eigenvalues and singular values of A + B,C^*AC and AB, where A, B and C are quaternions matrices. These results improve and generalze the results in [4] and [5]. We also obtainsum (?),for k=1,…,n. Where A and B are self-conjugate quaternions matrices of order n, and λ₁≥…≥λ_n,μ₁≥μ_n,λ₁,(A + B)≥…≥λ_n(A+B) be the eigenvalues of A,B and A + B, respectively.     

多项式矩阵代数性质讨论

本文利用系统与控制论中有关多项式矩阵的结果,对多项式矩阵代数性质进行讨论,得到的主要结果有多项式方阵环是主理想环,也是主单侧理想环。     

Minimal Frame Operator Norms Via Minimal Theta Functions

We investigate sharp frame bounds of Gabor frames with chirped Gaussians and rectangular lattices or, equivalently, the case of the standard Gaussian and general lattices. We prove that for even redundancy and standard Gaussian window the hexagonal lattice minimizes the upper frame bound using a result by Montgomery on minimal theta functions.     

Solving Systems of Linear Equations with Normal Coefficient Matrices and the Degree of the Minimal Polyanalytic Polynomial

The generalized Lanczos process applied to a normal matrix A builds up a condensed form of A, which can be described as a band matrix with slowly growing bandwidth. For certain classes of normal matrices, the bandwidth turns out to be constant. It is shown that, in such cases, the bandwidth is determined by the degree of the minimal polyanalytic polynomial of A. It was in relation to the generalized Lanczos process thatM.Huhtanen introduced the concept of the minimal polyanalytic polynomial of a normal matrix.     

Vector Majorization Via Hessenberg Matrices

In this paper it is proved that, for real n-vectors x and y,x is majorized by y if and only if x = PHQy for some permutationmatrices P, Q, and for some doubly stochastic matrix H whichis a direct sum of doubly stochastic Hessenberg matrices. Thisresult reveals that any n-vector which is majorized by a vectory can be expressed as a convex combination of at most (n² –n + 2)/2 permutations of y.     

矩阵多项式的平方根矩阵

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

Biorthogonal Polynomial Bases and Vandermonde-like Matrices

This article considers a family of Gram matrices of pairs of bases of a finite dimensional vector space of polynomials with respect to certain indefinite inner products. Such a family includes all the generalized confluent Vandermonde matrices relative to any polynomial basis, like the Chebyshev-Vandermonde matrices, for example. Using the biorthogonality of pairs of bases with respect to a divided difference functional, properties of matrices and functionals, as well as interpolation formulas are obtained. I show that the computation of the inverse of a Vandermonde-like matrix is essentially equivalent to the computation of the partial fractions decompositions of a set of rational functions with a common denominator. I also explain why the various Chebyshev-Vandermonde matrices are the simplest generalizations of the classic Vandermonde matrices and describe a simple algorithm for the computation of their inverses, which requires a number of multiplications of the order of 3N².     

Matroid Matching Via Mixed Skew-Symmetric Matrices

Tutte associates a V by V skew-symmetric matrix T, having indeterminate entries, with a graph G=(V,E). This matrix, called the Tutte matrix, has rank exactly twice the size of a maximum cardinality matching of G. Thus, to find the size of a maximum matching it suffices to compute the rank of T. We consider the more general problem of computing the rank of T + K where K is a real V by V skew-symmetric matrix. This modest generalization of the matching problem contains the linear matroid matching problem and, more generally, the linear delta-matroid parity problem. We present a tight upper bound on the rank of T + K by decomposing T + K into a sum of matrices whose ranks are easy to compute.Part of this research was done while the authors visited the Fields Institute in Toronto, Canada. The research was partially supported by a grant from the Natural Sciences and Engineering Research Council of Canada.     

内积模环中元的最小多项式

讨论形式复体上模环中元的最小多项式,得出A^1-δArA δ,1^(rA) … A^rAArA δ,rA δ^(rA)=0。其中A为模环中任一元,而rA与ArA δ,k（rA）都可用计算A的方幂、模环上内积和方阵行列式一意求得。     

两个四元数自共轭半正定矩阵乘积的特征估计

设A和B均非0的n阶实四元数自共轭矩阵,λ_i及μ_i分别为共特征值(i=1,…,n),且规定|λ₁|≥|λ₂|≥…≥|λ_n|,|μ₁|≥|μ₂|≥…≥|μ_n|,又λ为AB之任意特征值,则λ为实数,且(1)若A≥0,A(?)GL_n(Q),B≥0,B GL_n(Q),则λ≤λ₁μ₁;(2)若A>0或B>0,则|λ|≤|λ₁μ₁|,特别当A>0且B>0时有λ≤λ₁μ₁;(3)若A>0,B∈GL_n(Q),或B>0,A∈GL_n(Q)则|λ|≥|λ_nμ_n|,特别当A>0且B>0时有λ≥λ_nμ_n。