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

DOI10.1007/S10559-015-9779-9MaRDI QIDQ269130zbMATH OpenOpenAlexFDO

Authors 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

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)

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

Cites work

• scientific article; zbMATH DE number 4106255 (Why is no real title available?)
• 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
• A mixed cellular method of matrix multiplication
• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
• A unified cellular method for matrix multiplication
• Fast hybrid matrix multiplication algorithms
• Gaussian elimination is not optimal
• New cellular methods for matrix multiplication
• New fast hybrid matrix multiplication algorithms
• On multiplication of 2 \(\times\) 2 matrices

Cited in

(2)

• scientific article; zbMATH DE number 4106255 (Why is no real title available?)
• Computation of a determinant and a matrix product in cellular automata

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)