Sciweavers

60 search results - page 1 / 12
» Adaptive Strassen's matrix multiplication
Sort
View
ICS
2007
Tsinghua U.
13 years 11 months ago
Adaptive Strassen's matrix multiplication
Strassen’s matrix multiplication (MM) has benefits with respect to any (highly tuned) implementations of MM because Strassen’s reduces the total number of operations. Strasse...
Paolo D'Alberto, Alexandru Nicolau
ACSC
2004
IEEE
13 years 9 months ago
On Improving the Memory Access Patterns During The Execution of Strassen's Matrix Multiplication Algorithm
Matrix multiplication is a basic computing operation. Whereas it is basic, it is also very expensive with a straight forward technique of O(N3 ) runtime complexity. More complex s...
Hossam A. ElGindy, George Ferizis
ISSAC
2009
Springer
144views Mathematics» more  ISSAC 2009»
13 years 12 months ago
Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
Brice Boyer, Jean-Guillaume Dumas, Clément ...
FLAIRS
2001
13 years 6 months ago
Evolutionary Search for Matrix Multiplication Algorithms
This paperaddresses the problemof algorithm discovery, via evolutionarysearch, in the context of matrix multiplication. Thetraditional multiplicationalgorithm requiresO(n3) multip...
John F. Kolen, Phillip Bruce
TEC
2010
184views more  TEC 2010»
13 years 1 days ago
Automatic Reproduction of a Genius Algorithm: Strassen's Algorithm Revisited by Genetic Search
Abstract--In 1968, Volker Strassen, a young German mathematician, announced a clever algorithm to reduce the asymptotic complexity of n
Seunghyun Oh, Byung-Ro Moon