正定矩阵标准型的复合矩阵的一般形式

实对称正定矩阵的复合矩阵正定性的研究已有结论,但对于一般意义下的正定矩阵的复合矩阵是否仍然是正定的研究需要利用一般的正定矩阵的标准形的复合矩阵进行讨论,给出了一般公式及具体算法,为讨论其复合矩阵的正定性提供了基础条件.     

Oppenheim不等式的一种类似

证明了实对称正定矩阵或实对称半正定矩阵与 M-矩阵的 Hadamard乘积满足实对称正定矩阵 Hadamard乘积的 Oppenheim不等式 .     

Some properties of the positive real matrix

In this paper, some properties of the rational positive real matrix are discussed by means of coprime fraction of a rational matrix. Some equivalent conditions which are natural extension of the rational positive real function, are given for testing a rational positive real matrix.     

论四元数矩阵的正定性

本文给出了正定四元数矩阵的定义，同时给出了正定四元数矩阵的一个充要条件，一个必要条件，一个充分条件．     

Complementarity forms of theorems of Lyapunov and Stein, and related results

The well-known Lyapunov's theorem in matrix theory / continuous dynamical systems asserts that a (complex) square matrix A is positive stable (i.e., all eigenvalues lie in the open right-half plane) if and only if there exists a positive definite matrix X such that AX+XA^* is positive definite. In this paper, we prove a complementarity form of this theorem: A is positive stable if and only if for any Hermitian matrix Q, there exists a positive semidefinite matrix X such that AX+XA^*+Q is positive semidefinite and X[AX+XA^*+Q]=0. By considering cone complementarity problems corresponding to linear transformations of the form I−S, we show that a (complex) matrix A has all eigenvalues in the open unit disk of the complex plane if and only if for every Hermitian matrix Q, there exists a positive semidefinite matrix X such that X−AXA^*+Q is positive semidefinite and X[X−AXA^*+Q]=0. By specializing Q (to −I), we deduce the well known Stein's theorem in discrete linear dynamical systems: A has all eigenvalues in the open unit disk if and only if there exists a positive definite matrix X such that X−AXA^* is positive definite.     

关于正定厄米特矩阵的Schur补的迹和特征值的不等式

本文研究了正定厄米特矩阵Schur补的迹和特征值的性质,通过一个不等式的证明,得到了正定厄米特矩阵和的Schur补与正定厄米特矩阵Schur补的和的迹和特征值之间的不等式.     

实正定矩阵的复合矩阵的正定性

本文讨论了实正定矩阵的复合矩阵的正定性，并且给出了实正定矩阵的复合矩阵仍为正定矩阵的一个充要条件.     

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.     

Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming

Let G=(V,E) be a graph. In matrix completion theory, it is known that the following two conditions are equivalent: (i) G is a chordal graph; (ii) Every G-partial positive semidefinite matrix has a positive semidefinite matrix completion. In this paper, we relate these two conditions to constraint nondegeneracy condition in semidefinite programming and prove that they are each equivalent to (iii) For any G-partial positive definite matrix that has a positive semidefinite completion, constraint nondegeneracy is satisfied at each of its positive semidefinite matrix completions.     

Conditions for the positivity of determinants

Consider a matrix with positive diagonal entries, which is similar via a positive diagonal matrix to a symmetric matrix, and whose signed directed graph has the property that if a cycle and its symmetrically placed complement have the same sign, then they are both positive. We provide sufficient conditions so that A be a P-matrix, that is , a matrix whose principal minors are all positive. We further provide sufficiet conditions for an arbitrary matrix A whose (undirected) graph is subordinate to a tree, to be a P-matrix. If, in additionA is sign symmetric and its undirected graph is a tree, we obtain necessary and sufficient conditions that it be a P-matrix. We go on to consider the positive semi-definiteness of symmetric matrices whose graphs are subordinate to a given tree and discuss the convexity of the set of all such matrices.     

Lattice-Ordered Matrix Rings Over the Integers

