[jira] Updated: (MATH-248) Multiplying sparse matrices is slow

["Luc Maisonobe (JIRA)" <ji...@apache.org>]

     [ https://issues.apache.org/jira/browse/MATH-248?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Luc Maisonobe updated MATH-248:
-------------------------------

    Fix Version/s: 2.0
         Assignee: Luc Maisonobe

> Multiplying sparse matrices is slow
> -----------------------------------
>
>                 Key: MATH-248
>                 URL: https://issues.apache.org/jira/browse/MATH-248
>             Project: Commons Math
>          Issue Type: Improvement
>            Reporter: Christian Semrau
>            Assignee: Luc Maisonobe
>            Priority: Minor
>             Fix For: 2.0
>
>
> 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.