Resolve $Ay=b$ with fast method

43 Views Asked by At

I am looking for method that resolve equation $$Ay=b$$ I read the paper "Wiedemann's algorithm" that is one solution for fast way to find the solution instead of Gauss-Elimination. Could you suggest to me some method to find the solution of $Ay=b$ with low complex and computation time

1

There are 1 best solutions below

3
On

There is Strassen algorithm, which works at a computational complexity of $\mathcal{O}\left(N^{\log_27} \right)$.

Then there is Coppersmith Winograd algorithm at a computational complexity of $\mathcal{O}\left(N^{2.375477} \right)$.

Some recent developments have reduced the computational complexity further to $\mathcal{O}\left(N^{2.3728639} \right)$.

However, if your matrix arises out of some application, then chances are it has some structure (either in exact arithmetic or finite arithmetic), which can be exploited to gain further mileage.