Efficient transformation of Adjacency Matrix using cache optimized C++ code

Re:Efficient transformation of Adjacency Matrix using cache ... by shepik on Saturday January 31, 2015 @07:16PM (#8978589)

I believe an efficient algorithm should combine recursive approach http://stackoverflow.com/a/28027063 with sse-based small matrices transposer http://stackoverflow.com/a/16743203

Also, a good reference point to compare performance to is math libraries, like eigen/mtl/ibm essl or something like that.

[ Parent | on HN ]

There are no comments on this comment yet.