Toward an Algorithm for Fast Matrix Multiplication
Abstract
The main goal of this STIR project was to study the validity of an hitherto unexplored idea towards carrying out fast matrix multiplication in O(n2 log n) operations. The significance of having such a fast algorithm for matrix multiplication at our disposal is dramatic. It would revolutionize much of computational mathematics, since it impacts a wide range of algorithms and applications, and is thus particularly relevant for very large scale computations. An O(n2 log n) algorithm for matrix multiplication could have an impact on science and technology of the 21st century that is comparable to the enormous impact of the Fast Fourier Transform (FFT) on the 20th century. The potential payoffs for aiding the Army to accomplish its mission are many, including new information technology capabilities, improved methods for signal- and image processing, as well as better data mining tools for massive, complex data sets.
Document Details
- Document Type
- DoD Grant Award
- Publication Date
- Oct 06, 2018
- Source ID
- W911NF1710380
Entities
People
- Thomas Strohmer
Organizations
- Army Contracting Command
- United States Army
- University of California, Davis