Hi Lars,
please apologize for the late reply - could you please submit a
testcase that proves the bug and fill an issue on JIRA?
Many thanks in advance, all the best!
-Simo
http://people.apache.org/~simonetripodi/
http://simonetripodi.livejournal.com/
http://twitter.com/simonetripodi
Hi folks,
I'm looking at a few linear algebra libraries for a Java project. I need to
implement clustering of a graph whose edge weights come from a matrix
exponential. I've noticed that, of the three major math libraries I've found
available in Java (JBLAS, Colt, Commons Math), only JBLAS
I think I am under informed here.
Isn't the matrix exponential normally computed using eigen decomposition? It
seems from the series expansion that all that is involved is to exponentiate
the diagonal in the eigen vector form.
Sent from my iPhone
On May 28, 2013, at 11:18, Michael
Hi Ted,
You are not under-informed, but there is a strong possibility that I am. There
are of course many ways to compute the exponential of a matrix, the Schur
decomposition and eigendecompositions among them.
The algorithm implemented by Matlab's expm() uses a Pade approximation and a
Ah... of course. Diagonalization is not always possible.
Never mind.
On Tue, May 28, 2013 at 1:03 PM, Michael McCormick mmccorm...@runbox.comwrote:
Hi Ted,
You are not under-informed, but there is a strong possibility that I am.
There are of course many ways to compute the exponential of
