A fast cellular method of matrix multiplication
From MaRDI portal
Recommendations
Cites work
- A fast algorithm for matrix multiplication and its efficient realization on systolic arrays
- A New Algorithm for Inner Product
- An integrated approach to the design of processor arrays with systolic organization of computations
- Gaussian elimination is not optimal
- scientific article; zbMATH DE number 4106255 (Why is no real title available?)
- scientific article; zbMATH DE number 3181418 (Why is no real title available?)
- scientific article; zbMATH DE number 15288 (Why is no real title available?)
- scientific article; zbMATH DE number 193901 (Why is no real title available?)
- scientific article; zbMATH DE number 823632 (Why is no real title available?)
Cited in
(9)- A mixed cellular method of matrix multiplication
- An ultrafast cellular method for matrix multiplication
- Fast hybrid matrix multiplication algorithms
- Fast algorithms for the basic operation of cellular methods of linear algebra
- scientific article; zbMATH DE number 4106255 (Why is no real title available?)
- New cellular methods for matrix multiplication
- A unified cellular method for matrix multiplication
- Computation of a determinant and a matrix product in cellular automata
- Recursive cellular methods of matrix multiplication
This page was built for publication: A fast cellular method of matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q946778)
