Generalized matrix inversion is not harder than matrix multiplication

• Autores: Marko D. Petkovic, Predrag S. Stanimirovic
• Localización: Journal of computational and applied mathematics, ISSN 0377-0427, Vol. 230, Nº 1, 2009, págs. 270-282
• Idioma: inglés
• DOI: 10.1016/j.cam.2008.11.012
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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.