赋范线性空间的第二对偶空间

Theorem. A mapping x^** of X^* into sealar field Φ is a linear functional if and only if there exists a μ∈ba(S) such that X^**(X^*)=∫_sx^*(s)μ(ds),x^*∈X^* Theorem. F∈ba(S.Σ)^* if and only if there exists a λ∈ba (T) (T is the closed unit sphere of the space B(S,Σ))such that F(μ)=∫(∫_st(s)μ(ds))λ(dt),μ∈ba(S,Σ).     

一类矩阵方程的广义Hermite问题

该文主要解决了如下两个问题 问题I 已知矩阵 M∈ C^n×e, A∈C^n×m, B∈ C^m×m, 求 X∈ HC_M,n使得 A^HXA=B, 其中 HC_M,n={ X∈ C^n×n}|α^H(X-X^H)=0, for all α∈ C(M) }. 问题II 任意给定矩阵 X^* ∈C^n×n, 求 $\hat{X}\in H_E$ 使得 ||\hat{X}-X^*||=\min\limits_{X∈ H_E}||X-X^*||, 这里 H_E 为问题I的解集. 利用广义奇异值分解定理,得到了问题I的可解条件及其通解表达式, 获得了问题II的解,并进行了相应的数值计算.     

本原矩阵严格完全不可分解指数的一个猜想

完全证明了n阶本原Boole矩阵严格完全不可分解指数(strict fullyindecomposable exponent)f_n^*的猜想:f_n^*≤[(n+1)²/4].     

COUNTABLE HOMOGENEOUS MARKOV PROCESSES WITH IDENTICAL HITTING DISTRIBUTIONS

