Nowadays, I am writing a letter about graph processing.
In the experiments of my paper, I want to write the scalability issues of my algorithm.
The performance of the algorithm depends on the busy operation.
The execution of the Matlab inv function is really good in the perspective of execution time,
but I do not know the expansion algorithm used in the Matlab inv function. Is it linear? N log n? N ^ 2? I do not know.
Is there anyone who knows the Metallab and algorithm in detail? I mean, the name of the algorithm or time complexity
Thanks
Comments
Post a Comment