M-矩阵和逆M-矩阵的Hadamard积(英文)

A=[a_ij]∈M_n和B=[b₍ij(]∈M_n的Hadamard积可表示为AoB=[a_ijb_ij]∈M_n.如果A,B∈M_n是M-矩阵,那么AoB^-1也是M-矩阵.证明了（a）一个非奇异的M-matrix是一对M-矩阵和逆M-矩阵的Hadamard积,同时也证明了（b）一个P-矩阵是两个P-矩阵的Hadamard积.     

广义正定矩阵的Hadamard积和Kronecker积的一些性质

本文讨论了各类型广义正定矩阵的 Hadamard 积和 Kronecker 积的一些重要性质,得到了判断 n 阶实矩阵是广义正定矩阵的一些充要条件,它们是[1]-[4]中相应定理的推广,最后,我们修正了[4]中的一个错误。     

矩阵方程XA-YB=D的广义中心对称解及其最佳逼近

1 引言 首先引入一些记号.记Cn×m为n×m复矩阵的集合.UCn×n表示所有n阶酉矩阵的集合.In表示n阶单位矩阵.AH和A+分别表示矩阵A的共轭转置及Moore-Penrose广义逆.对A=(n玎).…B=(bij).煳用A}B=(aijbij)sXt表示A与B的Hadamard积.     

块半正定矩阵Hadamard积的行列式不等式

基于分块矩阵的Schur补和Albert定理,证明了一些含有块Hadamard积的行列式不等式,并且用不同于文献的方法证明了半正定Hermitian矩阵块Hadamard积的行列式不等式的一个猜想,此结果推广了半正定Hermitian矩阵在块Hadamard积下的Oppenheim不等式.     

矩阵Hadamard积和Fan积的特征值界的一些新估计式（英文）

