Complexity of approximate multiplication of 2×n and n×4 matrices

Recieved: 01/18/2023

Accepted: 02/10/2023

Published: 05/31/2023

Keywords: approximate bilinear complexity, approximate matrix multiplication algorithms, objective function

To cite this article

Nazarov A.A., Smirnov A.V. Complexity of approximate multiplication of 2×n and n×4 matrices. // Moscow University Journal. Series 15. Computational Mathematics and Cybernetics. 2023. N 2, p.23-30 https://doi.org/10.55959/MSU/0137–0782–15–2023–47–2–23–30.

This work is licensed under a Сreative Commons Atribiution - NonCommercial 4.0 International (CC BY-NC 4.0)

Nazarov A.A. (Lomonosov Moscow State University (MSU))
Smirnov A.V. (FBU RFCSE under the Ministry of Justice of Russia)

Abstract

Approximate bilinear algorithms for multiplication of 2 × 3 and 3 × 4 matrices (complexity 18), 2 × 4 and 4×4 matrices (complexity 24), 2×5 and 5×4 matrices (complexity 30) are presented, and approximate bilinear algorithms for multiplication of 2×n and n×4 matrices (complexity 6n) over field of characteristic zero gotten via them.