function [x] = qr_factorization(A, b)
[m, n] = size(A);
for k = 1:n
x = A(k:m,k);
v = x;
v(1) = v(1)+sign(x(1))*norm(x,2);
v = v/norm(v, 2);
A(k:m, k:n) = A(k:m, k:n) - 2*v*(v'*A(k:m, k:n));
b(k:m) = b(k:m) - 2*v*(v'*b(k:m));
V(k:m,k) = v;
end
A = A(1:n,1:n);
b = b(1:n);
x = backward_substitution(A, b);
end
%Backward substitution
function x = backward_substitution(U, y)
[n, n] = size(U);
x = y;
for j=n:-1:2
x(j)=x(j)/U(j,j);
x(1:j-1)=x(1:j-1)-x(j)*U(1:j-1,j);
end
x(1)=x(1)/U(1, 1);
end
10-10
3246
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
03-06
1883
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
01-24
4159
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
09-25