public class LUDecomposition extends Object implements Serializable
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.
| Constructor and Description |
|---|
LUDecomposition(Matrix aMatrix)
LU Decomposition Structure to access L, U and piv.
|
| Modifier and Type | Method and Description |
|---|---|
double |
det()
Determinant
|
double[] |
getDoublePivot()
Return pivot permutation vector as a one-dimensional double array
|
Matrix |
getL()
Return lower triangular factor
|
int[] |
getPivot()
Return pivot permutation vector
|
Matrix |
getU()
Return upper triangular factor
|
boolean |
isNonsingular()
Is the matrix nonsingular?
|
Matrix |
solve(Matrix aMatrix)
Solve A*X = B
|
public boolean isNonsingular()
@Nonnull public int[] getPivot()
@Nonnull public double[] getDoublePivot()
public double det()
IllegalArgumentException - Matrix must be square@Nonnull @ReturnsMutableCopy public Matrix solve(@Nonnull Matrix aMatrix)
aMatrix - A Matrix with as many rows as A and any number of columns.IllegalArgumentException - Matrix row dimensions must agree.RuntimeException - Matrix is singular.Copyright © 2014–2021 Philip Helger. All rights reserved.