A NEW ALGORITHM FOR COMPUTING LARGEST REAL PART EIGENVALUE OF MATRICES：COLLATZ ＆ PERRON-FROBERNIUS＇ APPROACH

This paper describes a new method and algorithm for the numerical solution of eigenvalues with the largest real part of positive matrices.The method is based on a numerical implementation of Collatz’s eigenvalue inclusion theorem for non-negative irreducible matrices.Eigenvalues are analyzed for the studies of the stability of linear systems.Finally, a numerical discussion is given to derive the required number of mathematical operations of the new algorithm. Comparisons between the new algorithm and several well known ones, such as Power, and QR methods, are discussed.     

CONVERGENCE OF NEWTON＇S METHOD FOR SYSTEMS OF EQUATIONS WITH CONSTANT RANK DERIVATIVES

The convergence properties of Newton＇s method for systems of equations with constant rank derivatives are studied under the hypothesis that the derivatives satisfy some weak Lipschitz conditions. The unified convergence results, which include Kantorovich type theorems and Smale＇s point estimate theorems as special cases, are obtained.     

Modified SMS method for computing outer inverses of Toeplitz matrices

We introduce a new algorithm based on the successive matrix squaring (SMS) method. This algorithm uses the strategy of ε-displacement rank in order to find various outer inverses with prescribed ranges and null spaces of a square Toeplitz matrix. Using the idea of displacement theory which decreases the memory space requirements as well as the computational cost, our method tends to be very effective for Toeplitz matrices.     

Solving Toeplitz Least Squares Problems by Means of Newton's Iteration

We extend the algorithm of [4], based on Newton's iteration and on the concept of -displacement rank, to the computation of the generalized inverse A ⁺ of an m×n Toeplitz matrix A. We introduce new strategies for the dynamical control of the truncation level at each step of the iteration. Numerical experiments and an application to a problem of image restoration are shown. An object-oriented implementation in C++ is described.     

Moore-Penrose Inverses and Group Inverses of Block k-Circulant Matrices

Ｍｏｏｒｅ－Ｐｅｎｒｏｓｅ　Ｉｎｖｅｒｓｅｓ　ａｎｄ　Ｇｒｏｕｐ　Ｉｎｖｅｒｓｅｓ　ｏｆ　Ｂｌｏｃｋ　ｋ－Ｃｉｒｃｕｌａｎｔ　ＭａｔｒｉｃｅｓＭｏｏｒｅ－ＰｅｎｒｏｓｅＩｎｖｅｒｓｅｓａｎｄＧｒｏｕｐＩｎｖｅｒｓｅｓｏｆＢｌｏｃｋｋ－Ｃｉｒｃｕｌａｎ...     

Inverses and eigenpairs of tridiagonal Toeplitz matrix with opposite-bordered rows

In this paper, tridiagonal Toeplitz matrix (type I, type II) with opposite-bordered rows are introduced. Main attention is paid to calculate the determinants, the inverses and the eigenpairs of these matrices. Specifically, the determinants of an $n\times n$ tridiagonal Toeplitz matrix with opposite-bordered rows can be explicitly expressed by using the $(n-1)$th Fibonacci number, the inversion of the tridiagonal Toeplitz matrix with opposite-bordered rows can also be explicitly expressed by using the Fibonacci numbers and unknown entries from the new matrix. Besides, we give the expression of eigenvalues and eigenvectors of the tridiagonal Toeplitz matrix with opposite-bordered rows. In addition, some algorithms are presented based on these theoretical results. Numerical results show that the new algorithms have much better computing efficiency than some existing algorithms studied recently.     

关于环上矩阵的群逆与Drazin逆

本文给出了环上一类方阵有群逆，｛１，５｝－道的充要条件及其它们的表式，推广了体（域）上关于群逆的Ｃｌｉｎｅ定理．此外还首次得到了矩阵有Ｄｒａｚｉｎ逆的判别准则及其它的表式．     

保域上矩阵群逆的线性算子

设F是特征为2的域,n≥2,Mn(F)为F上全矩阵代数.在这篇文章中我们刻画了Mn(F)上保持矩阵群逆的线性算子的形式.     

Formulas for the Inverses of Toeplitz Matrices with Polynomially Singular Symbols

We consider large finite Toeplitz matrices with symbols of the form (1– cos )^p f() where p is a natural number and f is a sufficiently smooth positive function. By employing techniques based on the use of predictor polynomials, we derive exact and asymptotic formulas for the entries of the inverses of these matrices. We show in particular that asymptotically the inverse matrix mimics the Green kernel of a boundary value problem for the differential operator Submitted: June 20, 2003     

分块矩阵的Moore-Penrose逆

该文研究了两类3×3分块矩阵M1=AOOBCODEF,M2=ABCDEFGHK的Moore-Penrose逆的表达式,并给出了表达式成立时的条件.     

关于单矩阵的广义逆(英文)

本文研究了单矩阵的广义逆,得到了单矩阵有内逆的充分必要条件,进一步讨论了结合环上单矩阵的群逆。     

Noncirculant Toeplitz matrices all of whose powers are Toeplitz

Let a, b and c be fixed complex numbers. Let M _n (a, b, c) be the n × n Toeplitz matrix all of whose entries above the diagonal are a, all of whose entries below the diagonal are b, and all of whose entries on the diagonal are c. For 1 ⩽ k ⩽ n, each k × k principal minor of M _n (a, b, c) has the same value. We find explicit and recursive formulae for the principal minors and the characteristic polynomial of M _n (a, b, c). We also show that all complex polynomials in M _n (a, b, c) are Toeplitz matrices. In particular, the inverse of M _n (a, b, c) is a Toeplitz matrix when it exists.