7 for (
int i=0; i < Rows; i++){
11 for (
int k=0; k < Cols; k++){
14 for (
int i=0; i < Rows; i++){
15 R(k,k) += std::pow(A(i,k), 2);
17 R(k,k) = std::sqrt(R(k,k));
20 for (
int i=0; i < Rows; i++){
21 Q(i,k) = A(i,k) / R(k,k);
25 for (
int j=k+1; j < Cols; j++){
27 for (
int i=0; i < Rows; i++){
28 R(k,j) += Q(i,k) * A(i,j);
31 for (
int i=0; i < Rows; i++){
32 A(i,j) -= Q(i,k) * R(k,j);
void modifiedGramSchmidt(Matrix< Rows, Cols, Scalar > A, Matrix< Rows, Cols, Scalar > &Q, Matrix< Cols, Cols, Scalar > &R)
Produces an economy-size QR decomposition of a matrix A, A is changed.