对“关于复正定矩阵行列式的不等式”一文的注记

本文指出文 [1 ]中的错误 ,并把文 [1 ]中关于复正定矩阵与正定 Hermite矩阵的行列式不等式推广到较为广泛的复矩阵类     

流形上矩阵方程AX=B的正定及半正定阵的反问题

文[1-5]中研究了对称、对称半正定及流形上的对称半正定的反问题,并说明了其应用背景.本文研究线性流形上的正定及半正定阵的反问题,说明了文[1-3]中的一些结果为本文的特例.     

Hermite正定矩阵迹的几个重要不等式

本文研究了Hermite正定矩阵迹的不等式问题.利用文献[1、2]的部分结果和矩阵恒等变形的方法,得到了关于Hermite正定矩阵迹的几个重要不等式,推广了文献[5、6]的结果     

亚正定阵理论(Ⅱ)

本文继续[Ⅰ]的讨论,建立了亚正定阵的行列式理论。给出了许多新的结果:例如广义Minkowski不等式、广义凸性不等式等等,对某些种类的亚正定阵,还将关于任意阵的行列式的Hadamard不等式作了改进。最后,将Open-heim关于正定阵的Hadamavd乘积的著名结果推广到亚正定阵上。     

限制特征值λ_i∈[α,β]的线性方程Ax=b的一类反问题的解存在的条件

在关于线性方程Ax=b的反问题的研究中,文[1]、[2]、[3]解决了反问题在对称正定阵、三对角对称正定阵、三对角对称M阵以及三对角不可约对角占优Stieltjes阵类中,解A的存在性的条件和A的通解表达式。本文把它们的结果推广到全部特征值λ_i∈     

子空间上的对称正定及对称半正定阵的左右特征值反问题

文[1][2][3]中讨论AX＝B的对称阵逆特征值问题，文[4][5][6]中讨论了半正定阵的逆特征值问题。本文讨论了空间了子空间上的对称正定及对称半正定阵的左右特征值反问题，给出了解存在的充分条件及解的表达式。     

关于《亚正定阵理论(Ⅱ)》一文的错误

设A∈R~n×n,如果R(A)(?)A A’/2为正定矩阵,则称A为亚正定矩阵.文[1]、[2]研究了亚正定矩阵,得出了一些新的结果.这里指出,文[2]中有些疏漏和错误.取(?),则A为亚正定矩阵,B为正定矩阵,容易验证文[2]中定理2和定理5的结论均不成立.其原因在于原文定理证明中错误地运用了Holder第二不等式.要使结论成立,两个定理均需附加条件“亚正定矩阵A的特征值都是实数”.     

TOR方法的收敛性

匡蛟勋在[1]中提出了解大线性系统的双参数松驰法——TOR 方法,并讨论了系数矩阵为 Hermitian 正定及 L 矩阵时,TOR 方法的收敛性。曾文平 [2]中又讨论了系数矩阵是正定对称矩阵、H—矩阵、L—矩阵及弱对角占优不可约矩阵时,TOR 方法的收敛性。本文讨论系数矩阵是正定矩阵、广义正定矩阵、N—稳定矩阵时,TOR 方法的收敛性。拓广了文[1]、[2]的结果。     

正定矩阵的子式阵仍是正定矩阵的一个充要条件

文[2]证明了实对称正定矩阵的子式阵仍然是实对称正定矩阵,文[3]给出了一般的正定矩阵的的概念,本文利用标准型给出了一般正定矩阵的子式阵仍然是正定矩阵的充要条件.     

Z[-5]上不可分的Hermite型

本文讨论了Z[-5]上不可分的正定Hermite型的构作.给出了所有秩为2判别式等于2的不可分的正定Hermite型.当秩n≥3时,证明了存在Z[-5]上判别式等于2的不可分的正定Hermite型,并给出了它们的明显结构.     

The Metapositive Definite Self－Conjugate Solution of the Matrix Equation AXB＝C over a Skew Field

ＴｈｅＭｅｔａｐｏｓｉｔｉｖｅＤｅｆｉｎｉｔｅＳｅｌｆ－ＣｏｎｊｕｇａｔｅＳｏｌｕｔｉｏｎｏｆｔｈｅＭａｔｒｉｘＥｑｕａｔｉｏｎＡＸＢ＝Ｃｏｖｅｒ　ａ　Ｓｋｅｗ　ＦｉｅｌｄＷａｎｇＱｉｎｇｗｅｎ（王卿文）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈ．，Ｃｈａｎ...     

