Home | History | Annotate | Download | only in linear

Lines Matching refs:lu

30  * L, U and P that satisfy: PA = LU, L is lower triangular, and U is
46 /** Entries of LU decomposition. */
47 private T lu[][];
49 /** Pivot permutation associated with LU decomposition */
52 /** Parity of the permutation associated with the LU decomposition */
68 * Calculates the LU-decomposition of the given matrix.
81 lu = matrix.getData();
101 final T[] luRow = lu[row];
104 sum = sum.subtract(luRow[i].multiply(lu[i][col]));
112 final T[] luRow = lu[row];
115 sum = sum.subtract(luRow[i].multiply(lu[i][col]));
119 if (lu[nonZero][col].equals(field.getZero())) {
135 tmp = lu[nonZero][i];
136 lu[nonZero][i] = lu[col][i];
137 lu[col][i] = tmp;
146 final T luDiag = lu[col][col];
148 final T[] luRow = lu[row];
161 final T[] luI = lu[i];
177 final T[] luI = lu[i];
211 determinant = determinant.multiply(lu[i][i]);
219 return new Solver<T>(field, lu, pivot, singular);
231 /** Entries of LU decomposition. */
232 private final T lu[][];
234 /** Pivot permutation associated with LU decomposition. */
243 * @param lu entries of LU decomposition
244 * @param pivot pivot permutation associated with LU decomposition
247 private Solver(final Field<T> field, final T[][] lu,
250 this.lu = lu;
286 bp[i] = bp[i].subtract(bpCol.multiply(lu[i][col]));
292 bp[col] = bp[col].divide(lu[col][col]);
295 bp[i] = bp[i].subtract(bpCol.multiply(lu[i][col]));
332 bp[i] = bp[i].subtract(bpCol.multiply(lu[i][col]));
338 bp[col] = bp[col].divide(lu[col][col]);
341 bp[i] = bp[i].subtract(bpCol.multiply(lu[i][col]));
394 final T luICol = lu[i][col];
404 final T luDiag = lu[col][col];
410 final T luICol = lu[i][col];