|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectorg.apache.commons.math3.linear.FieldLUDecomposition<T>
T - the type of the field elementspublic class FieldLUDecomposition<T extends FieldElement<T>>
Calculates the LUP-decomposition of a square matrix.
The LUP-decomposition of a matrix A consists of three matrices L, U and P that satisfy: PA = LU, L is lower triangular, and U is upper triangular and P is a permutation matrix. All matrices are m×m.
Since field elements do not provide an ordering
operator, the permutation matrix is computed here only in order to avoid
a zero pivot element, no attempt is done to get the largest pivot
element.
This class is based on the class with similar name from the JAMA library.
getP method has been added,det method has been renamed as getDeterminant,getDoublePivot method has been removed (but the int based
getPivot method has been kept),solve and isNonSingular methods have been replaced
by a getSolver method and the equivalent methods
provided by the returned DecompositionSolver.
| Constructor Summary | |
|---|---|
FieldLUDecomposition(FieldMatrix<T> matrix)
Calculates the LU-decomposition of the given matrix. |
|
| Method Summary | |
|---|---|
T |
getDeterminant()
Return the determinant of the matrix. |
FieldMatrix<T> |
getL()
Returns the matrix L of the decomposition. |
FieldMatrix<T> |
getP()
Returns the P rows permutation matrix. |
int[] |
getPivot()
Returns the pivot permutation vector. |
FieldDecompositionSolver<T> |
getSolver()
Get a solver for finding the A × X = B solution in exact linear sense. |
FieldMatrix<T> |
getU()
Returns the matrix U of the decomposition. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public FieldLUDecomposition(FieldMatrix<T> matrix)
matrix - The matrix to decompose.
NonSquareMatrixException - if matrix is not square| Method Detail |
|---|
public FieldMatrix<T> getL()
L is a lower-triangular matrix
public FieldMatrix<T> getU()
U is an upper-triangular matrix
public FieldMatrix<T> getP()
P is a sparse matrix with exactly one element set to 1.0 in each row and each column, all other elements being set to 0.0.
The positions of the 1 elements are given by the pivot permutation vector.
getPivot()public int[] getPivot()
getP()public T getDeterminant()
public FieldDecompositionSolver<T> getSolver()
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||