public interface LU<N extends Number> 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 Number> |
MatrixDecomposition.Determinant<N extends Number>, MatrixDecomposition.EconomySize<N extends Number>, MatrixDecomposition.Hermitian<N extends Number>, MatrixDecomposition.Ordered<N extends Number>, MatrixDecomposition.Pivoting<N extends Number>, MatrixDecomposition.RankRevealing<N extends Number>, MatrixDecomposition.Solver<N extends Number>, MatrixDecomposition.Values<N extends Number>
Structure2D.IntRowColumn, Structure2D.Logical<S extends Structure2D,B extends Structure2D.Logical<S,?>>, Structure2D.LongRowColumn, Structure2D.ReducibleTo1D<R extends Structure1D>, Structure2D.RowColumnCallback, Structure2D.RowColumnKey<R,C>, Structure2D.RowColumnMapper<R,C>
Structure1D.BasicMapper<T>, Structure1D.IndexCallback, Structure1D.IndexMapper<T>, Structure1D.IntIndex, Structure1D.LongIndex, Structure1D.LoopCallback
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 |
---|---|
default boolean |
computeWithoutPivoting(ElementsSupplier<N> matrix)
Deprecated.
|
static <N extends Number> |
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]. |
static <N extends Number> |
make(Access2D<N> typical) |
default MatrixStore<N> |
reconstruct() |
static <N extends Number> |
reconstruct(LU<N> decomposition)
Deprecated.
v48 Use
reconstruct() instead |
compute, getInverse, getInverse, getSolution, getSolution, isSolvable
preallocate, preallocate, solve, solve
invert, invert, preallocate, preallocate
getDeterminant
calculateDeterminant
countSignificant, getRank, getRankThreshold, isFullRank
decompose, isComputed, reset
column, column, column, column, column, count, count, countColumns, countRows, index, index, isEmpty, isFat, isScalar, isSquare, isTall, isVector, loopAll, loopColumn, loopColumn, loopDiagonal, loopMatching, loopRow, loopRow, mapperOf, row, row, row, row, row
index, loopAll, loopMatching, loopRange, mapper, size
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 Number> boolean equals(MatrixStore<N> matrix, LU<N> decomposition, NumberContext context)
@Deprecated static <N extends Number> MatrixStore<N> reconstruct(LU<N> decomposition)
reconstruct()
instead@Deprecated default boolean computeWithoutPivoting(ElementsSupplier<N> matrix)
MatrixDecomposition.Pivoting.decomposeWithoutPivoting(Access2D.Collectable)
instead.MatrixStore<N> getL()
MatrixStore<N> getU()
default MatrixStore<N> reconstruct()
reconstruct
in interface MatrixDecomposition<N extends Number>
Copyright © 2019 Optimatika. All rights reserved.