四元数体上的Marshall-Olkin不等式及改进

本文证明了四元数自共轭半正定矩阵乘积的一些不等式.这些结果推广、改进了复数域上的Marshall-Olkin不等式.     

体上特征矩阵的简化形式与法式存在定理

谢邦杰在文献[2]—[5]中,研究了体上特征矩阵的简化形式与法式。本文在文献[1]的基础上,采用不同于[2]的方法,定义体上特征矩阵的另一种简化形式。对于我们所定义的简化形式,得到体上特征矩阵具有绝对唯一的简化形式,即法式存在的充分必要条件是矩阵满足中心化条件,从而使更广的一类特征矩阵存在法式。此外,我们还将[5]中体上矩阵的Caylcy-Hamilton定理再一次推广。     

Upper bound and stability of scaled pseudoinverses

Summary. For given matrices and where is positive definite diagonal, a weighed pseudoinverse of is defined by and an oblique projection of is defined by . When is of full column rank, Stewart [3] and O'Leary [2] found sharp upper bound of oblique projections which is independent of , and an upper bound of weighed pseudoinverse by using the bound of . In this paper we discuss the sharp upper bound of over a set of positive diagonal matrices which does not depend on the upper bound of , and the stability of over . Received September 29, 1993 / Revised version received October 31, 1994     

The realization of positive definite matrices via planar networks and mixing-type sub-cluster algebras

As an improvement of the combinatorial realization of totally positive matrices via the essential positive weightings of certain planar network by S.Fomin and A.Zelevinsky [7], in this paper,we give a test method of positive definite matrices via the planar networks and the so-called mixing-type sub-cluster algebras respectively,introduced here originally.This work firstly gives a combinatorial realization of all matrices through planar network,and then sets up a test method for positive definite matrices by LDU-decompositions and the horizontal weightings of all lines in their planar networks.On the other hand,mainly the relationship is built between positive definite matrices and mixing-type sub-cluster algebras.     

复正定矩阵的张量积

本文给出了多个复正定矩阵的张量积仍为复正定矩阵的充要条件,推广了文[2]的主要结果.     

Stopping criteria for the Ando-Li-Mathias and Bini-Meini-Poloni geometric means

We provide an upper bound for the number of iterations necessary to achieve a desired level of accuracy for the Ando-Li-Mathias [Linear Algebra Appl. 385 (2004) 305-334] and Bini-Meini-Poloni [Math. Comput. 79 (2010) 437-452] symmetrization procedures for computing the geometric mean of n positive definite matrices, where accuracy is measured by the spectral norm and the Thompson metric on the convex cone of positive definite matrices. It is shown that the upper bound for the number of iterations depends only on the diameter of the set of n matrices and the desired convergence tolerance. A striking result is that the upper bound decreases as n increases on any bounded region of positive definite matrices.     

Some properties of complex matrix-variate generalized Dirichlet integrals

Dirichlet integrals and the associated Dirichlet statistical densities are widely used in various areas. Generalizations of Dirichlet integrals and Dirichlet models to matrix-variate cases, when the matrices are real symmetric positive definite or hermitian positive definite, are available [4]. Real scalar variables case of the Dirichlet models are generalized in various directions. One such generalization of the type-2 or inverted Dirichlet is looked into in this article. Matrix-variate analogue, when the matrices are hermitian positive definite, are worked out along with some properties which are mathematically and statistically interesting.     

On the inertia and range of transformations of positive definite matrices

Results are established which relate the range and inertia of general transformations on positive definite matrices. Included are a bound theorem for certain eigenvalues of these transformations, a characterization of positive definite preserving, completely positive transformations, and generalizations of the theorems of Stein [8] and of Stein and Pfeffer [9].     

Characterizations of products of symmetric matrices

Characterizations are obtained for matrices C of the form C = AΣ, where A, Σ are n×n matrices over the real field such that A is symmetric and C is nonnegative definite. Among others, a proof of recent generalization of Cochran's theorem is given.