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.
Keywords:
approximate bilinear complexity, approximate matrix multiplication algorithms, objective function
