Fast Multiplication of Interval Matrices (Interval Version of Strassen's Algorithm)
نویسندگان
چکیده
منابع مشابه
Architecture-eecient Strassen's Matrix Multiplication: a Case Study of Divide-and-conquer Algorithms Architecture-eecient Strassen's Matrix Multiplication: a Case Study of Divide-and-conquer Algorithms
Many fast algorithms in arithmetic complexity have hierarchical or recursive structures that make eecient implementations on high performance computers with memory hierarchies non-trivial. In this paper we present our ndings on eecient implementation of Strassen's algorithmm17] for the ubiquitous operation of matrix multiplication as a model for a class of recursive algorithms. In comparison to...
متن کاملA BSP Realisation of Strassen's Algorithm
An eecient BSP realisation of Strassen's matrix multiplication algorithm is described. 1 Strassen's Algorithm Let A and B be two n n matrices and consider the problem of computing C = A B. We can regard the matrices A; B; C as each composed of four n=2 n=2 submatrices. For example, ! If the submatrices of B and C are described in the same way then we have C ij = A i0 B 0j + A i1 B 1j for all i;...
متن کاملStrassen's 2x2 matrix multiplication algorithm: A conceptual perspective
Despite its importance, all proofs of the correctness of Strassen's famous 1969 algorithm to multiply two 2x2 matrices with only seven multiplications involve some more or less tedious calculations such as explicitly multiplying specific 2x2 matrices, expanding expressions to cancel terms with opposing signs, or expanding tensors over the standard basis. This is why the proof is nontrivial to m...
متن کاملGemmw: a Portable Level 3 Blas Winograd Variant of Strassen's Matrix{matrix Multiply Algorithm
Matrix{matrix multiplication is normally computed using one of the BLAS or a reinvention of part of the BLAS. Unfortunately, the BLAS were designed with small matrices in mind. When huge, well conditioned matrices are multiplied together, the BLAS perform like the blahs, even on vector machines. For matrices where the coe cients are well conditioned, Winograd's variant of Strassen's algorithm o...
متن کاملStrassen's Algorithm for Matrix Multiplication: Modeling, Analysis, and Implementation
In this paper we report on the development of an e cient and portable implementation of Strassen's matrix multiplication algorithm for matrices of arbitrary size. Our implementation is designed to be used in place of DGEMM, the Level 3 BLAS matrix multiplication routine. Our code is designed so that e cient performance will be obtained for all matrix sizes and shapes and that the additional mem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Reliable Computing
دوره 10 شماره
صفحات -
تاریخ انتشار 2004