You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@commons.apache.org by lu...@apache.org on 2008/11/28 10:25:38 UTC
svn commit: r721399 -
/commons/proper/math/branches/MATH_2_0/src/java/org/apache/commons/math/linear/EigenDecompositionImpl.java
Author: luc
Date: Fri Nov 28 01:25:38 2008
New Revision: 721399
URL: http://svn.apache.org/viewvc?rev=721399&view=rev
Log:
fixed wrong loop bounds
Modified:
commons/proper/math/branches/MATH_2_0/src/java/org/apache/commons/math/linear/EigenDecompositionImpl.java
Modified: commons/proper/math/branches/MATH_2_0/src/java/org/apache/commons/math/linear/EigenDecompositionImpl.java
URL: http://svn.apache.org/viewvc/commons/proper/math/branches/MATH_2_0/src/java/org/apache/commons/math/linear/EigenDecompositionImpl.java?rev=721399&r1=721398&r2=721399&view=diff
==============================================================================
--- commons/proper/math/branches/MATH_2_0/src/java/org/apache/commons/math/linear/EigenDecompositionImpl.java (original)
+++ commons/proper/math/branches/MATH_2_0/src/java/org/apache/commons/math/linear/EigenDecompositionImpl.java Fri Nov 28 01:25:38 2008
@@ -1445,7 +1445,7 @@
// approximate contribution to norm squared from i < nn-1.
a2 = a2 + b2;
- for (int i4 = np; i4 >= 4 * start - 1 + pingPong; i4 -= 4) {
+ for (int i4 = np; i4 >= 4 * start + 2 + pingPong; i4 -= 4) {
if(b2 == 0.0) {
break;
}
@@ -1488,7 +1488,7 @@
if (end - start > 2) {
b2 = work[nn - 13] / work[nn - 15];
a2 = a2 + b2;
- for (int i4 = nn - 17; i4 >= 4 * start - 1 + pingPong; i4 -= 4) {
+ for (int i4 = nn - 17; i4 >= 4 * start + 2 + pingPong; i4 -= 4) {
if (b2 == 0.0) {
break;
}
@@ -1539,7 +1539,7 @@
double b1 = work[nn - 5] / work[nn - 7];
double b2 = b1;
if (b2 != 0.0) {
- for (int i4 = 4 * end - 9 + pingPong; i4 >= 4 * start - 1 + pingPong; i4 -= 4) {
+ for (int i4 = 4 * end - 10 + pingPong; i4 >= 4 * start + 2 + pingPong; i4 -= 4) {
final double oldB1 = b1;
if (work[i4] > work[i4 - 2]) {
return;
@@ -1583,7 +1583,7 @@
double b1 = work[nn - 5] / work[nn - 7];
double b2 = b1;
if (b2 != 0.0){
- for (int i4 = 4 * end - 9 + pingPong; i4 >= 4 * start - 1 + pingPong; i4 -= 4) {
+ for (int i4 = 4 * end - 9 + pingPong; i4 >= 4 * start + 2 + pingPong; i4 -= 4) {
if (work[i4] > work[i4 - 2]) {
return;
}