Fast algorithms for the basic operation of cellular methods of linear algebra
From MaRDI portal
Publication:269130
DOI10.1007/s10559-015-9779-9zbMath1382.65072OpenAlexW2270454381MaRDI QIDQ269130
Publication date: 18 April 2016
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-015-9779-9
Direct numerical methods for linear systems and matrix inversion (65F05) Numerical algorithms for computer arithmetic, etc. (65Y04)
Cites Work
- Unnamed Item
- New fast hybrid matrix multiplication algorithms
- New cellular methods for matrix multiplication
- A unified cellular method for matrix multiplication
- A fast cellular method of matrix multiplication
- A mixed cellular method of matrix multiplication
- Fast hybrid matrix multiplication algorithms
- Gaussian elimination is not optimal
- On multiplication of 2 \(\times\) 2 matrices
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- A New Algorithm for Inner Product
- A fast algorithm for matrix multiplication and its efficient realization on systolic arrays