commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Rob Tompkins (JIRA)" <>
Subject [jira] [Updated] (MATH-1334) Resurrect Dhillon's algorithm for symmetric eigen-decomposition
Date Mon, 10 Apr 2017 14:45:41 GMT


Rob Tompkins updated MATH-1334:
    Fix Version/s: 4.X

> Resurrect Dhillon's algorithm for symmetric eigen-decomposition
> ---------------------------------------------------------------
>                 Key: MATH-1334
>                 URL:
>             Project: Commons Math
>          Issue Type: Improvement
>    Affects Versions: 3.6
>            Reporter: Dario Bahena
>             Fix For: 4.X
> Hi everyone,
> From version 2.0 => 2.1, we seem to have replaced the algorithm for calculating the
eigen-factorization of symmetric matrices. 
> You guys were previously using this specialized algorithm from Mr. Dhillon (plus other
> "This implementation is based on Inderjit Singh Dhillon thesis A New O(n2) Algorithm
for the Symmetric Tridiagonal Eigenvalue/Eigenvector Problem, on Beresford N. Parlett and
Osni A. Marques paper An Implementation of the dqds Algorithm (Positive Case) and on the corresponding
> Javadoc:
> but mysteriously, they changed the algorithm on version 2.1; and that seems to have started
the trend up to current version 3.6:
> "This implementation is based on the paper by A. Drubrulle, R.S. Martin and J.H. Wilkinson
'The Implicit QL Algorithm' in Wilksinson and Reinsch (1971) Handbook for automatic computation,
vol. 2, Linear algebra, Springer-Verlag, New-York"
> I have tested the version 3.6 and 2.0 (with some manual patches you published), and the
difference is quite significant. For a symmetric matrix of  867x867, the times following on
my laptop:
> 3.6: around 14 secs
> 2.0: around 3 secs!
> Could we consider bringing back the specialized version for symmetric cases? I sort of
feel we lost something here ;-|
> Thanks.

This message was sent by Atlassian JIRA

View raw message