00:01
Hello students, today we will discuss about this question.
00:04
In this question, we need to compute the qr factorization of the matrix.
00:11
So here we need to find q is equal to question mark, r is equals to question mark, and here we are given that a that is equals to 0112 -0 -101 -0 -0 -0 -0 -0 -0 -0 -1.
00:26
So by using the gramsmith algorithm.
00:31
So here first of all, factorization, decomposition of the given matrix by using the gramsmouth algorithm that can be given as a1 -dash that is equals to a1 that is equals to 0 -0 -0 and r11 that is equal to mode of a1 -dash that is equal to square root of 0 -square plus 0, square plus 0 square plus 0 square is equals to 0.
01:01
Now here, a1, that is equal to 1 divided by mode of a1 dash, multiplied by a1 dash.
01:09
So that is equals to 1 divide by 0, 0, 0.
01:13
So here, 1 divide by 1 by 0, 1 by 0, 1 by 0.
01:19
Now r12 that is equals to a1 transpose to a2 that is equals to 1 by 0 1 by 0 multiplied by 1 1111 so that is equals to 1 by 0.
01:38
Now a2 dash that is equals to a2 minus r12a1 so that is equals to we can write 111 111 minus 1 divide by 0 1 by 0 1 by 0 1 by 0 1 by 0 1 by 0 1 divide by 0 1 by 0 1 divide by 0 1 divide by 0 now r2 that is equals to mode of a2 dash so that is equal to square divide by 0 1 squared by 0 1 squared divide by 0 1 squared by 0 1 squared by 0, 1 squared divide by 0, that is equals to 1 divided by 0...