

Public Member Functions | |
| LUDecomposition (Matrix A) | |
| boolean | isNonsingular () |
| Matrix | getL () |
| Matrix | getU () |
| int[] | getPivot () |
| double[] | getDoublePivot () |
| double | det () |
| Matrix | solve (Matrix B) |
LU Decomposition.
For an m-by-n matrix A with m >= n, the LU decomposition is an m-by-n unit lower triangular matrix L, an n-by-n upper triangular matrix U, and a permutation vector piv of length m so that A(piv,:) = L*U. If m < n, then L is m-by-m and U is m-by-n.
The LU decompostion with pivoting always exists, even if the matrix is singular, so the constructor will never fail. The primary use of the LU decomposition is in the solution of square systems of simultaneous linear equations. This will fail if isNonsingular() returns false.
| Jama.LUDecomposition.LUDecomposition | ( | Matrix | A | ) |
LU Decomposition
| A | Rectangular matrix |
| double Jama.LUDecomposition.det | ( | ) |
| double [] Jama.LUDecomposition.getDoublePivot | ( | ) |
Return pivot permutation vector as a one-dimensional double array
| Matrix Jama.LUDecomposition.getL | ( | ) |
Return lower triangular factor
| int [] Jama.LUDecomposition.getPivot | ( | ) |
Return pivot permutation vector
| Matrix Jama.LUDecomposition.getU | ( | ) |
Return upper triangular factor
| boolean Jama.LUDecomposition.isNonsingular | ( | ) |
Is the matrix nonsingular?

1.8.7