Given, F0 = 0, F1 = 3, Fn+2 = 2Fn+1-2Fn
a) Now, =
i.e., =
Therefore, A = .
b) Here, = A
And, = A = A*A ,i.e., = A2
And, = A = A*A2 ,i.e., = A3
Proceeding in this way we get, = An
Therefore, k = n.
c) Now, the characteristic equation of A is, = 0
i.e., (-x)*(2-x)-1*(-2) = 0
i.e., x2-2x+2 = 0
i.e., x = 1+i, 1-i
Therefore, the eigenvalues of A are 1+i and 1-i.
Now, the eigenvectors corresponding to the eigenvalue 1+i are , where c is nonzero real.
And, the eigenvectors corresponding to the eigenvalue 1-i are , where c is nonzero real.
Let, P = . Then P is non-singular matrix.
Now, AP = = =
i.e., AP = PD
i.e., D = P-1AP
Therefore, D = and P = .
d) Here, P = .
Now, adj(P) = and det(P) = -2i.
Then, P-1 = adj(P)/det(P) = -(1/2i)
i.e., P-1 =
Therefore, P-1 = .
e) A5 = PD5P-1 =
i.e., A5 =
i.e., A5 =
i.e., A5 =
Therefore, A5 = .
f) We know that = An
Putting n = 5 we get, = A5
i.e., =
i.e., =
Therefore, F5 = 3i[(1-i)5-(1+i)5]/2
g) From previous part we get, F5 = 3i[(1-i)5-(1+i)5]/2
Replacing 5 by n we get, Fn = 3i[(1-i)n-(1+i)n]/2.
Therefore, Fn = 3i[(1-i)n-(1+i)n]/2.
(1 point) Note: In this problem, use the method from class. See the lecture notes for...
(1 point) Note: In this problem, use the method from class. See the lecture notes for January 12 on Brightspace. Also see Example 8.54 in the textbook. More examples (using real matrices) are in Section 8.6 of the textbook. Consider the sequence defined recursively by We can use matrix diagonalization to find an explicit formula for F (a) Find a matrix A that satisfies m+1 n+2 (b) Find the appropriate exponent k such that Fi -PDP- (c) Find a diagonal...
(1 point) Note: In this problem, use the method you learned in last week's tutorial. You can find the tutorial worksheet on Brightspace. Write the matrix A= as a product of elementary matrices. Do no leave any blanks. If you need fewer than five elementary matrices, fill the remaining spaces with identity matrices You may want to adjust the width of your browser window so that all matrices fit on one line
Material: 8.3.2 Consider the matrix (1 2 3 A-2 3 1 (8.3.28) (i) Use (8.3.27) to find the dominant eigenvalue of A. (ii) Check to see that u-(1 , I , î ), is a positive eigenvector of A. Use 11 and Theorem 8.6 to find the dominant eigenvalue of A and confirm that this is exactly what was obtained in part 0) obtained in part (i) or(ii ii) Compute all the eigenvalues of A directly and confirm the result...
Help Entering Answers See Example 1.6.5, in Section 1.6, in the MTH 235 Lecture Notes. (1 point) , of approximate (a) Use the Picard-Lindeloef iteration to find a sequence {yn solutions to the initial value problem y'(t) = 8t+ y(t), y(0) = 5. yo(t) = 5 yı(t) = 5+40/5t45 M yz(t) = 5+8(4/5t-10+t^5) M yz(t) = 5+8t45+256^15/75+32t10/5 M (b) Find the general term cx(t) of the n-th approximation yn (t) = ) w ck(t) = Note: Do not include the...
In this exercise you will work with LU factorization of an matrix A. Theory: Any matrix A can be reduced to an echelon form by using only row replacement and row interchanging operations. Row interchanging is almost always necessary for a computer realization because it reduces the round off errors in calculations - this strategy in computer calculation is called partial pivoting, which refers to selecting for a pivot the largest by absolute value entry in a column. The MATLAB...
Please show all work in READ-ABLE way. Thank you so much in advance. Problem 2.2 n and let X ε Rnxp be a full-rank matrix, and Assume p Note that H is a square n × n matrix. This problem is devoted to understanding the properties H Any matrix that satisfies conditions in (a) is an orthogonal projection matriz. In this problem, we will verify this directly for the H given in (1). Let V - Im(X). (b) Show that...