Additive results for the generalized Drazin inverse in a Banach algebra

In this paper we investigate additive properties of the generalized Drazin inverse in a Banach algebra. We find some new conditions under which the generalized Drazin inverse of the sum a + b could be explicitly expressed in terms of a, a^d, b, b^d. Also, some recent results of Castro and Koliha [New additive results for the g-Drazin inverse, Proc. Roy. Soc. Edinburgh Sect. A 134 (2004) 1085-1097] are extended.     

Drazin inverse of partitioned matrices in terms of Banachiewicz-Schur forms

Let be a partitioned matrix, where A and D are square matrices. Denote the Drazin inverse of A by A^D. The purpose of this paper is twofold. Firstly, we develop conditions under which the Drazin inverse of M having generalized Schur complement, S=D-CA^DB, group invertible, can be expressed in terms of a matrix in the Banachiewicz-Schur form and its powers. Secondly, we deal with partitioned matrices satisfying rank(M)=rank(A^D)+rank(S^D), and give conditions under which the group inverse of M exists and a formula for its computation.     

The Drazin inverse of a singular,unreduced tridiagonal matrix

For a tridiagonal, singular matrix A   we present a method for the computation of the polynomial p(λ)$p(\lambda )$ such that A^D=p(A)$A^D=p(A)$ holds, where A^D$A^D$ is the Drazin inverse of A. The approach is based on the recursion of characteristic polynomials of leading principal submatrices of A.     

Additive and multiplicative perturbation bounds for the Moore-Penrose inverse

In this paper, we obtain the additive and multiplicative perturbation bounds for the Moore-Penrose inverse under the unitarily invariant norm and the Q - norm, which improve the corresponding ones in [P.Å. Wedin, Perturbation theory for pseudo-inverses, BIT 13(1973)217-232].     

Revisiting the core EP inverse and its extension to rectangular matrices

In this paper, we revise the core EP inverse of a square matrix introduced by Prasad and Mohana in [12], Core EP inverse, Linear and Multilinear Algebra 62(3) (2014), 792–802. Firstly, we give a new representation and a new characterization of the core EP inverse. Then, we study some properties of the core EP inverse by using a representation by block matrices. Secondly, we extend the notion of core EP inverse to rectangular matrices by means of a weighted core EP decomposition. Finally, we study some properties of weighted core EP inverses.     

Equalities and inequalities for inertias of hermitian matrices with applications

The inertia of a Hermitian matrix is defined to be a triplet composed of the numbers of the positive, negative and zero eigenvalues of the matrix counted with multiplicities, respectively. In this paper, we show some basic formulas for inertias of 2×2 block Hermitian matrices. From these formulas, we derive various equalities and inequalities for inertias of sums, parallel sums, products of Hermitian matrices, submatrices in block Hermitian matrices, differences of outer inverses of Hermitian matrices. As applications, we derive the extremal inertias of the linear matrix expression A-BXB^∗ with respect to a variable Hermitian matrix X. In addition, we give some results on the extremal inertias of Hermitian solutions to the matrix equation AX=B, as well as the extremal inertias of a partial block Hermitian matrix.     

Identities for minors of the Laplacian, resistance and distance matrices

It is shown that if L and D are the Laplacian and the distance matrix of a tree respectively, then any minor of the Laplacian equals the sum of the cofactors of the complementary submatrix of D, up to sign and a power of 2. An analogous, more general result is proved for the Laplacian and the resistance matrix of any graph. A similar identity is proved for graphs in which each block is a complete graph on r vertices, and for q-analogues of such matrices of a tree. Our main tool is an identity for the minors of a matrix and its inverse.     

Characterizations of EP matrices and weighted-EP matrices

A square complex matrix A is said to be EP if A and its conjugate transpose A^∗ have the same range. In this paper, we first collect a group of known characterizations of EP matrix, and give some new characterizations of EP matrices. Then, we define weighted-EP matrix, and present a wealth of characterizations for weighted-EP matrix through various rank formulas for matrices and their generalized inverses.     

On nonsingularity of block two-by-two matrices

