矩阵最小奇异值下界的估计

1．引言与记号记号：儿已（：。X。阶复矩阵集合；从利：A的特征值；一（川：A的最小奇异值；A”：A的共轭转置；【I州：绝对向量范数诱导的矩阵范数；。l（A为A的最大奇异值）时，最小奇异值m（人）下界的估计a是一个关键的数．an（A的下界在其他许多领域中都是一个极重要的课题，因而最小奇异值下界的估计一直是普遍关注的问题二［1，2］等仅利用A的元素得到了N（A）下界的简单估计，至今仍被广泛引用，其结果如下：设AE地（q．若【aiiIZ凡（A）且冲i三q（川，d＝1，…，n，则本文试图通过矩阵的分块和H矩阵特性等来讨论。（）的…     

M-矩阵Hadamard积的最小特征值下界的新估计式

设B和A是非奇异M-矩阵,给出B和A-1的Hadamard积的最小特征值下界τ（B°A-1）的一个新估计式,理论证明和算例表明,本文所得新估计式改进了现有的一些结果．     

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

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

M-矩阵Fan积最小特征值的不等式

给出两个非奇异M-矩阵A和B的Fan积最小特征值下界的新估计式,这些估计式只依赖于两个非奇异M-矩阵的元素,易于计算.数值例子表明,新估计式在一定条件下改进了其他已有的结果.     

M-矩阵Fan积的特征值下界的新估计

非奇异M-矩阵A与B的Fan积的最小特征值下界T(AB)的估计是矩阵理论研究的重要课题.利用Brauer定理和Gerschgorin定理给出最小特征值下界的新估计式.数值算例表明新估计式在一定条件下改进了Horn和Johnson的结果,同时也改进了其它文献中的一些结果.     

关于TLS和LS解的扰动分析

1．引言本文采用卜］的记号．最小二乘（LS）和总体最小二乘（TLS）是科学计算中的两种重要方法．尤是TLS，近来已有多篇论文讨论［1－6，8－16］．奇异值分解（SVD）和CS分解是研究TLS和LS的重要工具．令ACm，BCm,C=(A,B)，A和C的SVD分别为（1．1）（1．2）其中P51为某个正整数，U，U，V，V均为西矩阵，UI，UI，VI，VI为上述矩阵的前P列，z1一山。g（。1，…，内），】2＝di。g（内十l，…，。小】1＝dl。g（61；…，站，】2二diag（4＋1；…，dk），。l三··2。120和dl三…三d。20分别为C和A的奇异值，Z＝mhfm．n十以…     

非奇异M-矩阵的逆矩阵和M-矩阵的Hadamard积的最小特征值下界估计

给出非奇异M-矩阵的逆矩阵和M-矩阵的Hadamard积的最小特征值下界新的估计式,这些估计式都只依赖于矩阵的元素.数值例子表明,新估计式在一定条件下改进了Fiedler和Markham的猜想,也改进了其它已有的结果.     

线性流形上矩阵方程AX=B的一类反问题及数值解法

