public interface QR<N extends Number> extends MatrixDecomposition<N>, MatrixDecomposition.Solver<N>, MatrixDecomposition.EconomySize<N>, MatrixDecomposition.Determinant<N>, MatrixDecomposition.RankRevealing<N>
You create instances of (some subclass of) this class by calling one of the static factory methods: BIG, COMPLEX, PRIMITIVE or make(Access2D)
The QR decompostion always exists, even if the matrix does not have full column rank, so the compute method will never fail. The primary use of the QR decomposition is in the least squares solution of overdetermined systems of simultaneous linear equations. This will fail if the matrix does not have full column rank. The rank must be equal to the number of columns.
Modifier and Type | Interface and Description |
---|---|
static interface |
QR.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.RankRevealing<N extends Number>, MatrixDecomposition.Solver<N extends Number>, MatrixDecomposition.Values<N extends Number>
Modifier and Type | Field and Description |
---|---|
static QR.Factory<BigDecimal> |
BIG |
static QR.Factory<ComplexNumber> |
COMPLEX |
static QR.Factory<Double> |
PRIMITIVE |
static QR.Factory<Quaternion> |
QUATERNION |
static QR.Factory<RationalNumber> |
RATIONAL |
TYPICAL
Modifier and Type | Method and Description |
---|---|
static <N extends Number> |
equals(MatrixStore<N> matrix,
QR<N> decomposition,
NumberContext context) |
MatrixStore<N> |
getQ() |
MatrixStore<N> |
getR() |
default boolean |
isFullColumnRank()
Deprecated.
v44 Use
MatrixDecomposition.RankRevealing.isFullRank() instead |
default boolean |
isOrdered()
This is a property of the algorithm/implementation, not the data.
|
static <N extends Number> |
make(Access2D<N> typical) |
default MatrixStore<N> |
reconstruct() |
static <N extends Number> |
reconstruct(QR<N> decomposition) |
compute, getInverse, getInverse, getSolution, getSolution, isSolvable
preallocate, preallocate, solve, solve
invert, invert, preallocate, preallocate
isFullSize, setFullSize
getDeterminant
calculateDeterminant
getRank, isFullRank
decompose, isComputed, reset
static final QR.Factory<BigDecimal> BIG
static final QR.Factory<ComplexNumber> COMPLEX
static final QR.Factory<Double> PRIMITIVE
static final QR.Factory<Quaternion> QUATERNION
static final QR.Factory<RationalNumber> RATIONAL
static <N extends Number> boolean equals(MatrixStore<N> matrix, QR<N> decomposition, NumberContext context)
static <N extends Number> MatrixStore<N> reconstruct(QR<N> decomposition)
MatrixStore<N> getQ()
MatrixStore<N> getR()
@Deprecated default boolean isFullColumnRank()
MatrixDecomposition.RankRevealing.isFullRank()
insteaddefault boolean isOrdered()
MatrixDecomposition.Ordered
SingularValue
, Eigenvalue
or any MatrixDecomposition.RankRevealing
decomposition.isOrdered
in interface MatrixDecomposition.Ordered<N extends Number>
default MatrixStore<N> reconstruct()
reconstruct
in interface MatrixDecomposition<N extends Number>
Copyright © 2018 Optimatika. All rights reserved.