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: RATIONAL, 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.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 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 |
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)
Deprecated.
v48 Use
reconstruct() instead |
compute, getInverse, getInverse, getSolution, getSolution, isSolvable
preallocate, preallocate, solve, solve
invert, invert, preallocate, preallocate
isFullSize
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
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)
@Deprecated static <N extends Number> MatrixStore<N> reconstruct(QR<N> decomposition)
reconstruct()
insteadMatrixStore<N> getQ()
MatrixStore<N> getR()
default 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 © 2019 Optimatika. All rights reserved.