Resumen de Generalized matrix inversion is not harder than matrix multiplication

Marko D. Petkovic, Predrag S. Stanimirovic

• Starting from the Strassen method for rapid matrix multiplication and inversion as well as from the recursive Cholesky factorization algorithm, we introduced a completely block recursive algorithm for generalized Cholesky factorization of a given symmetric, positive semi-definite matrix . We used the Strassen method for matrix inversion together with the recursive generalized Cholesky factorization method, and established an algorithm for computing generalized {2,3} and {2,4} inverses. Introduced algorithms are not harder than the matrix�matrix multiplication.