You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@commons.apache.org by tn...@apache.org on 2013/10/31 21:07:39 UTC
svn commit: r1537616 -
/commons/proper/math/trunk/src/main/java/org/apache/commons/math3/linear/EigenDecomposition.java
Author: tn
Date: Thu Oct 31 20:07:38 2013
New Revision: 1537616
URL: http://svn.apache.org/r1537616
Log:
[MATH-1045] Removed spurious code fragment with an impossible code path.
Modified:
commons/proper/math/trunk/src/main/java/org/apache/commons/math3/linear/EigenDecomposition.java
Modified: commons/proper/math/trunk/src/main/java/org/apache/commons/math3/linear/EigenDecomposition.java
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/main/java/org/apache/commons/math3/linear/EigenDecomposition.java?rev=1537616&r1=1537615&r2=1537616&view=diff
==============================================================================
--- commons/proper/math/trunk/src/main/java/org/apache/commons/math3/linear/EigenDecomposition.java (original)
+++ commons/proper/math/trunk/src/main/java/org/apache/commons/math3/linear/EigenDecomposition.java Thu Oct 31 20:07:38 2013
@@ -948,15 +948,6 @@ public class EigenDecomposition {
}
}
- // Vectors of isolated roots
- for (int i = 0; i < n; i++) {
- if (i < 0 | i > n - 1) {
- for (int j = i; j < n; j++) {
- matrixP[i][j] = matrixT[i][j];
- }
- }
- }
-
// Back transformation to get eigenvectors of original matrix
for (int j = n - 1; j >= 0; j--) {
for (int i = 0; i <= n - 1; i++) {