Re: fast matrix multiplication

Andrea Campera wrote:
> I know that matrix multiplication alforithm can be lower than n^3,
for
> example thew Strassen algorithm is n^2.81 and there exists algorithm
> of order n^2.3. I have also read somewhere that those algorithm are
> slightly unstable in some cases. I have also tried with MATMUL (f90)
> but the code runs slower. MAy there is a smart way to resolve
> (I+A*B)^(-1). Thanks again
>
The result wanted is

(I+A*B)^(-1)= I-A*( (I+B*A)^(-1) )*B

savings arise if B*A is smaller in dimension than A*B.


.