Abstract
It is shown that the approximate bilinear complexity of multiplying matrices of the order 2 × 2 by a matrix of the order 2 × 6 does not exceed 19. An approximate bilinear algorithm of complexity 19 is presented for this task.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have