Question #75212

Starting with x^(0)=[1 1 1]^T, find the dominant eigenvalue and corresponding eigenvector for the matrix A= [4 -1 1, 4 -8 1, -2 1 5] using the power mwthod

Expert's answer

Question #75212 - Math - Quantitative Methods

Starting with x(0)=[111]Tx^{\wedge}(0) = [1 1 1]^{\wedge}T , find the dominant eigenvalue and corresponding eigenvector for the matrix A=[411,481,215]A = [4 - 1 1, 4 - 8 1, -2 1 5] using the power method

Solution: the power method is described by the recurrence relation:


xk+1=AxkAxk=Ak+1x0Ak+1x0x _ {k + 1} = \frac {A x _ {k}}{\| A x _ {k} \|} = \frac {A ^ {k + 1} x _ {0}}{\| A ^ {k + 1} x _ {0} \|}


if A=[411481215]A = \left[ \begin{array}{rrr}4 & -1 & 1\\ 4 & -8 & 1\\ -2 & 1 & 5 \end{array} \right] and x0=[111]x_0 = \left[ \begin{array}{l}1\\ 1\\ 1 \end{array} \right] then Ax0=[411481215][111]=[434]Ax_0 = \left[ \begin{array}{rrr}4 & -1 & 1\\ 4 & -8 & 1\\ -2 & 1 & 5 \end{array} \right]\left[ \begin{array}{l}1\\ 1\\ 1 \end{array} \right] = \left[ \begin{array}{l}4\\ -3\\ 4 \end{array} \right] and Ax0=4\| Ax_0\| = 4

x1=14[434]=[10.751]x _ {1} = \frac {1}{4} \cdot \left[ \begin{array}{c} 4 \\ - 3 \\ 4 \end{array} \right] = \left[ \begin{array}{c} 1 \\ - 0. 7 5 \\ 1 \end{array} \right]


at each iteration the vector xx is multiplied by the matrix AA and normalized. The subsequence xkx_k ( kk \to \infty ) converges to an eigenvector associated with the dominant eigenvalue.

Using the Rayleigh quotient, we can approximate the dominant eigenvalue of A:


λ=Axxxx\lambda = \frac {A x \cdot x}{x \cdot x}


Let λi\lambda_{i} be the approximate dominant eigenvalue at the i-th iteration. After the first iteration:


λ1={Ax1=[411481215][10.751]=[5.75112.25]a n dx1=[10.751]}=0.097561\lambda_ {1} = \left\{A x _ {1} = \left[ \begin{array}{c c c} 4 & - 1 & 1 \\ 4 & - 8 & 1 \\ - 2 & 1 & 5 \end{array} \right] \left[ \begin{array}{c} 1 \\ - 0. 7 5 \\ 1 \end{array} \right] = \left[ \begin{array}{c} 5. 7 5 \\ 1 1 \\ 2. 2 5 \end{array} \right] \text {a n d} x _ {1} = \left[ \begin{array}{c} 1 \\ - 0. 7 5 \\ 1 \end{array} \right] \right\} = - 0. 0 9 7 5 6 1


Continuing this process, we obtain the sequence of approximations shown in the table:



15 iterations are required to obtain successive approximations that converge when rounded to three significant digits.

Answer: eigenvector \cong [0.09, 1, -0.06], eigenvalue \cong 7.70

Answer provided by https://www.AssignmentExpert.com

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

LATEST TUTORIALS
APPROVED BY CLIENTS