1．引言本文用＊-"m表示全体nX。实矩阵的集合，人表示n阶单位矩阵，汉"m一《ME＊""叫rank（川一r），＊＊"""＝HE＊"""卜"A＝v，＊＊"""一仰E＊"""卜"一M｝，SR；""（SR7""）表示全体7。阶实对称半正定（正定）阵集合．N（A）表示矩阵A的零空间，即N（A）＝（xlAx＝0），ID叫D表示Frobenius范数，A"表示矩阵A的Moors－Penrose广义逆，［EI十表示在Frobenius范数意义下n阶方阵E在SR；""中唯一的最佳k逼近解，即口一［E］＋11-inf。。、。。x，IllE-All．（［E］十求法见文［7］）．还用A三0（A三0）表示A（的k阶顺序主子矩…     

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

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

严格对角占优M-矩阵的逆矩阵的无穷大范数的新上界

给出了严格对角占优M-矩阵的逆矩阵的无穷大范数上界新的估计式,进而给出严格对角占优M-矩阵的最小特征值下界的估计式.新估计式改进了已有文献的结果.     

非负矩阵Perron根的上下界

1.引言 本文主要讨论非负矩阵,我们将用B≥0和B>0分别表示矩阵B是非负的和正的,也就是B的每一个元素是非负的和B的每一个元素是正的.用p(B)表示方阵B的谱半径,当B≥0时,p(B)也就是B的perron根. 设(n)={1,2,…,n},A=(ai,j)是n×n非负矩阵,我们称     

Solution Bounds of the Continuous and Discrete Lyapunov Matrix Equations

A unified approach is proposed to solve the estimation problem for the solution of continuous and discrete Lyapunov equations. Upper and lower matrix bounds and corresponding eigenvalue bounds of the solution of the so-called unified algebraic Lyapunov equation are presented in this paper. From the obtained results, the bounds for the solutions of continuous and discrete Lyapunov equations can be obtained as limiting cases. It is shown that the eigenvalue bounds of the unified Lyapunov equation are tighter than some parallel results and that the lower matrix bounds of the continuous Lyapunov equation are more general than the majority of those which have appeared in the literature.     

Sharp bounds for spectral radius of nonnegative weakly irreducible tensors

We obtain the sharp upper and lower bounds for the spectral radius of a nonnegative weakly irreducible tensor. By using the technique of the representation associate matrix of a tensor and the associate directed graph of the matrix, the equality cases of the bounds are completely characterized by graph theory methods. Applying these bounds to a nonnegative irreducible matrix or a connected graph (digraph), we can improve the results of L. H. You, Y. J. Shu, and P. Z. Yuan [Linear Multilinear Algebra, 2017, 65(1): 113–128], and obtain some new or known results. Applying these bounds to a uniform hypergraph, we obtain some new results and improve some known results of X. Y. Yuan, M. Zhang, and M. Lu [Linear Algebra Appl., 2015, 484: 540–549]. Finally, we give a characterization of a strongly connected k-uniform directed hypergraph, and obtain some new results by applying these bounds to a uniform directed hypergraph.     

正则化HSS预处理鞍点矩阵的特征值估计

最近,Bai和Benzi针对鞍点问题提出了一类正则化HSS（Regularized Hermitian and skew-Hermitian splitting,RHSS）预处理子（BIT Numer.Math.,57（2017）287-311）.为了进一步分析RHSS预处理子的效果,本文重点研究了RHSS预处理鞍点矩阵特征值的估计,分析了复特征值实部和模的上下界、实特征值的上下界,还给出了特征值均为实数的充分条件.当正则化矩阵取为零矩阵时,RHSS预处理子退化为HSS预处理子,分析表明本文给出的复特征值实部的界比已有的结果更精确.数值算例验证了本文给出的理论结果.     

THE BLOCH CONSTANT OF LOCALLY BIHOLOMORPHIC MAPPINGS ON BOUNDED SYMMETRIC DOMAINS

51.IntroductionIn[11,westudiedtheboundsofBlochconstantofholomorphicmappingsonirreducibleboundedsymmetricdomains.ThispaperisasuccessivepaPerof[1].WestudytheboundsoftheBlochconstantoflocallybiholomorphicmappingsonirreducibleboundedsymmetricdomains.AllthenotationsofthispaPerarethesameasthoseweusedin[1].LetDbeadomain,whichcontainstheorigin.AholomorphicmappingonDisdefinedasaBlochmappingifthefamilyofmappingsFj={g:g(z)=f(rk(z))-j(gh(o)),forallrkEAut(D)},isanormalfamily.TheBlochnormofaBlochmapp…     

New bounds for Perron root of a nonnegative matrix

In this paper, we obtain some new bounds for Perron root of a nonnegative matrix, which are expressed by easily calculated function in element of matrix. These new results generalize and improve the bounds of G. Frobenius [1] and H. Minc [2], and also extend the known results by Liu [6].     

Estimates for the inverse elements of tridiagonal matrices

In this work, new upper and lower bounds for the inverse entries of the tridiagonal matrices are presented. The bounds improve the bounds in D. Kershaw [Inequalities on the elements of the inverse of a certain tridiagonal matrix, Math. Comput. 24 (1970) 155–158], P.N. Shivakumar, C.X. Ji [Upper and lower bounds for inverse elements of finite and infinite tridiagonal matrices, Linear Algebr. Appl. 247 (1996) 297–316], R. Nabben [Two-sided bounds on the inverse of diagonally dominant tridiagonal matrices, Linear Algebr. Appl. 287 (1999) 289–305] and R. Peluso, T. Politi [Some improvements for two-sided bounds on the inverse of diagonally dominant tridiagonal matrices, Linear. Algebr. Appl. 330 (2001) 1–14].     

Condition numbers and backward perturbation bound for linear matrix equations

This paper deals with the normwise perturbation theory for linear (Hermitian) matrix equations. The definition of condition number for the linear (Hermitian) matrix equations is presented. The lower and upper bounds for the condition number are derived. The estimation for the optimal backward perturbation bound for the Hermitian matrix equations is obtained. Copyright © 2010 John Wiley & Sons, Ltd.     

加权流形上加权p-Laplace特征值问题的第一特征值下界估计

本文研究了加权流形上加权p-Laplacian特征值问题的第一特征值下界估计的问题.利用余面积公式、Cavalieri原理以及Federer-Fleming定理,获得了由Cheeger常数或等周常数确定的第一特征值的下界估计.     

Upper eigenvalue bounds for pencils of matrices

Eigenvalue bounds are obtained for pencils of matrices A ? vB where A is a Stieltjes matrix and B is positive definite, under assumptions suitable for the estimation of asymptotic convergence rates of factorization iterative methods, where B represents the approximate factorization of A. The upper bounds obtained depend on the “connectivity” structure of the matrices involved, which enters through matrix graph considerations; in addition, a more classical argument is used to obtain a lower bound. Potential applications of these results include a partial confirmation of Gustafsson's conjecture concerning the nonnecessity of Axelsson's perturbations.