commons-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From l..@apache.org
Subject svn commit: r722469 - /commons/proper/math/trunk/src/java/org/apache/commons/math/linear/EigenDecompositionImpl.java
Date Tue, 02 Dec 2008 14:32:59 GMT
Author: luc
Date: Tue Dec  2 06:32:59 2008
New Revision: 722469

URL: http://svn.apache.org/viewvc?rev=722469&view=rev
Log:
removed commented out code

Modified:
    commons/proper/math/trunk/src/java/org/apache/commons/math/linear/EigenDecompositionImpl.java

Modified: commons/proper/math/trunk/src/java/org/apache/commons/math/linear/EigenDecompositionImpl.java
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/java/org/apache/commons/math/linear/EigenDecompositionImpl.java?rev=722469&r1=722468&r2=722469&view=diff
==============================================================================
--- commons/proper/math/trunk/src/java/org/apache/commons/math/linear/EigenDecompositionImpl.java
(original)
+++ commons/proper/math/trunk/src/java/org/apache/commons/math/linear/EigenDecompositionImpl.java
Tue Dec  2 06:32:59 2008
@@ -754,19 +754,14 @@
         final int fourN1  = 4 * (n - 1);
         double sumDiag    = 0;
         double sumOffDiag = 0;
-//        qMax = Double.NEGATIVE_INFINITY;
-//        eMin = Double.POSITIVE_INFINITY;
         for (int i = 0; i < n - 1; ++i) {
             final int fourI = 4 * i;
             final double qi = work[fourI];
             final double ei = work[fourI + 2];
-//            qMax = Math.max(qMax, qi);
-//            eMin = Math.min(eMin, ei);
             sumDiag    += qi;
             sumOffDiag += ei;
         }
         final double qi = work[fourN1];
-//        qMax = Math.max(qMax, qi);
         sumDiag += qi;
 
         if (sumOffDiag == 0) {
@@ -844,7 +839,7 @@
                     for (int i = 4 * i0; i < 4 * n0 - 11; i += 4) {
                         if ((work[i + 3] <= TOLERANCE_2 * work[i]) &&
                             (work[i + 2] <= TOLERANCE_2 * sigma)) {
-                            // insert a split here
+                            // insert a split
                             work[i + 2]  = -sigma;
                             split        = i / 4;
                             qMax         = 0;
@@ -887,7 +882,6 @@
             }
 
             // apply dqd plus Li's forward test.
-//            eMin = work[4 + pingPong];
             d = work[pingPong];
             for (int i = 2 + pingPong; i < 4 * n - 2; i += 4) {
                 final int j = i - 2 * pingPong - 1;
@@ -906,16 +900,9 @@
                     work[j + 2] = work[i + 2] * (work[i] / work[j]);
                     d *= work[i + 2] / work[j];
                }
-//               eMin = Math.min(eMin, work[j + 2]);
             }
             work[4 * n - 3 - pingPong] = d;
 
-//            // find qMax
-//            qMax = Double.NEGATIVE_INFINITY;
-//            for (int i = 1 - pingPong; i < 4 * n; i += 4) {
-//                qMax = Math.max(qMax, work[i]);
-//            }
-
             // from ping to pong
             pingPong = 1 - pingPong;
 



Mime
View raw message