

Public Member Functions | |
| QRDecomposition (Matrix A) | |
| boolean | isFullRank () |
| Matrix | getH () |
| Matrix | getR () |
| Matrix | getQ () |
| Matrix | solve (Matrix B) |
QR Decomposition.
For an m-by-n matrix A with m >= n, the QR decomposition is an m-by-n orthogonal matrix Q and an n-by-n upper triangular matrix R so that A = Q*R.
The QR decompostion always exists, even if the matrix does not have full rank, so the constructor will never fail. The primary use of the QR decomposition is in the least squares solution of nonsquare systems of simultaneous linear equations. This will fail if isFullRank() returns false.
| Jama.QRDecomposition.QRDecomposition | ( | Matrix | A | ) |
QR Decomposition, computed by Householder reflections.
| A | Rectangular matrix |
| Matrix Jama.QRDecomposition.getH | ( | ) |
Return the Householder vectors
| Matrix Jama.QRDecomposition.getQ | ( | ) |
Generate and return the (economy-sized) orthogonal factor
| Matrix Jama.QRDecomposition.getR | ( | ) |
Return the upper triangular factor
| boolean Jama.QRDecomposition.isFullRank | ( | ) |
Is the matrix full rank?

Least squares solution of A*X = B
| B | A Matrix with as many rows as A and any number of columns. |
| IllegalArgumentException | Matrix row dimensions must agree. |
| RuntimeException | Matrix is rank deficient. |

1.8.7