The least number of multiplications needed for fast multiplication of \(2\times 2\) matrices of Strassen-Winograd type

zbMATH Open0970.65584MaRDI QIDQ2720612

Yongli Xing, Dejun Zhou

Publication date: 27 June 2001

Published in: Journal of Engineering Mathematics (Xi'an) (Search for Journal in Brave)

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices

This page was built for publication: The least number of multiplications needed for fast multiplication of \(2\times 2\) matrices of Strassen-Winograd type

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