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(MatrixD A)
LU Decomposition
|
| Modifier and Type | Method and Description |
|---|---|
double |
det()
Determinant
|
double[] |
getDoublePivot()
Return pivot permutation vector as a one-dimensional double array
|
MatrixD |
getL()
Return lower triangular factor
|
int[] |
getPivot()
Return pivot permutation vector
|
MatrixD |
getU()
Return upper triangular factor
|
boolean |
isNonsingular()
Is the matrix nonsingular?
|
MatrixD |
solve(MatrixD B)
Solve A*X = B
|
public LUDecomposition(MatrixD A)
A - Rectangular matrix Structure to access L, U and piv.public double det()
IllegalArgumentException - Matrix must be squarepublic double[] getDoublePivot()
public MatrixD getL()
public int[] getPivot()
public MatrixD getU()
public boolean isNonsingular()
public MatrixD solve(MatrixD B)
B - A Matrix with as many rows as A and any number of columns.IllegalArgumentException - Matrix row dimensions must agree.RuntimeException - Matrix is singular.Copyright © 2020 GSI Helmholtzzentrum für Schwerionenforschung GmbH. All rights reserved.