commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Christian Semrau (JIRA)" <>
Subject [jira] Created: (MATH-248) Multiplying sparse matrices is slow
Date Sun, 22 Feb 2009 19:55:05 GMT
Multiplying sparse matrices is slow

                 Key: MATH-248
             Project: Commons Math
          Issue Type: Improvement
            Reporter: Christian Semrau
            Priority: Minor

The multiplication of sparse real matrices is very slow compared to real matrices: Ten times
as slow for size 200, four times as slow for size 400. The time is independent of the number
of nonzero entries, because the general algorithm inherited from AbstractRealMatrix is used.
I suggest using a specialized multiplication algorithm for matrices that are "sparse enough",
walking only over the nonzero entries in one of the matrices.

This message is automatically generated by JIRA.
You can reply to this email to add a comment to the issue online.

View raw message