Matrix multiplication for integral types using BLAS?

BLAS algorithms don't natively support integer types.

Even a naive implementation on unisgned chars without overflow checking is ~10 times slower than dgemm using doubles. I'd hope there would be a way to 1) avoid memory+time bottleneck involved in converting to intermediate floating point types. – spirov Dec 2 '09 at 2:53 portal.acm.

Org/… This is a link to some research published by acm on exact linear algebra for blas. You might query the authors on how to get the libraries they developed. – Paul Dec 3 '09 at 18:43.

You did not specify a programming language. In C++, you could interface with a matrix library such as Eigen (disclaimer: I'm associated with this project). Eigen uses vectorization so it should be pretty fast - make sure you enable vectorization - but I didn't do any experiments so I'm not sure.

There are some complicated alignment issues that may be a problem for you, but I'm not familiar with them. This SO question discusses various C++ matrix libraries, mainly in the context of computer graphics.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.