This forum has been archived. All content is frozen. Please use KDE Discuss instead.

More efficient solve method for JacobiSVD?

Tags: None
(comma "," separated)
User avatar
dzenanz
Registered Member
Posts
35
Karma
0
OS
JacobiSVD.solve() boils down to:
Code: Select all
    dst = dec().matrixV().leftCols(diagSize)
        * invertedSingVals.asDiagonal()
        * dec().matrixU().leftCols(diagSize).adjoint()
        * rhs();
Would it make a performance improvement if everything except rhs was pre-multiplied, so it does not have to be multiplied each time solve() is called?

If yes, would that significantly decrease numerical stability?
User avatar
ggael
Moderator
Posts
3447
Karma
19
OS
yes this would significantly reduce numerical stability, and performance wise this would only make sense if the rhs have a lot of columns, and/or solve is called fot a large number of rhs. Otherwise premultiplying would be considerably slower.


Bookmarks



Who is online

Registered users: Baidu [Spider], Bing [Bot], Google [Bot], Yahoo [Bot]