public class QRDecomposition extends Object
The QR-decomposition of a matrix A consists of two matrices Q and R that satisfy: A = QR, Q is orthogonal (QTQ = I), and R is upper triangular. If A is m×n, Q is m×m and R m×n.
This class compute the decomposition using Householder reflectors.
For efficiency purposes, the decomposition in packed form is transposed. This allows inner loop to iterate inside rows, which is much more cache-efficient in Java.
This class is based on the class with similar name from the JAMA library, with the following changes:
getQT
method has been added,solve
and isFullRank
methods have been replaced by a getSolver
method
and the equivalent methods provided by the returned DecompositionSolver
.Constructor and Description |
---|
QRDecomposition(RealMatrix matrix)
Calculates the QR-decomposition of the given matrix.
|
QRDecomposition(RealMatrix matrix,
double thresholdIn)
Calculates the QR-decomposition of the given matrix.
|
Modifier and Type | Method and Description |
---|---|
RealMatrix |
getH()
Returns the Householder reflector vectors.
|
RealMatrix |
getQ()
Returns the matrix Q of the decomposition.
|
RealMatrix |
getQT()
Returns the transpose of the matrix Q of the decomposition.
|
RealMatrix |
getR()
Returns the matrix R of the decomposition.
|
DecompositionSolver |
getSolver()
Get a solver for finding the A × X = B solution in least square sense.
|
public QRDecomposition(RealMatrix matrix)
matrix
- The matrix to decompose.QRDecomposition(RealMatrix,double)
public QRDecomposition(RealMatrix matrix, double thresholdIn)
matrix
- The matrix to decompose.thresholdIn
- Singularity threshold.public RealMatrix getR()
R is an upper-triangular matrix
public RealMatrix getQ()
Q is an orthogonal matrix
public RealMatrix getQT()
Q is an orthogonal matrix
public RealMatrix getH()
H is a lower trapezoidal matrix whose columns represent each successive Householder reflector vector. This matrix is used to compute Q.
public DecompositionSolver getSolver()
Copyright © 2019 CNES. All rights reserved.