We derive necessary and sufficient conditions for guaranteeing the nonsingularity of a block two-by-two matrix by making use of the singular value decompositions and the Moore–Penrose pseudoinverses of the matrix blocks. These conditions are complete, and much weaker and simpler than those given by Decker and Keller [D.W. Decker, H.B. Keller, Multiple limit point bifurcation, J. Math. Anal. Appl. 75 (1980) 417–430], and may be more easily examined than those given by Bai [Z.-Z. Bai, Eigenvalue estimates for saddle point matrices of Hermitian and indefinite leading blocks, J. Comput. Appl. Math. 237 (2013) 295–306] from the computational viewpoint. We also derive general formulas for the rank of the block two-by-two matrix by utilizing either the unitarily compressed or the orthogonally projected sub-matrices.     

Iterative method for computing the Moore-Penrose inverse based on Penrose equations

An iterative algorithm for estimating the Moore-Penrose generalized inverse is developed. The main motive for the construction of the algorithm is simultaneous usage of Penrose equations (2) and (4). Convergence properties of the introduced method as well as their first-order and second-order error terms are considered. Numerical experiment is also presented.     

Particular formulae for the Moore-Penrose inverse of a columnwise partitioned matrix

An essential part of Cegielski’s [Obtuse cones and Gram matrices with non-negative inverse, Linear Algebra Appl. 335 (2001) 167-181] considerations of some properties of Gram matrices with nonnegative inverses, which are pointed out to be crucial in constructing obtuse cones, consists in developing some particular formulae for the Moore-Penrose inverse of a columnwise partitioned matrix A = (A₁ : A₂) under the assumption that it is of full column rank. In the present paper, these results are generalized and extended. The generalization consists in weakening the assumption mentioned above to the requirement that the ranges of A₁ and A₂ are disjoint, while the extension consists in introducing the conditions referring to the class of all generalized inverses of A.     

Convexity of the inverse and Moore-Penrose inverse

Convexity properties of the inverse of positive definite matrices and the Moore-Penrose inverse of nonnegative definite matrices with respect to the partial ordering induced by nonnegative definiteness are studied. For the positive definite case null-space characterizations are derived, and lead naturally to a concept of strong convexity of a matrix function, extending the conventional concept of strict convexity. The positive definite results are shown to allow for a unified analysis of problems in reproducing kernel Hilbert space theory and inequalities involving matrix means. The main results comprise a detailed study of the convexity properties of the Moore-Penrose inverse, providing extensions and generalizations of all the earlier work in this area.     

Infinite triangular matrices, q-Pascal matrices, and determinantal representations

We use basic properties of infinite lower triangular matrices and the connections of Toeplitz matrices with generating-functions to obtain inversion formulas for several types of q-Pascal matrices, determinantal representations for polynomial sequences, and identities involving the q-Gaussian coefficients. We also obtain a fast inversion algorithm for general infinite lower triangular matrices.     

Shorted operators of partitioned matrices and application

In this paper, our main objective is to study the effect of appending/deleting a column/row on the shorted operators. It turns out that for matrices A and B for which the shorted operator S(A|B) exists, S(A₁|B₁) of the matrix A₁=[A:a] with respect to the matrix B₁=[B:b], when it exists, is obtained by appending a suitable column to S(A|B). Moreover, if S(A₁|B₁) exists, then S(A|B) exists and is obtained from S(A₁|B₁) by dropping its last column. In the process, we study the effect of appending/deleting a column/row on the space pre-order and the parallel sum of parallel summable matrices. Finally, we specialize to the case of and matrices and study the effect of bordering (by an additional column and a row) on the shorted operator. We conclude the paper with an application to Linear Models with singular dispersion structure.     

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     

Additive results for the Wg-Drazin inverse

In this paper we prove the formula for the expression (A+B)^d,W in terms of A,B,W,A^d,W,B^d,W, assuming some conditions for A,B and W. Here S^d,W denotes the generalized W-weighted Drazin inverse of a linear bounded operator S on a Banach space.     

Infinite analogues of block toeplitz matrices and related orthogonal functions

This paper concerns a class of infinite block matrices that are analogous to finite block Toeplitz matrices. Also studied are corresponding matrix-valued functions that are orthogonal for a matrixvalued inner product. An appendix presents basic results on orthogonalization in a Hilbert module.