Displaying similar documents to “Algorithms 80-81. Calculation of projections”

A new rank formula for idempotent matrices with applications

Yong Ge Tian, George P. H. Styan (2002)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

It is shown that rank ( P * A Q ) = rank ( P * A ) + rank ( A Q ) - rank ( A ) , where A is idempotent, [ P , Q ] has full row rank and P * Q = 0 . Some applications of the rank formula to generalized inverses of matrices are also presented.

Convergence of Rump's method for computing the Moore-Penrose inverse

Yunkun Chen, Xinghua Shi, Yi Min Wei (2016)

Czechoslovak Mathematical Journal

Similarity:

We extend Rump's verified method (S. Oishi, K. Tanabe, T. Ogita, S. M. Rump (2007)) for computing the inverse of extremely ill-conditioned square matrices to computing the Moore-Penrose inverse of extremely ill-conditioned rectangular matrices with full column (row) rank. We establish the convergence of our numerical verified method for computing the Moore-Penrose inverse. We also discuss the rank-deficient case and test some ill-conditioned examples. We provide our Matlab codes for...

Equalities for orthogonal projectors and their operations

Yongge Tian (2010)

Open Mathematics

Similarity:

A complex square matrix A is called an orthogonal projector if A 2 = A = A*, where A* denotes the conjugate transpose of A. In this paper, we give a comprehensive investigation to matrix expressions consisting of orthogonal projectors and their properties through ranks of matrices. We first collect some well-known rank formulas for orthogonal projectors and their operations, and then establish various new rank formulas for matrix expressions composed by orthogonal projectors. As applications,...