Added "final".

Moved declaration of "sum" where it is used.


git-svn-id: https://svn.apache.org/repos/asf/commons/proper/math/trunk@1166099 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Gilles Sadowski 2011-09-07 10:34:49 +00:00
parent 687cc21cb4
commit 22072e0060
1 changed files with 4 additions and 6 deletions

View File

@ -36,9 +36,9 @@ public class LUDecompositionImpl implements LUDecomposition {
/** Default bound to determine effective singularity in LU decomposition. */
private static final double DEFAULT_TOO_SMALL = 1e-11;
/** Entries of LU decomposition. */
private double lu[][];
private final double lu[][];
/** Pivot permutation associated with LU decomposition */
private int[] pivot;
private final int[] pivot;
/** Parity of the permutation associated with the LU decomposition */
private boolean even;
/** Singularity indicator. */
@ -92,12 +92,10 @@ public class LUDecompositionImpl implements LUDecomposition {
// Loop over columns
for (int col = 0; col < m; col++) {
double sum = 0;
// upper
for (int row = 0; row < col; row++) {
final double[] luRow = lu[row];
sum = luRow[col];
double sum = luRow[col];
for (int i = 0; i < row; i++) {
sum -= luRow[i] * lu[i][col];
}
@ -109,7 +107,7 @@ public class LUDecompositionImpl implements LUDecomposition {
double largest = Double.NEGATIVE_INFINITY;
for (int row = col; row < m; row++) {
final double[] luRow = lu[row];
sum = luRow[col];
double sum = luRow[col];
for (int i = 0; i < col; i++) {
sum -= luRow[i] * lu[i][col];
}