On Determining the Eigenprojection and Components of a Matrix

Abstract

Matrix theory and its applications make wide use of the eigenprojections of square matrices. The present paper demonstrates that the eigenprojection of a matrix $A$ can be calculated with the use of any annihilating polynomial of A^u, where u >= ind A. This enables one to find the components and the minimal polynomial of A, as well as the Drazin inverse A^D.

9 pages. In this version, an inaccuracy in Proposition 2 is corrected and the result (explicit expressions for the eigenprojection and components of a matrix with known eigenvalues) is presented in a simpler form

References in corpus (1)

• Forest matrices around the Laplacian matrix

Cited by in corpus (7)

• Coordination in multiagent systems and Laplacian spectra of digraphs
• The Projection Method for Reaching Consensus and the Regularized Power Limit of a Stochastic Matrix
• Perturbation theory for the Fokker-Planck operator in chaos
• Addendum to the paper "On determining the eigenprojection and components of a matrix" [arXiv:math/0508197]
• The projection method for continuous-time consensus seeking
• Path integral distance for data interpretation
• Three Ways to Count Walks in a Digraph