矩阵计算逆的精度估计

在许多问题中,需要计算非奇异矩阵的逆矩阵。然而算得的逆矩阵相对于精确的逆矩阵来说,究竟有几位有效数字,往往是不得而知的。本文给出的定理1和定理2,能在算得的逆矩阵与原矩阵之间满足了一个要求不算高的关系式之后,准确地判断出算得的逆矩阵有几位有效数字。     

几种约束广义逆矩阵的有限算法

1引言与引理众所周知，关于非奇异方阵的正则逆的有限算法是由Faddeev大给在1949年之前提出的，这就是著名的Faddeev算法[1，P…334-336]。自从五十年代中期广义逆矩阵的研究复兴与发展以来，有不少学者提出了关于广义逆矩阵的有限算法。第一个给出关于广义逆矩     

矩阵的加权Moore—Penrose逆

利用矩阵的广义奇异值分解，给出了复数域上矩阵的Moore—Penrose逆存在的充要条件及其表达式．     

广义逆矩阵的张量积

本证明了广义逆矩阵张量积的一些性质,介绍了它在解线性方程组方面的应用．并得到了矩阵张量积的奇异值的一些性质。     

酉延拓矩阵的奇异值分解及其广义逆

从普通奇异值分解出发,导出了酉延拓矩阵的奇异值和奇异向量与母矩阵的奇异值和奇异向量间的定量关系,同时对酉延拓矩阵的满秩分解及g逆,反射g逆,最小二乘g逆,最小范数g逆作了定量分析,得到了酉延拓矩阵的满秩分解矩阵F*和G*与母矩阵A的分解矩阵F和G之间的关系.最后给出了相应的快速求解算法,并举例说明该算法大大降低了分解的计算量和存储量,提高了计算效率.     

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积.     

O-对称矩阵的奇异值分解及其算法

本文研究了具有轴对称结构矩阵的奇异值分解,找出了这类矩阵奇异值分解与其子阵奇异值分解之间的定量关系.利用这些定量关系给出这类矩阵奇异值分解和Moore-Penrose逆的算法,据此可极大地节省求该类矩阵奇异值分解和Moore-Penrose逆时的计算量和存储量.     

实对称矩阵的一类逆特征值问题

利用矩阵的奇异值分解及广义逆，给出了矩阵约束下矩阵反问题AX=B有实对称解的充分必要条件及其通解的表达式．此外，给出了在矩阵方程的解集合中与给定矩阵的最佳逼近解的表达式．     

Toeplitz型矩阵的逆矩阵的快速三角分解算法

针对有关“型”矩阵的三角分解问题 ,提出了一种 Toeplitz型矩阵的逆矩阵的快速三角分解算法 .首先假设给定 n阶非奇异矩阵 A,利用一组线性方程组的解 ,得到 A- 1的一个递推关系式 ,进而利用该关系式得到 A- 1的一种三角分解表达式 ,然后从 Toeplitz型矩阵的特殊结构出发 ,利用上述定理的结论 ,给出了Toeplitz型矩阵的逆矩阵的一种快速三角分解算法 ,算法所需运算量为 O( mn2 ) .最后 ,数值计算表明该算法的可靠性 .     

（m，n）型二重（r1,r2）-循环矩阵的逆和广义逆

利用矩阵的Kronecker积给出了非奇异的（m,n）型二重（r1,r2）－循环矩阵求逆矩阵的一个计算公式,同时该方法还可以推广到求奇异的（m,n）型二重（r1,r2）－循环矩阵的反射g逆。     

A fast convergent iterative solver for approximate inverse of matrices

In this paper, a rapid iterative algorithm is proposed to find robust approximations for the inverse of nonsingular matrices. The analysis of convergence reveals that this high‐order method possesses eighth‐order convergence. The interesting point is that, this rate is attained using less number of matrix‐by‐matrix multiplications in contrast to the existing methods of the same type in the literature. The extension of the method for finding Moore–Penrose inverse of singular or rectangular matrices is also presented. Numerical comparisons will be given to show the applicability, stability and consistency of the new scheme by paying special attention on the computational time. Copyright © 2013 John Wiley & Sons, Ltd.     

广义超度量矩阵的封闭性质

本文研究了广义超度量矩阵的封闭性质.证明了若A为非奇异的广义超度量矩阵,则A与A的转置的Hadamard积仍然是一个广义超度量矩阵,并且它的逆矩阵是一个对角占优的M矩阵.给出了两个广义超度量矩阵Hadamard积封闭的一个充分条件.最后,讨论了广义超度量矩阵的Perron补与和的封闭条件.     

A dominance notion for singular matrices with applications to nonnegative generalized inverses

A dominance rule for singular matrices using proper splittings is proposed. This extends the corresponding notion, known for nonsingular matrices. An application to the nonnegativity of the Moore–Penrose inverse is presented.     

On parametrization of totally nonpositive matrices and applications

The problem of accurate computations for totally non‐negative matrices has been studied; however, it remains open for other sign regular matrices. One major obstacle is that there is no known parametrization of these matrices. The main contribution of the present work is that we provide such parametrization of nonsingular totally nonpositive matrices. A useful application of our results is that these parameters can determine accurately the entries of the inverse of a nonsingular totally nonpositive matrix. Copyright © 2011 John Wiley & Sons, Ltd.     

Core–EP inverse

In this work, we introduce a notion of ‘core–EP inverse’ for a square matrix which is not essentially of index one. This extends the notion of ‘core inverse’, which was initially defined for the matrices of index one. The properties of matrices having ‘core–EP inverse’ and ‘core–EP generalized inverse’ are studied, and obtained a formula to compute the core–EP generalized inverse from a particular linear combination of minors of given matrix.     

局部环上矩阵广义逆半群的子集及其性质

设R是一个局部环,A是一个可相似对角化的n阶矩阵.利用矩阵方法研究了环R上矩阵A的广义逆半群的子集,得到了其做成正规子群的条件和其中元素可逆的条件,也得到了矩阵广义逆半群的一些性质.     

Linear complexity algorithm for semiseparable matrices

A new linear complexity algorithm for general nonsingular semiseparable matrices is presented. For symmetric matrices whose semiseparability rank equals to 1 this algorithm leads to an explicit formula for the inverse matrix.Supported in part by the NSF Grant DMS 9306357     

Tridiagonal and upper triangular inverse M-matrices

In this paper we characterize the nonnegative nonsingular tridiagonal matrices belonging to the class of inverse M-matrices. We give a geometric equivalence for a nonnegative nonsingular upper triangular matrix to be in this class. This equivalence is extended to include some reducible matrices.     

Inverses of quasi-tridiagonal matrices

Discretizations in various types of problems lead to quasi-tridiagonal matrices. In this paper, the inverse of a (nonsingular) quasi-tridiagonal matrix is obtained. In addition, a necessary and sufficient condition for a block matrix to have a quasi-tridiagonal inverse is derived.