Hazal Gunduz
Proof: A \(\neq\) B is not equal, just as \(A^{T}A \neq AA^{T}\) is not equal.
Demonstration: Matrix 3x3 of sequence 1 to 9:
A = matrix(seq(1,9), nrow = 3, ncol = 3)
A
## [,1] [,2] [,3]
## [1,] 1 4 7
## [2,] 2 5 8
## [3,] 3 6 9
A_T = t(A)
A_T%*%A == A%*%A_T
## [,1] [,2] [,3]
## [1,] FALSE FALSE FALSE
## [2,] FALSE FALSE FALSE
## [3,] FALSE FALSE FALSE
As we see the \(A^{T}A\) is not equal with \(AA^{T}\)
As we know, any matrix multiplied by its identity is equal to the identity multiplied by the same matrix. So the condition will be true if the matrix identity matrix.
A = matrix(c(3,1,2,1,3,1,2,1,3), nrow = 3)
A
## [,1] [,2] [,3]
## [1,] 3 1 2
## [2,] 1 3 1
## [3,] 2 1 3
A_T = t(A)
A_T%*%A == A%*%A_T
## [,1] [,2] [,3]
## [1,] TRUE TRUE TRUE
## [2,] TRUE TRUE TRUE
## [3,] TRUE TRUE TRUE
Matrix factorization is a very important problem. There are supercomputers built just to do matrix factorizations. Every second you are on an airplane, matrices are being factorized. Radars that track flights use a technique called Kalman filtering. At the heart of Kalman Filtering is a Matrix Factorization operation. Kalman Filters are solving linear systems of equations when they track your flight using radars. Write an R function to factorize a square matrix A into LU or LDU, whichever you prefer. Please submit your response in an R Markdown document using our class naming convention, E.g. LFulton_Assignment2_PS2.png You don’t have to worry about permuting rows of A and you can assume that A is less than 5x5, if you need to hard-code any variables in your code. If you doing the entire assignment in R, then please submit only one markdown document for both the problems.
A = matrix(c(1,2,3,4,5,6,7,8,9), nrow = 3, ncol = 3)
A
## [,1] [,2] [,3]
## [1,] 1 4 7
## [2,] 2 5 8
## [3,] 3 6 9
LU = function(X) {
Y = diag(nrow(X))
for (i in 2: (nrow(X))) {
for (j in i: (nrow(X))) {
temp = X[j, i-1] / X[i-1, i-1]
X[j,] = X[j,] - (X[j, i-1] / X[i-1, i-1]) * X[i-1,]
Y[j, i-1] = temp
}
}
print(X)
print(Y)
return(X%*%Y)
}
Y = LU(A)
## [,1] [,2] [,3]
## [1,] 1 4 7
## [2,] 0 -3 -6
## [3,] 0 0 0
## [,1] [,2] [,3]
## [1,] 1 0 0
## [2,] 2 1 0
## [3,] 3 2 1
Y
## [,1] [,2] [,3]
## [1,] 30 18 7
## [2,] -24 -15 -6
## [3,] 0 0 0