Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

In Exercises 3–6, assume that any initial vector \({x_0}\) has an eigenvector decomposition such that the coefficient \({c_1}\) in equation (1) of this section is positive.

4. Determine the evolution of the dynamical system in Example 1 when the predation parameter p is .125. (Give a formula for \({x_k}\) .) As time passes, what happens to the sizes of the owl and wood rat populations? The system tends toward what is sometimes called an unstable equilibrium. What do you think might happen to the system if some aspect of the model (such as birth rates or the predation rate) were to change slightly?

\(\)

Short Answer

Expert verified

The general solution is\({{\rm{x}}_k} = {c_1}{\left( 1 \right)^k}\left( {\begin{aligned}{}{0.8}\\1\end{aligned}} \right)\).

As \(k \to \infty \), in this situation, the population finds equilibrium, with ten thousand rats for every eight owls. The population size is solely determined by the values of \({c_1}\).

Because slight changes in birth rates or predation rates might modify the condition, this equilibrium is not considered stable.

Step by step solution

01

Given term for the vector and a matrix 

The owl and wood rat populations at time k are described by\({{\rm{x}}_k} = \left( {\begin{aligned}{}{{O_k}}\\{{R_k}}\end{aligned}} \right)\).

Where k is the number of months in a year, and the number of owls in the study area is \({O_k}\), while the number of rats is \({R_k}\) (measured in thousands). Because owls consume rats, the population of one species should have an impact on the other.

The changes in these populations can be described by the equations:

\(\)\(\begin{aligned}{}{O_{k + 1}} &= \left( {0.5} \right){O_k} + \left( {0.4} \right){R_k}\\{R_{k + 1}} &= \left( { - p} \right){O_k} + \left( {1.1} \right){R_k}\end{aligned}\)

Where p is a positive parameter to be specified.

In the matrix form,

\({{\rm{x}}_{k + 1}} = \left( {\begin{aligned}{}{0.5}&{}&{0.4}\\{ - p}&{}&{1.1}\end{aligned}} \right){{\rm{x}}_k}\)

Put the value of p in the above matrix.

\(A = \left( {\begin{aligned}{}{0.5}&{}&{0.4}\\{ - 0.125}&{}&{1.1}\end{aligned}} \right)\)

02

Find the eigenvalue 

For finding eigenvalue,

\(\det \left( {A - \lambda I} \right) = \left( {\begin{aligned}{}{0.5 - \lambda }&{0.4}\\{ - 0.125}&{1.1 - \lambda }\end{aligned}} \right)\)

So, the characteristics equation is,

\(\)

\(\begin{aligned}{}0 &= \left( {0.5 - \lambda } \right)\left( {1.1 - \lambda } \right) + \left( {0.4} \right)\left( {0.125} \right)\\ &= 0.55{\rm{ }} - {\rm{ }}1.6\lambda {\rm{ }} + {\rm{ }}{\lambda ^2}{\rm{ }} + {\rm{ }}0.05\\ &= {\lambda ^2} - {\rm{ }}1.6\lambda {\rm{ }} + {\rm{ }}0.6{\rm{ }}\\ &= \left( {\lambda {\rm{ }} - {\rm{ }}1} \right)\left( {\lambda {\rm{ }} - {\rm{ }}0.6} \right)\end{aligned}\)

The eigenvalues are 1 and \(0.6\).

When\(\lambda = 1\),

\(\begin{aligned}{}{E_1} &= Nul\left( {\begin{aligned}{}{ - 0.5}&{}&{0.4}\\{ - 0.125}&{}&{1.1}\end{aligned}} \right)\\{E_1} &= \left( {\begin{aligned}{}1&{}&{ - \frac{4}{5}}\\0&{}&0\end{aligned}} \right)\end{aligned}\)

An eigenvector is \({{\rm{v}}_1} = \left( {\begin{aligned}{}{0.8}\\1\end{aligned}} \right)\).

When \(\lambda {\rm{ }} = {\rm{ }}0.6{\rm{ }}\),

\(\begin{aligned}{}{E_{0.6}} &= Nul\left( {\begin{aligned}{}{ - 0.1}&{}&{0.4}\\{ - 0.125}&{}&{0.5}\end{aligned}} \right)\\{E_{0.6}} &= Nul\left( {\begin{aligned}{}1&{}&{ - 4}\\0&{}&0\end{aligned}} \right)\end{aligned}\)

An eigenvector is \({{\rm{v}}_2} = \left( {\begin{aligned}{}4\\1\end{aligned}} \right)\).

The general equation is,

