Editing Matrix multiplication (section)

==References==
{{Commons category|Matrix multiplication|matrix multiplication}}
{{wikibooks
|1= Linear Algebra
|2= Matrix Multiplication
|3= Matrix multiplication
}}
{{wikibooks|Applicable Mathematics|Matrices#Multiplying Matrices|Multiplying Matrices}}
{{refbegin}}
* Henry Cohn, [[Robert Kleinberg]], [[Balázs Szegedy]], and Chris Umans. Group-theoretic Algorithms for Matrix Multiplication. {{arxiv|math.GR/0511460}}. ''Proceedings of the 46th Annual Symposium on Foundations of Computer Science'', 23–25 October 2005, Pittsburgh, PA, IEEE Computer Society, pp.&nbsp;379–388.
* Henry Cohn, Chris Umans. A Group-theoretic Approach to Fast Matrix Multiplication. {{arxiv|math.GR/0307321}}. ''Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science'', 11–14 October 2003, Cambridge, MA, IEEE Computer Society, pp.&nbsp;438–449.
* {{cite journal | last1 = Coppersmith | first1 = D. | last2 = Winograd | first2 = S. | year = 1990 | title = Matrix multiplication via arithmetic progressions | journal = J. Symbolic Comput. | volume = 9 | issue = 3| pages = 251–280 | doi=10.1016/s0747-7171(08)80013-2| doi-access = free }}
* {{Citation | last1=Horn | first1=Roger A. | last2=Johnson | first2=Charles R. | title=Topics in Matrix Analysis | publisher=[[Cambridge University Press]] | isbn=978-0-521-46713-1 | year=1991}}
* [[Donald Knuth|Knuth, D.E.]], ''[[The Art of Computer Programming]] Volume 2: Seminumerical Algorithms''. Addison-Wesley Professional; 3 edition (November 14, 1997). {{isbn|978-0-201-89684-8}}. pp.&nbsp;501.
* {{Citation | last1=Press | first1=William H. | last2=Flannery | first2=Brian P. | last3=Teukolsky | first3=Saul A. | author3-link=Saul Teukolsky | last4=Vetterling | first4=William T. | title=Numerical Recipes: The Art of Scientific Computing | publisher=[[Cambridge University Press]] | edition=3rd | isbn=978-0-521-88068-8 | year=2007| title-link=Numerical Recipes }}.
* [[Ran Raz]]. On the complexity of matrix product. In Proceedings of the thirty-fourth annual ACM symposium on Theory of computing. ACM Press, 2002. {{doi|10.1145/509907.509932}}.
* Robinson, Sara, ''Toward an Optimal Algorithm for Matrix Multiplication,'' SIAM News 38(9), November 2005. [https://web.archive.org/web/20100331095603/http://www.siam.org/pdf/news/174.pdf PDF]
* Strassen, Volker, ''Gaussian Elimination is not Optimal'', Numer. Math. 13, p.&nbsp;354–356, 1969.
* {{Citation | doi=10.1016/0024-3795(73)90023-2 | last=Styan | first=George P. H. | title=Hadamard Products and Multivariate Statistical Analysis | journal=Linear Algebra and Its Applications | year=1973 | volume=6 | pages=217–240| url=http://dml.cz/bitstream/handle/10338.dmlcz/102190/CzechMathJ_37-1987-4_14.pdf | doi-access=free }}
* {{Cite book|last=Williams|first=Virginia Vassilevska|date=2012-05-19|chapter=Multiplying matrices faster than coppersmith-winograd|chapter-url=http://dl.acm.org/citation.cfm?id=2213977.2214056|publisher=ACM|pages=887–898|doi=10.1145/2213977.2214056|isbn=9781450312455|title=Proceedings of the 44th symposium on Theory of Computing - STOC '12|citeseerx=10.1.1.297.2680|s2cid=14350287}}
{{refend}}

{{Linear algebra}}

[[Category:Matrix theory]]
[[Category:Bilinear maps]]
[[Category:Multiplication]]
[[Category:Numerical linear algebra]]