本文研究了非奇异M-矩阵A与B的Fan积的最小特征值下界和非负矩阵A与B的Hadamard积的谱半径上界的估计问题.利用Brauer定理,得到了一些只依赖于矩阵的元素且易于计算的新估计式,改进了文献[41现有的一些结果.     

M-矩阵Hadamard积的新不等式(英文)

设A和B是非奇异M-矩阵,给出了关于A和B-1的Hadamard积的最小特征值下界τ(A°B-1)的一个新估计式,该结果改进了文献[4]的结果.     

亚正定矩阵的Kronecker积

研究亚正定矩阵kronecker积的亚正定性,得到了一个充要条件,同时得到Hadamard积亚正定性的一个充要条件.     

子空间上的一类矩阵反问题

1 引言 设Rn×m为所有n×m实矩阵的集合,ASRn×n为n阶实反对称矩阵的集合,ORn×n 为n阶实正交矩阵的全体. In是n阶单位矩阵,A+,R(A),N(A)分别表示矩阵A的 Moore-Penrose广义逆、值域及零空间,并记EA=I-AA+,FA=I-A+A(I为单位矩 阵,A为任意矩阵).对A=(aij),B=(bij)∈Rn×m,A*B=(aijbij)表示矩阵A与B 的Hadamard积.在Rn×m上定义矩阵A与B的内积为(A,B)=tr(BT A),则由此内积 导出的范数‖A‖=(A,A)~(1/2)是矩阵的Frobenius范数,并且Rn×m构成一个完备的内积 空间.     

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

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

非负矩阵Hadamard积的最大特征值的新上界

关于非负矩阵A和B的Hadamard积的最大特征值的上界问题,主要利用Gerschgorin定理和Brauer定理给出了新的估计式,并把新结果与现有结果进行了比较.数值算例表明新结果在只依赖矩阵元素的条件下改进了现有的一些估计式.     

Ultrametric and Tree Potential

In this article we study which infinite matrices are potential matrices. We tackle this problem in the ultrametric framework by studying infinite tree matrices and ultrametric matrices. For each tree matrix, we show the existence of an associated symmetric random walk and study its Green potential. We provide a representation theorem for harmonic functions that includes simple expressions for any increasing harmonic function and the Martin kernel. For ultrametric matrices, we supply probabilistic conditions to study its potential properties when immersed in its minimal tree matrix extension. C. Dellacherie thanks support from Nucleus Millennium P04-069-F for his visit to CMM-DIM at Santiago. The research of S. Martinez is supported by Nucleus Millennium Information and Randomness P04-069-F and by the BASAL CONICYT Program. The research of J. San Martin is supported by FONDAP and by the BASAL CONICYT Program.     

A Class of M-matrices whose Graphs are Trees

In this article, we characterize generalized ultrametric matrices whose inverses are tree-diagonal. This generalizes the results of McDonald, Nabben, Neumann, Schneider and Tsatsomeros for tri-diagonal matrices.     

An algorithm for determining if the inverse of a strictly diagonally dominant Stieltjes matrix is strictly ultrametric

Summary It was recently shown that the inverse of a strictly ultrametric matrix is a strictly diagonally dominant Stieltjes matrix. On the other hand, as it is well-known that the inverse of a strictly diagonally dominant Stieltjes matrix is a real symmetric matrix with nonnegative entries, it is natural to ask, conversely, if every strictly diagonally dominant Stieltjes matrix has a strictly ultrametric inverse. Examples show, however, that the converse is not true in general, i.e., there are strictly diagonally dominant Stieltjes matrices in ^n×n (for everyn3) whose inverses are not strictly ultrametric matrices. Then, the question naturally arises if one can determine which strictly diagonally dominant Stieltjes matrices, in ^n×n (n3), have inverses which are strictly ultrametric. Here, we develop an algorithm, based on graph theory, which determines if a given strictly diagonally dominant Stieltjes matrixA has a strictly ultrametric inverse, where the algorithm is applied toA and requires no computation of inverse. Moreover, if this given strictly diagonally dominant Stieltjes matrix has a strictly ultrametric inverse, our algorithm uniquely determines this inverse as a special sum of rank-one matrices.Research supported by the National Science FoundationResearch supported by the Deutsche Forschungsgemeinschaft     

几种矩阵逆的连续性

非奇异矩阵的逆是矩阵元素的连续函数．学者们也对矩阵广义逆的连续性有所研究．本文应用矩阵分裂和两个矩阵之和的逆的展开式,给出了一般非奇异矩阵,M-矩阵和H-矩阵的逆的连续性．当一些合理的条件满足时,这几种矩阵的逆是连续的．     

A Note on Ultrametric Matrices

It is proved in this paper that special generalized ultrametric and special matrices are, in a sense, extremal matrices in the boundary of the set of generalized ultrametric and matrices, respectively. Moreover, we present a new class of inverse M-matrices which generalizes the class of matrices.     

On stochastic generation of ultrametrics in high-dimensional Euclidean spaces

We present a proof of the theorem which states that a matrix of Euclidean distances on a set of specially distributed random points in the n-dimensional Euclidean space R ⁿ converges in probability to an ultrametric matrix as n → ∞. Values of the elements of an ultrametric distance matrix are completely determined by variances of coordinates of random points. Also we present a probabilistic algorithm for generation of finite ultrametric structures of any topology in high-dimensional Euclidean space. Validity of the algorithm is demonstrated by explicit calculations of distance matrices and ultrametricity indexes for various dimensions n.     

Multidimensional ultrametric pseudodifferential equations

We develop an analysis of wavelets and pseudodifferential operators on multidimensional ultrametric spaces which are defined as products of locally compact ultrametric spaces. We introduce bases of wavelets, spaces of generalized functions and the space D′₀(X) of generalized functions on a multidimensional ultrametric space. We also consider some family of pseudodifferential operators on multidimensional ultrametric spaces. The notions of Cauchy problem for ultrametric pseudodifferential equations and of ultrametric characteristics are introduced. We prove an existence theorem and describe all solutions for the Cauchy problem (an analog of the Kovalevskaya theorem).     

Schröder matrix as inverse of Delannoy matrix

Using Riordan arrays, we introduce a generalized Delannoy matrix by weighted Delannoy numbers. It turns out that Delannoy matrix, Pascal matrix, and Fibonacci matrix are all special cases of the generalized Delannoy matrices, meanwhile Schröder matrix and Catalan matrix also arise in involving inverses of the generalized Delannoy matrices. These connections are the focus of our paper. The half of generalized Delannoy matrix is also considered. In addition, we obtain a combinatorial interpretation for the generalized Fibonacci numbers.     

Generalized even and odd totally positive matrices

A generalization of the definition of an oscillatory matrix based on the theory of cones is given in this paper. The positivity and simplicity of all the eigenvalues of a generalized oscillatory matrix are proved. Classes of generalized even and odd oscillatory matrices are introduced. Spectral properties of the obtained matrices are studied. Criteria of generalized even and odd oscillation are given. Examples of generalized even and odd oscillatory matrices are presented.