|
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object Jama.LUDecomposition
public class LUDecomposition
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.
Constructor Summary | |
---|---|
LUDecomposition(Matrix A)
LU Decomposition Structure to access L, U and piv. |
Method Summary | |
---|---|
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 B)
Solve A*X = B |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public LUDecomposition(Matrix A)
A
- Rectangular matrixMethod Detail |
---|
public boolean isNonsingular()
public Matrix getL()
public Matrix getU()
public int[] getPivot()
public double[] getDoublePivot()
public double det()
IllegalArgumentException
- Matrix must be squarepublic Matrix solve(Matrix 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.
|
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |