Concise row-pruning algorithm to invert a matrix (Q1320118): Difference between revisions

The authors present in a vector formulation an \(O(mn^ 2)\) direct concise algorithm that prunes resp. identifies the linearly dependent (ld) rows of an arbitrary \(m \times n\) matrix. Some of the salient features of this algorithm are that (i) the algorithm is concise, (ii) the minimum norm least squares solution for the equations is readily computable when the coefficient matrix is of full row rank, (iii) error bounds for the inverse as well as the solution of equations are readily computable, and (iv) error free computation of the inverse, solution vector, rank, and projection operator and its inherent parallel implementation are straightforward.