QRDecomposition
class QRDecomposition (View source)
For an mbyn matrix A with m >= n, the QR decomposition is an mbyn orthogonal matrix Q and an nbyn 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.
Constants
MATRIX_RANK_EXCEPTION 

Methods
__construct(matrix $A)
QR Decomposition computed by Householder reflections.
bool
isFullRank()
Is the matrix full rank?