DeterminantTask<N>, InverterTask<N>, MatrixDecomposition<N>, MatrixDecomposition.Determinant<N>, MatrixDecomposition.EconomySize<N>, MatrixDecomposition.Solver<N>, MatrixTask<N>, SolverTask<N>
extends Number> MatrixDecomposition<N>, MatrixDecomposition.Solver<N>, MatrixDecomposition.EconomySize<N>, MatrixDecomposition.Determinant<N>
QR: [A] = [Q][R] Decomposes [this] into [Q] and [R] where:
[Q] is an orthogonal matrix (orthonormal columns). It has the same number of rows as [this].
[R] is a right (upper) triangular matrix. It has the same number of columns as [this].
[this] = [Q][R]
Note: Either Q or R will be square. The interface does not specify which.
You create instances of (some subclass of) this class by calling one of the static factory methods:
BIG, COMPLEX, PRIMITIVE or make(Access2D)
Nested Class Summary
Modifier and Type
Interface and Description
QR.Factory< N extends Number>
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.
Copyright © 2017 Optimatika. All rights reserved.