We discuss a generalization of the Cohn---Umans method, a potent technique developed for studying the bilinear complexity of matrix multiplication by embedding matrices into an appropriate group algebra. We investigate how the Cohn---Umans method may be ...
Sparse matrix dense matrix (SMDM) multiplications are useful in block Krylov or block Lanczos methods. SMDM computations are AU, and VA, multiplication of a large sparse m x n matrix A by a matrix V of k rows of length m or a matrix U of k columns of ...
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 ...
Association for Computing Machinery
New York, NY, United States
View or Download as a PDF file.
PDFChinese translationView online with eReader.
eReaderView this article in digital edition.
Digital EditionView this article on the magazine site (external)
Magazine SiteCheck if you have access through your login credentials or your institution to get full access on this article.
Sign in