Part (a): Eigenvalues of $A$.
\[\det(A - \lambda I) = \begin{vmatrix} 3-\lambda & -1 \\ 1 & 1-\lambda \end{vmatrix} = (3-\lambda)(1-\lambda) - (-1)(1) = \lambda^2 - 4\lambda + 4 = (\lambda - 2)^2.\]
So $\lambda = 2$ is a repeated eigenvalue with algebraic multiplicity 2.
Eigenspace check. Compute $A - 2I = \begin{pmatrix} 1 & -1 \\ 1 & -1 \end{pmatrix}$, which has rank 1. So the geometric multiplicity is $2 - 1 = 1$ — only one independent eigenvector. The matrix is defective; we'll need a generalized eigenvector for the second hom solution.
Eigenvector and generalized eigenvector. $(A-2I)\mathbf{v} = \mathbf{0}$ gives $v_1 - v_2 = 0$, so $\mathbf{v} = \binom{1}{1}$. Then $(A-2I)\mathbf{u} = \mathbf{v}$ gives $u_1 - u_2 = 1$; choose $\mathbf{u} = \binom{1}{0}$.
Homogeneous solutions.
\[\mathbf{x}_1(t) = \binom{1}{1}e^{2t}, \qquad \mathbf{x}_2(t) = \!\left(\binom{1}{1}t + \binom{1}{0}\right)\!e^{2t} = \binom{t+1}{t}\,e^{2t}.\]
\[(\text{a})\quad \boxed{\lambda = 2 \text{ (repeated, defective)}; \quad \mathbf{v} = \binom{1}{1}, \quad \mathbf{u} = \binom{1}{0}}\]
Part (b): Particular solution by superposition. The forcing has two pieces, so build $\mathbf{x}_p = \mathbf{x}_{p,1} + \mathbf{x}_{p,2}$.
Piece 1: exponential $\binom{2}{0}e^{t}$ with exponent $\mu = 1$. Since $\mu = 1$ is not an eigenvalue (the eigenvalue is $2$), there is no resonance. Try $\mathbf{x}_{p,1} = \mathbf{a}\,e^{t}$. Substituting into $\mathbf{x}' = A\mathbf{x} + \binom{2}{0}e^{t}$:
\[\mathbf{a}\,e^{t} = A\mathbf{a}\,e^{t} + \binom{2}{0}e^{t} \;\Longrightarrow\; (I - A)\mathbf{a} = \binom{2}{0}.\]
Compute $I - A = \begin{pmatrix} -2 & 1 \\ -1 & 0 \end{pmatrix}$ and solve:
\[\begin{pmatrix} -2 & 1 \\ -1 & 0 \end{pmatrix}\!\binom{a_1}{a_2} = \binom{2}{0} \;\Longrightarrow\; \begin{cases} -a_1 = 0 \\ -2a_1 + a_2 = 2\end{cases} \;\Longrightarrow\; \mathbf{a} = \binom{0}{2}.\]
So $\mathbf{x}_{p,1}(t) = \binom{0}{2}e^{t}$.
Piece 2: constant $\binom{0}{4}$. Try $\mathbf{x}_{p,2} = \mathbf{c}$ (constant), giving $\mathbf{0} = A\mathbf{c} + \binom{0}{4}$, i.e., $A\mathbf{c} = \binom{0}{-4}$.
\[\begin{pmatrix} 3 & -1 \\ 1 & 1 \end{pmatrix}\!\binom{c_1}{c_2} = \binom{0}{-4} \;\Longrightarrow\; \begin{cases} 3c_1 - c_2 = 0 \\ c_1 + c_2 = -4 \end{cases}.\]
From the first, $c_2 = 3c_1$; sub into the second: $4c_1 = -4 \Rightarrow c_1 = -1$, $c_2 = -3$. So $\mathbf{x}_{p,2} = \binom{-1}{-3}$.
Combine.
\[\mathbf{x}_p(t) = \binom{0}{2}e^{t} + \binom{-1}{-3} = \binom{-1}{\,2e^{t} - 3\,}.\]
\[(\text{b})\quad \boxed{\mathbf{x}_p(t) = \begin{pmatrix} -1 \\ 2e^{t} - 3 \end{pmatrix}}\]
Part (c): General solution. $\mathbf{x} = c_1\,\mathbf{x}_1 + c_2\,\mathbf{x}_2 + \mathbf{x}_p$:
\[(\text{c})\quad \boxed{\mathbf{x}(t) = c_1\binom{1}{1}e^{2t} + c_2\binom{t+1}{t}e^{2t} + \binom{-1}{\,2e^{t} - 3\,}}\]
Verification of $\mathbf{x}_p$. $\mathbf{x}_p' = \binom{0}{2e^t}$. Then $A\mathbf{x}_p = \begin{pmatrix} 3 & -1 \\ 1 & 1 \end{pmatrix}\!\binom{-1}{2e^t - 3} = \binom{-3 - 2e^t + 3}{-1 + 2e^t - 3} = \binom{-2e^t}{2e^t - 4}$. Adding $\mathbf{g}(t) = \binom{2e^t}{4}$ gives $A\mathbf{x}_p + \mathbf{g} = \binom{0}{2e^t} = \mathbf{x}_p'.$ $\checkmark$
↑ Back to question index