pub fn qr(a: &ArrayView2<'_, C64>) -> Result<(CMat, CMat)>Expand description
The thin QR decomposition $A = Q R$ of an $m \times n$ matrix, $m \ge n$.
Modified Gram–Schmidt with one re-orthogonalisation pass (“twice is enough”); the diagonal of $R$ is real and non-negative. A rank-deficient column gives a zero diagonal entry and a zero column of $Q$.
§Errors
Error::Shape if $m < n$.