Our motivation is to derive the Drazin inverse matrix modification formulae utilizing inverses of adequate Peirce corners under some special cases, and a with an additive perturbation. As applications, several new results for expressions modified matrices A ?? CB CDdB are obtained, well known in literature, as Sherman-Morrison-Woodbury formula Jacobson?s Lemma, generalized.

This paper explores links between basis construction methods in Markov decision processes and power series expansions of value functions. This perspective provides a useful framework to analyze properties of existing bases, as well as provides insight into constructing more effective bases. Krylov and Bellman error bases are based on the Neumann series expansion. These bases incur very large in...

In this paper, we consider the ranks of four real matrices Gi(i = 0, 1, 2, 3) in M†, where M = M0 +M1i+M2j+M3k is an arbitrary quaternion matrix, and M† = G0 + G1i + G2j + G3k is the Moore-Penrose inverse of M . Similarly, the ranks of four real matrices in Drazin inverse of a quaternion matrix are also presented. As applications, the necessary and sufficient conditions for M† is pure real or p...

A constructive perturbation bound of the Drazin inverse of a square matrix is derived using a technique proposed by G. Stewart and based on perturbation theory for invariant subspaces. This is an improvement of the result published by the authors Wei and Li [Numer. Linear Algebra Appl., 10 (2003), pp. 563–575]. It is a totally new approach to developing perturbation bounds for the Drazin invers...

There is proposed a representation of the Drazin inverse of a given polynomial square matrix, based on the extension of the Leverrier-Faddeev algorithm. Also, an algorithm for symbolic computation of the Drazin inverse of polynomial matrix is established. This algorithm represents an extension of the papers [5], [7] and a continuation of the papers [8], [9], [10]. The implementation is develope...