We show that the only compatible lattice order on a matrix ring over the integers for which the identity matrix is positive is (up to isomorphism) the usual, entrywise, lattice order. We also find a condition that guarantees that the only compatible lattice order on a matrix ring over the integers is formed by multiplying the positive cone of the usual, entrywise, lattice order by a matrix with positive entries. Using this condition, we show that such orders are the only compatible ones in the two-by-two case.     

Characterization of symmetric M-matrices as resistive inverses

We aim here at characterizing those nonnegative matrices whose inverse is an irreducible Stieltjes matrix. Specifically, we prove that any irreducible Stieltjes matrix is a resistive inverse. To do this we consider the network defined by the off-diagonal entries of the matrix and we identify the matrix with a positive definite Schrödinger operator whose ground state is determined by the lowest eigenvalue of the matrix and the corresponding positive eigenvector. We also analyze the case in which the operator is positive semidefinite which corresponds to the study of singular irreducible symmetric M-matrices.     

关于实方阵的几个问题

本文讨论如下内容：１．把有关对称正定（半正定）的一些性质推广到广义正定（半正定）。２．给定ｘ∈Ｒｍ×ｍ，∧为对角阵，求ＡＸ＝ｘ∧在对称半正定矩阵类中解存在的充要条件及一般形式，并讨论了对任意给定的对称正定（半正定）矩阵Ａ，在上述解的集合中求得Ａ，使得     

一类正定复矩阵的谱特征

本文给出了一类正定复矩阵的特征值的分布，同时建立了稳定矩阵与正定矩阵之间的内在联系，确立了稳定矩阵的若干判定方法。     

套汇问题研究

把套汇问题转化为网络规划中找负回路问题,用F loyd算法解决了套汇问题.讨论了避免套汇兑换率矩阵必须是正互反矩阵的结论,以及给出了兑换率矩阵调整为正互反矩阵的方法.     

Bidiagonalization of oscillatory matrices

We prove that an oscillatory matrix is similar to a bidiagonal nonnegative matrix by means of a totally positive matrix of change of basis. New characterizations of oscillatory and nonsingular totally positive matrices in terms of similarity are provided.     

On the best approximation matrix problem and matrix Fourier series

In this paper the concept of positive definite bilinear matrix moment functional, acting on the space of all the matrix valued continuous functions defined on a bounded interval [a,b] is introduced. The best approximation matrix problem with respect to such a functional is solved in terms of matrix Fourier series. Basic properties of matrix Fourier series such as the Riemann—Lebesgue, matrix property and the bessel—parseval matrix inequality are proved. The concept of total set with respect to a positive definite matrix functional is introduced, and the totallity of an orthonormal sequence of matrix polynomials with respect to the functional is established.     

Szasz不等式在亚正定矩阵和拟广义正定矩阵上的推广

实对称正定矩阵的Szasz不等式是Hadamard不等式的加细;本文将Szasz不等式推广到一类亚正定矩阵和拟广义正定矩阵上去,从而推广了关于实对称正定矩阵的Szasz不等式和Hadamard不等式.     

(N,1)-广义正定矩阵

本文对被屠伯埙称为亚正定的矩阵类进行了推广,即给出了(n,1)-广义正定矩阵的概念,进而得到了(n,1)-广义正定矩阵的一系列性质,最后将关于正定阵的Hadamard乘积的Schur定理及华罗庚定理推广到(n,1)-广义正定矩阵.     

ON HERMITIAN POSITIVE DEFINITE SOLUTION OF NONLINEAR MATRIX EQUATION X＋A^＊X^-2A=Q

Based on the fixed-point theory, we study the existence and the uniqueness of the maximal Hermitian positive definite solution of the nonlinear matrix equation X＋A^＊X^-2A=Q, where Q is a square Hermitian positive definite matrix and A＊ is the conjugate transpose of the matrix A. We also demonstrate some essential properties and analyze the sensitivity of this solution. In addition, we derive computable error bounds about the approximations to the maximal Hermitian positive definite solution of the nonlinear matrix equation X＋A^＊X^-2A=Q. At last, we further generalize these results to the nonlinear matrix equation X＋A^＊X^-nA=Q, where n≥2 is a given positive integer.