Is there any method for multiplying matrices having O(n) complexity?

Question

I want to multiply two matrices but the triple loop has O(n³) complexity. Is there any algorithm in dynamic programming to multiply two matrices with O(n) complexity?

Answer 1

The best Matrix Multiplication Algorithm known so far is the "Coppersmith-Winograd algorithm" with O(n^2.38 ) complexity but it is not used for practical purposes.

However you can always use "Strassen's algorithm" which has O(n^2.81 ) complexity but there is no such known algorithm for matrix multiplication with O(n) complexity.