A theorem of Blumentbal； Getoor and McKean (1962) states： Let both X (t) and X^*(t) be Hunt processes, then they have identical hitting distributions if there exists a continuous random time substitute Z(t) such that X(Z(t) and X^*(t) have identical transition functions. In this paper an analogous theorem is established for countable homogeneoue Markov processes with conservative Q-matrix (in general, they are not Hunt processes),and another necessary and sufficient condition is found.     

算子方程的解及算子张量积

本文讨论Hilbert空间上一类三阶二元算子方程组A^*AC = αA^*A² + βAA^*A;AA^*C = λA^*A² + γAA^*A,给出所有重交换的解(A,C).作为应用,得到算子张量积A(?)B+C(?)D和A₁(?)A₂(?)…(?)A_n为拟正规算子的充分必要条件.     

广义态空间中Krein-Milman定理的算子类似

讨论在C^*-凸理论下C^*-代数A的广义态空间S_Cⁿ(A)中的Krein-Milman型问题.证明了S_Cⁿ(A)的任意一个BW-紧的C^*-凸子集K都具有一个C^*-端点,而且K是其C^*-端点的C^*-凸包.     

空间的几种超投影性质及其局部化

讨论Banach空间几种超投影性质(及其相应的局部化性质)之间的关系,证明了在Banach空间X自反的条件下,X是l_p-次投影空间的充要条件是X^*是l_p-超投影空间,X是局部l_p-次投影空间的充要条件是X^*是局部l_p-超投影空间,以及X是局部次投影空间的充要条件是X^*是局部超投影的。其中1/p+1/q=1(p>1,q>1)。     

线性流形上的广义反射矩阵反问题

设 R∈C^m×m 及 S∈C^n×n 是非平凡Hermitian酉矩阵, 即 R^H=R=R^-1≠±I_m ,S^H=S=S^-1≠±I_n.若矩阵 A∈C^m×n 满足 RAS=A, 则称矩阵 A 为广义反射矩阵.该文考虑线性流形上的广义反射矩阵反问题及相应的最佳逼近问题.给出了反问题解的一般表示, 得到了线性流形上矩阵方程AX₂=Z₂, Y₂^H A=W₂^H 具有广义反射矩阵解的充分必要条件, 导出了最佳逼近问题唯一解的显式表示.     

正定Hermite矩阵的若干行列式不等式

本文对满足条件Ａ^Ｈ＝Ａ＞０，１／２（Ｂ＋Ｂ^Ｈ）≥０的矩阵Ａ，Ｂ，建立了四个行列式不等式．某些著名的行列式不等式和一些已知结用，均可作为其推论．     

矩阵方程X+ATX-1A=I的正定解及反问题求解

本文得到矩阵方程Ｘ＋Ａ^TX^-1Ａ＝Ｉ的反问题题的充要条件及反问题解的一般形式，进而得到正定解的充要条件及一定条件下正解解的一般形式．     

The structured distance to normality of Toeplitz matrices with application to preconditioning

A formula for the distance of a Toeplitz matrix to the subspace of {e^i?}‐circulant matrices is presented, and applications of {e^i?}‐circulant matrices to preconditioning of linear systems of equations with a Toeplitz matrix are discussed. Copyright © 2010 John Wiley & Sons, Ltd.     

The solvability conditions for inverse eigenproblem of symmetric and anti‐persymmetric matrices and its approximation

The problem of generating a matrix A with specified eigen‐pair, where A is a symmetric and anti‐persymmetric matrix, is presented. An existence theorem is given and proved. A general expression of such a matrix is provided. We denote the set of such matrices by ??????_Eⁿ. The optimal approximation problem associated with ??????_Eⁿ is discussed, that is: to find the nearest matrix to a given matrix A* by A∈??????_Eⁿ. The existence and uniqueness of the optimal approximation problem is proved and the expression is provided for this nearest matrix. Copyright © 2002 John Wiley & Sons, Ltd.     

Fast and Stable Reduction of Diagonal Plus Semi-Separable Matrices to Tridiagonal and Bidiagonal Form

A two-way chasing algorithm to reduce a diagonal plus a symmetric semi-separable matrix to a symmetric tridiagonal one and an algorithm to reduce a diagonal plus an unsymmetric semi-separable matrix to a bidiagonal one are considered. Both algorithms are fast and stable, requiring a computational cost of N ², where N is the order of the considered matrix.     

关于圈的完全正矩阵实现

本文给出了一个关联图为圈的非负、半正定矩阵A为完全正的一个充要条件.我们还证明了这样的矩阵A（当A为完全正时）的分解指数即为A的阶数.     

完全正矩阵的整数分解

n阶矩阵A称为完全正的,如果A有分解:A=BB^T,其中B为元素非负矩阵,B的最小可能列数称为A的分解指数.本文考察低阶双非负矩阵在整数环上的完全正分解及其分解指数.     

The quaternion matrix equation ΣA i XB i =E

LetH _F be the generalized quaternion division algebra over a fieldF with charF#2. In this paper, the adjoint matrix of anyn×n matrix overH _F [γ] is defined and its properties is discussed. By using the adjoint matrix and the method of representation matrix, this paper obtains several necessary and sufficient conditions for the existence of a solution or a unique solution to the matrix equation Σ _i=0 ^k A ⁱ XB _i =E overH _F , and gives some explicit formulas of solutions. Supported by the National Natural Science Foundation of China and Human     

Inverse of the distance matrix of a block graph

A connected graph G, whose 2-connected blocks are all cliques (of possibly varying sizes) is called a block graph. Let D be its distance matrix. By a theorem of Graham, Hoffman and Hosoya, we have det(D)?≠?0. We give a formula for both the determinant and the inverse, D ^?1 of D.     

Matrix analysis for associated consistency in cooperative game theory

Hamiache axiomatized the Shapley value as the unique solution verifying the inessential game property, continuity and associated consistency. Driessen extended Hamiache’s axiomatization to the enlarged class of efficient, symmetric, and linear values. In this paper, we introduce the notion of row (resp. column)-coalitional matrix in the framework of cooperative game theory. The Shapley value as well as the associated game are represented algebraically by their coalitional matrices called the Shapley standard matrix M^Sh and the associated transformation matrix M_λ, respectively. We develop a matrix approach for Hamiache’s axiomatization of the Shapley value. The associated consistency for the Shapley value is formulated as the matrix equality M^Sh = M^Sh · M_λ. The diagonalization procedure of M_λ and the inessential property for coalitional matrices are fundamental tools to prove the convergence of the sequence of repeated associated games as well as its limit game to be inessential. In addition, a similar matrix approach is applicable to study Driessen’s axiomatization of a certain class of linear values. In summary, it is illustrated that matrix analysis is a new and powerful technique for research in the field of cooperative game theory.