In Exercises 1–4, the matrix A is followed by a sequence \(\left\{ {{{\bf{x}}_k}} \right\}\) produced by the power method. Use these data to estimate the largest eigenvalue of A, and give a corresponding eigenvector.

  1. \(A = \left( {\begin{aligned}{ {20}{c}}4&3\\1&2\end{aligned}} \right)\)

\(\left( {\begin{aligned}{ {20}{c}}1\\0\end{aligned}} \right),{\rm{ }}\left( {\begin{aligned}{ {20}{c}}1\\{.25}\end{aligned}} \right),{\rm{ }}\left( {\begin{aligned}{ {20}{c}}1\\{.3158}\end{aligned}} \right),{\rm{ }}\left( {\begin{aligned}{ {20}{c}}1\\{.3298}\end{aligned}} \right),{\rm{ }}\left( {\begin{aligned}{ {20}{c}}1\\{.3326}\end{aligned}} \right)\)

Short Answer

Expert verified

The largest eigenvalue of A is 4.9978, and the corresponding eigenvector is \(\left( {\begin{aligned}{ {20}{c}}1\\{.3326}\end{aligned}} \right)\).

Step by step solution

01

Given information

A matrix \(A = \left( {\begin{aligned}{ {20}{l}}4&3\\1&2\end{aligned}} \right)\). A sequence \(\left\{ {{x_k}} \right\}\).

02

Find the Eigenvalue

Compute the value of\(A{x_k}\)and identify the largest entry as follows:

\(A{x_0} = \left( {\begin{aligned}{ {20}{l}}4&3\\1&2\end{aligned}} \right)\left( {\begin{aligned}{ {20}{l}}1\\0\end{aligned}} \right) = \left( {\begin{aligned}{ {20}{l}}4\\1\end{aligned}} \right)\). The greatest entry is\({\mu _0} = 4\).

\(A{x_1} = \left( {\begin{aligned}{ {20}{c}}4&3\\1&2\end{aligned}} \right)\left( {\begin{aligned}{ {20}{c}}1\\{.25}\end{aligned}} \right) = \left( {\begin{aligned}{ {20}{c}}{4.75}\\{1.5}\end{aligned}} \right)\). The greatest entry is\({\mu _1} = 4.75\).

\(A{x_2} = \left( {\begin{aligned}{ {20}{c}}4&3\\1&2\end{aligned}} \right)\left( {\begin{aligned}{ {20}{c}}1\\{.3158}\end{aligned}} \right) = \left( {\begin{aligned}{ {20}{l}}{4.9474}\\{1.6316}\end{aligned}} \right)\). The greatest entry is\({\mu _2} = 4.9474\).

\(A{x_3} = \left( {\begin{aligned}{ {20}{c}}4&3\\1&2\end{aligned}} \right)\left( {\begin{aligned}{ {20}{c}}1\\{.3298}\end{aligned}} \right) = \left( {\begin{aligned}{ {20}{c}}{4.9894}\\{1.6596}\end{aligned}} \right)\). The greatest entry is\({\mu _3} = 4.9894\).

\(A{x_4} = \left( {\begin{aligned}{ {20}{c}}4&3\\1&2\end{aligned}} \right)\left( {\begin{aligned}{ {20}{c}}1\\{.3326}\end{aligned}} \right) = \left( {\begin{aligned}{ {20}{c}}{4.9978}\\{1.6652}\end{aligned}} \right)\). The greatest entry is\({\mu _4} = 4.9978\).

Hence, the largest absolute entry is 4.9978. So, the eigenvalue is equal to 4.9978. The corresponding eigenvector is \(\left( {\begin{aligned}{ {20}{c}}1\\{.3326}\end{aligned}} \right)\).

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Compute the quantities in Exercises 1-8 using the vectors

\({\mathop{\rm u}\nolimits} = \left( {\begin{array}{*{20}{c}}{ - 1}\\2\end{array}} \right),{\rm{ }}{\mathop{\rm v}\nolimits} = \left( {\begin{array}{*{20}{c}}4\\6\end{array}} \right),{\rm{ }}{\mathop{\rm w}\nolimits} = \left( {\begin{array}{*{20}{c}}3\\{ - 1}\\{ - 5}\end{array}} \right),{\rm{ }}{\mathop{\rm x}\nolimits} = \left( {\begin{array}{*{20}{c}}6\\{ - 2}\\3\end{array}} \right)\)

3. \(\frac{1}{{{\mathop{\rm w}\nolimits} \cdot {\mathop{\rm w}\nolimits} }}{\mathop{\rm w}\nolimits} \)

Consider the growth of a lilac bush. The state of this lilac bush for several years (at year’s end) is shown in the accompanying sketch. Let n(t) be the number of new branches (grown in the year t) and a(t) the number of old branches. In the sketch, the new branches are represented by shorter lines. Each old branch will grow two new branches in the following year. We assume that no branches ever die.

(a) Find the matrix A such that [nt+1at+1]=A[ntat]

(b) Verify that [11]and [2-1] are eigenvectors of A. Find the associated eigenvalues.

(c) Find closed formulas for n(t) and a(t).

For the Matrices A find real closed formulas for the trajectory x(t+1)=Ax(t)wherex(0)=[01]A=[2-332]

Question: Exercises 9-14 require techniques section 3.1. Find the characteristic polynomial of each matrix, using either a cofactor expansion or the special formula for \(3 \times 3\) determinants described prior to Exercise 15-18 in Section 3.1. [Note: Finding the characteristic polynomial of a \(3 \times 3\) matrix is not easy to do with just row operations, because the variable \(\lambda \) is involved.

13. \(\left[ {\begin{array}{*{20}{c}}6&- 2&0\\- 2&9&0\\5&8&3\end{array}} \right]\)

Question: Diagonalize the matrices in Exercises \({\bf{7--20}}\), if possible. The eigenvalues for Exercises \({\bf{11--16}}\) are as follows:\(\left( {{\bf{11}}} \right)\lambda {\bf{ = 1,2,3}}\); \(\left( {{\bf{12}}} \right)\lambda {\bf{ = 2,8}}\); \(\left( {{\bf{13}}} \right)\lambda {\bf{ = 5,1}}\); \(\left( {{\bf{14}}} \right)\lambda {\bf{ = 5,4}}\); \(\left( {{\bf{15}}} \right)\lambda {\bf{ = 3,1}}\); \(\left( {{\bf{16}}} \right)\lambda {\bf{ = 2,1}}\). For exercise \({\bf{18}}\), one eigenvalue is \(\lambda {\bf{ = 5}}\) and one eigenvector is \(\left( {{\bf{ - 2,}}\;{\bf{1,}}\;{\bf{2}}} \right)\).

9. \(\left( {\begin{array}{*{20}{c}}3&{ - 1}\\1&5\end{array}} \right)\)

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free