A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ Berlin

First Page		Document Content
Date: 2014-11-26 08:31:39 Mathematics Algebra Computational complexity theory Analysis of algorithms Multiplication Numerical linear algebra Matrix multiplication algorithm Matrix multiplication Strassen algorithm Fast Fourier transform Multiplication algorithm Algorithm		A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ Berlin Add to Reading List Source URL: www.cs.huji.ac.il Download Document from Source Website File Size: 465,15 KB Share Document on Facebook

	Frobenius Additive Fast Fourier Transform Wen-Ding Li Ming-Shing Chen Po-Chun Kuo DocID: 1xVYf - View Document
	Polynomials and the Fast Fourier Transform (FFT) DocID: 1xUw0 - View Document
	Lecture XI: The Fast Fourier Transform (FFT) algorithm Maxim Raginsky BME 171: Signals and Systems Duke University DocID: 1ubp9 - View Document
	Fast Fourier Transform on FPGA: Design Choices and Evaluation Peter A. Milder, Franz Franchetti, James C. Hoe, and Markus P¨uschel Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh, DocID: 1seVm - View Document
	© DIGITAL VISION A Tutorial on Fast Fourier Sampling [How to apply it to problems] C. Gilbert, DocID: 1rugj - View Document