public interface LU<N extends Comparable<N>> extends LDU<N>, MatrixDecomposition.Pivoting<N>
Decomposes [this] into [L] and [U] (with pivot order information in an int[]) where:
Note: The number of columns in [L] and the number of rows in [U] is not specified by this interface.
The LU decomposition always exists - the compute method should always succeed - even for non-square and/or singular matrices. The primary use of the LU decomposition is in the solution of systems of simultaneous linear equations. That will, however, only work for square non-singular matrices.
Modifier and Type | Interface and Description |
---|---|
static interface |
LU.Factory<N extends Comparable<N>> |
MatrixDecomposition.Determinant<N extends Comparable<N>>, MatrixDecomposition.EconomySize<N extends Comparable<N>>, MatrixDecomposition.Hermitian<N extends Comparable<N>>, MatrixDecomposition.Ordered<N extends Comparable<N>>, MatrixDecomposition.Pivoting<N extends Comparable<N>>, MatrixDecomposition.RankRevealing<N extends Comparable<N>>, MatrixDecomposition.Solver<N extends Comparable<N>>, MatrixDecomposition.Values<N extends Comparable<N>>
Structure2D.IntRowColumn, Structure2D.Logical<S extends Structure2D,B extends Structure2D.Logical<S,B>>, Structure2D.LongRowColumn, Structure2D.ReducibleTo1D<R extends Structure1D>, Structure2D.Reshapable, Structure2D.RowColumnCallback, Structure2D.RowColumnKey<R,C>, Structure2D.RowColumnMapper<R,C>
Structure1D.BasicMapper<T>, Structure1D.IndexCallback, Structure1D.IndexMapper<T>, Structure1D.IntIndex, Structure1D.LongIndex, Structure1D.LoopCallback
Provider2D.Condition, Provider2D.Determinant<N extends Comparable<N>>, Provider2D.Eigenpairs, Provider2D.Hermitian, Provider2D.Inverse<M>, Provider2D.Rank, Provider2D.Solution<M>, Provider2D.Symmetric, Provider2D.Trace<N extends Comparable<N>>
Modifier and Type | Field and Description |
---|---|
static LU.Factory<ComplexNumber> |
COMPLEX |
static LU.Factory<Double> |
PRIMITIVE |
static LU.Factory<Quaternion> |
QUATERNION |
static LU.Factory<RationalNumber> |
RATIONAL |
TYPICAL
Modifier and Type | Method and Description |
---|---|
static <N extends Comparable<N>> |
equals(MatrixStore<N> matrix,
LU<N> decomposition,
NumberContext context) |
MatrixStore<N> |
getL() |
MatrixStore<N> |
getU()
http://en.wikipedia.org/wiki/Row_echelon_form
This is the same as [D][U]. |
default MatrixStore<N> |
reconstruct() |
compute, getInverse, getInverse, getSolution, getSolution, invert, isSolvable, solve, toInverseProvider, toSolutionProvider
preallocate, preallocate, solve, solve
invert, invert, preallocate, preallocate
getDeterminant, toDeterminantProvider
calculateDeterminant
countSignificant, getRank, getRankThreshold, isFullRank
decompose, isComputed, reset
column, column, column, column, column, count, count, countColumns, countRows, firstInColumn, firstInColumn, firstInColumn, firstInRow, firstInRow, firstInRow, getColDim, getMaxDim, getMinDim, getRowDim, index, isEmpty, isFat, isScalar, isSquare, isTall, isVector, limitOfColumn, limitOfColumn, limitOfColumn, limitOfRow, limitOfRow, limitOfRow, loopAll, loopColumn, loopColumn, loopDiagonal, loopMatching, loopRow, loopRow, mapperOf, row, row, row, row, row
index, loopAll, loopMatching, loopRange, mapper, size, toIntIndexes
decomposeWithoutPivoting, getPivotOrder, isPivoted
static final LU.Factory<ComplexNumber> COMPLEX
static final LU.Factory<Double> PRIMITIVE
static final LU.Factory<Quaternion> QUATERNION
static final LU.Factory<RationalNumber> RATIONAL
static <N extends Comparable<N>> boolean equals(MatrixStore<N> matrix, LU<N> decomposition, NumberContext context)
MatrixStore<N> getL()
MatrixStore<N> getU()
default MatrixStore<N> reconstruct()
reconstruct
in interface MatrixDecomposition<N extends Comparable<N>>
Copyright © 2022 Optimatika. All rights reserved.