Section 8.3

Nonnegative Matrices

[14/100%]
Show
LaTeX
Problem 8.3.1

Let A=(010303020)A = \begin{pmatrix} 0 & 1 & 0 \\ 3 & 0 & 3 \\ 0 & 2 & 0 \end{pmatrix}.

?
(a)

Show that AA is irreducible.

(b)

Find the Perron root and Perron vector for AA.

(c)

Find the number of eigenvalues on the spectral circle of AA.

Problem 8.3.2

Suppose that the index of imprimitivity of a 5×55 \times 5 nonnegative irreducible matrix AA is h=3h = 3. Explain why AA must be singular with alg multA(0)=2\text{alg mult}_A(0) = 2.

?
Problem 8.3.3

Suppose that AA is a nonnegative matrix that possesses a positive spectral radius and a corresponding positive eigenvector. Does this force AA to be irreducible?

?
Problem 8.3.4

Without computing the eigenvalues or the characteristic polynomial, explain why σ(Pn)={1,ω,ω2,…,ωn−1}\sigma (P_n) = \{ 1, \omega , \omega^2, \ldots , \omega^{n-1}\}, where ω=e2πi/n\omega = e^{2\pi i/n} for

Pn=(010⋯0001⋯0⋮⋮⋱⋱⋮00⋯01100⋯0). P_n = \begin{pmatrix} 0 & 1 & 0 & \cdots & 0 \\ 0 & 0 & 1 & \cdots & 0 \\ \vdots & \vdots & \ddots & \ddots & \vdots \\ 0 & 0 & \cdots & 0 & 1 \\ 1 & 0 & 0 & \cdots & 0 \end{pmatrix}.
?
Problem 8.3.5

Determine whether

A=(0120000070200000920400010) A = \begin{pmatrix} 0 & 1 & 2 & 0 & 0 \\ 0 & 0 & 0 & 7 & 0 \\ 2 & 0 & 0 & 0 & 0 \\ 0 & 9 & 2 & 0 & 4 \\ 0 & 0 & 0 & 1 & 0 \end{pmatrix}

is reducible or irreducible.

?
Problem 8.3.6

Determine whether the matrix AA in Exercise 8.3.5 is primitive or imprimitive.

?
Problem 8.3.7

A matrix Sn×n≥0S_{n\times n} \geq 0 having row sums less than or equal to 11 with at least one row sum less than 11 is called a substochastic matrix.

?
(a)

Explain why ρ(S)≤1\rho (S) \leq 1 for every substochastic matrix.

(b)

Prove that ρ(S)<1\rho (S) < 1 for every irreducible substochastic matrix.

Problem 8.3.8

A nonnegative matrix for which each row sum is 11 is called a stochastic matrix (some say row-stochastic). Prove that if An×nA_{n\times n} is nonnegative and irreducible with r=ρ(A)r = \rho (A), then AA is similar to rPrP for some irreducible stochastic matrix PP.

?
Remark.
?

Consider D=(p10⋯00p2⋯0⋮⋮⋱⋮00⋯pn)D = \begin{pmatrix} p_1 & 0 & \cdots & 0 \\ 0 & p_2 & \cdots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \cdots & p_n \end{pmatrix}, where the pkp_k's are the components of the Perron vector for AA.

Problem 8.3.9

Wielandt constructed the matrix

Wn=(010⋯0001⋯0⋮⋮⋱⋱⋮00⋯01110⋯0) W_n = \begin{pmatrix} 0 & 1 & 0 & \cdots & 0 \\ 0 & 0 & 1 & \cdots & 0 \\ \vdots & \vdots & \ddots & \ddots & \vdots \\ 0 & 0 & \cdots & 0 & 1 \\ 1 & 1 & 0 & \cdots & 0 \end{pmatrix}

to show that Wnn2−2n+2>0W_n^{n^2-2n+2} > 0, but [Wnn2−2n+1]11=0[W_n^{n^2-2n+1}]_{11} = 0. Verify that this is true for n=4n = 4.

?
Problem 8.3.10

In the Leslie population model, explain what happens to the vector f(t)f(t) as t→∞t \to \infty depending on whether r<1r < 1, r=1r = 1, or r>1r > 1.

?
Remark.
?

The Leslie population model divides a population of females into age groups G1,…,GnG_1, \ldots , G_n, with bkb_k the birth rate and sks_k the survival rate for group GkG_k, and f(t)=(f1(t),…,fn(t))Tf(t) = (f_1(t), \ldots , f_n(t))^T the vector of group sizes at time tt, satisfying f(t+1)=Lf(t)f(t+1) = Lf(t) for the Leslie matrix LL; r=ρ(L)r = \rho (L) is the Perron root of LL, and p,qp, q are the respective Perron vectors of LL and LTL^T.

Problem 8.3.11

Use the characteristic equation to show that the Leslie matrix (from the Leslie population model) is primitive even if b1=0b_1 = 0 (assuming all other bkb_k's and sks_k's are positive).

?
Problem 8.3.12

A matrix A∈Rn×nA \in \mathbb {R}^{n \times n} is said to be essentially positive if AA is irreducible and aij≥0a_{ij} \geq 0 for every i≠ji \neq j. Prove that each of the following statements is equivalent to saying that AA is essentially positive.

?
(a)

There exists some α∈R\alpha \in \mathbb {R} such that A+αIA + \alpha I is primitive.

(b)

etA>0e^{tA} > 0 for all t>0t > 0.

Problem 8.3.13

Let AA be an essentially positive matrix as defined in Exercise 8.3.12. Prove that each of the following statements is true.

?
(a)

AA has an eigenpair (ξ,x)(\xi , x), where ξ\xi is real and x>0x > 0.

(b)

If λ\lambda is any eigenvalue for AA other than ξ\xi, then Re(λ)<ξ\mathrm{Re}\left(\lambda \right) < \xi.

(c)

ξ\xi increases when any entry in AA is increased.

Problem 8.3.14

Let A≥0A \geq 0 be an irreducible matrix, and let aij(k)a_{ij}^{(k)} denote entries in AkA^k. Prove that AA is primitive if and only if

ρ(A)=lim⁡k→∞[aij(k)]1/k. \rho (A) = \lim _{k\to \infty } \left[a_{ij}^{(k)}\right]^{1/k}.
?