\(\begin{aligned}{}{{\rm{x}}_k} = {c_1}{\left( 1 \right)^k}\left( {\begin{aligned}{}{0.8}\\1\end{aligned}} \right) + {c_2}{\left( {0.6} \right)^k}\left( {\begin{aligned}{}4\\1\end{aligned}} \right)\\ \to {c_1}{\left( 1 \right)^k}\left( {\begin{aligned}{}{0.8}\\1\end{aligned}} \right)\end{aligned}\)

As \(k \to \infty \), in this situation, the population finds equilibrium, with ten thousand rats for every eight owls. The population size is solely determined by the values of \({c_1}\).

Because slight changes in birth rates or predation rates might modify the condition, this equilibrium is not considered stable.

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

Question: Let \(A = \left( {\begin{array}{*{20}{c}}{.5}&{.2}&{.3}\\{.3}&{.8}&{.3}\\{.2}&0&{.4}\end{array}} \right)\), \({{\rm{v}}_1} = \left( {\begin{array}{*{20}{c}}{.3}\\{.6}\\{.1}\end{array}} \right)\), \({{\rm{v}}_2} = \left( {\begin{array}{*{20}{c}}1\\{ - 3}\\2\end{array}} \right)\), \({{\rm{v}}_3} = \left( {\begin{array}{*{20}{c}}{ - 1}\\0\\1\end{array}} \right)\) and \({\rm{w}} = \left( {\begin{array}{*{20}{c}}1\\1\\1\end{array}} \right)\).

  1. Show that \({{\rm{v}}_1}\), \({{\rm{v}}_2}\), and \({{\rm{v}}_3}\) are eigenvectors of \(A\). (Note: \(A\) is the stochastic matrix studied in Example 3 of Section 4.9.)
  2. Let \({{\rm{x}}_0}\) be any vector in \({\mathbb{R}^3}\) with non-negative entries whose sum is 1. (In section 4.9, \({{\rm{x}}_0}\) was called a probability vector.) Explain why there are constants \({c_1}\), \({c_2}\), and \({c_3}\) such that \({{\rm{x}}_0} = {c_1}{{\rm{v}}_1} + {c_2}{{\rm{v}}_2} + {c_3}{{\rm{v}}_3}\). Compute \({{\rm{w}}^T}{{\rm{x}}_0}\), and deduce that \({c_1} = 1\).
  3. For \(k = 1,2, \ldots ,\) define \({{\rm{x}}_k} = {A^k}{{\rm{x}}_0}\), with \({{\rm{x}}_0}\) as in part (b). Show that \({{\rm{x}}_k} \to {{\rm{v}}_1}\) as \(k\) increases.

[M] In Exercises 19 and 20, find (a) the largest eigenvalue and (b) the eigenvalue closest to zero. In each case, set \[{{\bf{x}}_{\bf{0}}}{\bf{ = }}\left( {{\bf{1,0,0,0}}} \right)\] and carry out approximations until the approximating sequence seems accurate to four decimal places. Include the approximate eigenvector.

20. \[A{\bf{ = }}\left[ {\begin{array}{*{20}{c}}{\bf{1}}&{\bf{2}}&{\bf{3}}&{\bf{2}}\\{\bf{2}}&{{\bf{12}}}&{{\bf{13}}}&{{\bf{11}}}\\{{\bf{ - 2}}}&{\bf{3}}&{\bf{0}}&{\bf{2}}\\{\bf{4}}&{\bf{5}}&{\bf{7}}&{\bf{2}}\end{array}} \right]\]

Question: Is \(\left( {\begin{array}{*{20}{c}}1\\{ - 2}\\1\end{array}} \right)\) an eigenvector of\(\left){\begin{array}{*{20}{c}}3&6&7\\3&3&7\\5&6&5\end{array}} \right)\)? If so, find the eigenvalue.

Let\(B = \left\{ {{{\bf{b}}_{\bf{1}}},{{\bf{b}}_{\bf{2}}},{{\bf{b}}_{\bf{3}}}} \right\}\) and \(D = \left\{ {{{\bf{d}}_{\bf{1}}},{{\bf{d}}_{\bf{2}}}} \right\}\) be bases for vector space \(V\) and \(W\), respectively. Let \(T:V \to W\) be a linear transformation with the property that

\(T\left( {{{\bf{b}}_1}} \right) = 3{{\bf{d}}_1} - 5{{\bf{d}}_2}\), \(T\left( {{{\bf{b}}_2}} \right) = - {{\bf{d}}_1} + 6{{\bf{d}}_2}\), \(T\left( {{{\bf{b}}_3}} \right) = 4{{\bf{d}}_2}\)

Find the matrix for \(T\) relative to \(B\), and\(D\).

Show that \(I - A\) is invertible when all the eigenvalues of \(A\) are less than 1 in magnitude. (Hint: What would be true if \(I - A\) were not invertible?)

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