public interface LUDecomposition
The LUdecomposition of matrix A is a set of three matrices: P, L and U such that P×A = L×U. P is a rows permutation matrix that is used to rearrange the rows of A before so that it can be decomposed. L is a lower triangular matrix with unit diagonal terms and U is an upper triangular matrix.
This interface 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
.Modifier and Type  Method and Description 

double 
getDeterminant()
Return the determinant of the matrix

RealMatrix 
getL()
Returns the matrix L of the decomposition.

RealMatrix 
getP()
Returns the P rows permutation matrix.

int[] 
getPivot()
Returns the pivot permutation vector.

DecompositionSolver 
getSolver()
Get a solver for finding the A × X = B solution in exact linear sense.

RealMatrix 
getU()
Returns the matrix U of the decomposition.

RealMatrix getL()
L is an lowertriangular matrix
RealMatrix getU()
U is an uppertriangular matrix
RealMatrix 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()
int[] getPivot()
getP()
double getDeterminant()
DecompositionSolver getSolver()
"Copyright © 2010  2020 Adobe Systems Incorporated. All Rights Reserved"