[Scilab-users] Pairwise distance of a huge amount of points

[Dang, Christophe]

Just to close the subject:

I tried to implement the algorithm with sparse matrices, and it is less efficient than scanning over one dimension: 7 times faster than the naive algorithm.

If I generate the sparse matrix from a n*(n-1)/2 vector,
it is even worse: less efficient than the naive algorithm (1.1 times longer),
this only to gain a factor 2 on the amount of points that can be handeled.

Conclusion: forget the sparse matrices for this application.

--
Christophe Dang Ngoc Chan
Mechanical calculation engineer

______________________________________________________________________

This e-mail may contain confidential and/or privileged information. If you are not the intended recipient (or have received this e-mail in error), please notify the sender immediately and destroy this e-mail. Any unauthorized copying, disclosure or distribution of the material in this e-mail is strictly forbidden.
______________________________________________________________________