poster

Matrix Multiplication over Word-size Modular Fields Using Bini's Approximate Formula

Authors:

Brice Boyer,

Jean-Guillaume DumasAuthors Info & Claims

ACM Communications in Computer Algebra, Volume 48, Issue 3/4

Pages 100 - 102

https://doi.org/10.1145/2733693.2733699

Published: 05 February 2015 Publication History

Get Access

References

[1]

Bini, D. Relations between exact and approximate bilinear algorithms. applications. Calcolo 17 (1980), 87--97. 10.1007/BF02575865.

Crossref

Google Scholar

[2]

Boyer, B., Dumas, J.-G., Giorgi, P., Pernet, C., and Saunders, B. D. Principles of design for containers and solutions in the LinBox library. Abstract accepted for ICMS 2014, Aug. 2014.

Google Scholar

[3]

Boyer, B., Dumas, J.-G., Pernet, C., and Zhou, W. Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm. In Proceedings of the 2009 international symposium on Symbolic and algebraic computation (New York, NY, USA, 2009), ISSAC '09, ACM, pp. 55--62.

Digital Library

Google Scholar

[4]

Dumas, J.-G., Giorgi, P., and Pernet, C. Dense linear algebra over word-size prime fields: the FFLAS and FFPACK packages. ACM Trans. Math. Softw. 35, 3 (2008), 1--42.

Digital Library

Google Scholar

[5]

Strassen, V. Gaussian elimination is not optimal. Numerische Mathematik 13 (1969), 354--356.

Digital Library

Google Scholar

Recommendations

Matrix Multiplication Over Word-Size Modular Rings Using Approximate Formulas

Bini-Capovani-Lotti-Romani approximate formula (or border rank) for matrix multiplication achieves a better complexity than Strassen’s matrix multiplication formula. In this article, we show a novel way to use the approximate formula in the special case ...
Generalized matrix inversion is not harder than matrix multiplication

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 ...
Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages

In the past two decades, some major efforts have been made to reduce exact (e.g. integer, rational, polynomial) linear algebra problems to matrix multiplication in order to provide algorithms with optimal asymptotic complexity. To provide efficient ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Communications in Computer Algebra

ACM Communications in Computer Algebra Volume 48, Issue 3/4

September/December 2014

123 pages

ISSN:1932-2232

EISSN:1932-2240

DOI:10.1145/2733693

Editors:
Eugene Zima
Wilfrid Laurier University, Waterloo ON, Canada
,
Massimo Caboara
Université di Genova, Italy
,
Jean-Guillaume Dumas
Universitä Joseph Fourier, Grenoble, France
,
Laureano Gonzalez-Vega
Universidad de Cantabria, Santander, Spain
,
Michael Wester
Cotopaxi, Albuquerque NM, USA
,
Lihong Zhi
Academia Sinica, Beijing, China

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 February 2015

Published in SIGSAM-CCA Volume 48, Issue 3/4

Check for updates

Qualifiers

Poster

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
44
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Recommendations

Matrix Multiplication Over Word-Size Modular Rings Using Approximate Formulas

Generalized matrix inversion is not harder than matrix multiplication

Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages