Fast algorithms for the basic operation of cellular methods of linear algebra

DOI10.1007/S10559-015-9779-9zbMATH Open1382.65072OpenAlexW2270454381MaRDI QIDQ269130FDOQ269130

L. D. Jelfimova

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

Recommendations

• Fast hybrid matrix multiplication algorithms
• A fast cellular method of matrix multiplication
• New cellular methods for matrix multiplication
• A mixed cellular method of matrix multiplication
• Recursive cellular methods of matrix multiplication

zbMATH Keywords

linear algebrabasic operationcellular methodfast algorithm of matrix multiplication

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical algorithms for computer arithmetic, etc. (65Y04)

Cites Work

• Gaussian elimination is not optimal
• A mixed cellular method of matrix multiplication
• Fast hybrid matrix multiplication algorithms
• On multiplication of 2 \(\times\) 2 matrices
• Title not available (Why is that?)
• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
• New fast hybrid matrix multiplication algorithms
• New cellular methods for matrix multiplication
• A unified cellular method for matrix multiplication
• A New Algorithm for Inner Product
• A fast algorithm for matrix multiplication and its efficient realization on systolic arrays
• A fast cellular method of matrix multiplication

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Fast algorithms for the basic operation of cellular methods of linear algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269130)