Type a command or search the notes. Tab cycles completions. Up and down recall history when blank. Escape dismisses, then leaves the prompt.
MATH
[1251]

Methods from Stability of systems

All methods from Stability of systems.

Back to Stability of systems

Find discrete modes from a characteristic equation

For a≠0a\ne0 and

axn+1+bxn+cxn−1=0,a x_{n+1}+b x_n+c x_{n-1}=0,

try a non-trivial solution xn=Krnx_n=K r^n with K≠0K\ne0 and r≠0r\ne0. Substitution gives

Krn−1(ar2+br+c)=0.K r^{n-1}(ar^2+br+c)=0.

For this nonzero mode, the prefactor is nonzero, so its characteristic equation is

ar2+br+c=0.ar^2+br+c=0.

The zero-root case, if it occurs, is not covered by this rn−1r^{n-1} factorisation and must be checked directly in the recurrence. When the non-zero roots r1,r2r_1,r_2 are distinct, the general solution is

xn=K1r1n+K2r2n.x_n=K_1r_1^n+K_2r_2^n.

If there is a repeated non-zero root rr, the general solution is instead

xn=(K1+K2n)rn.x_n=(K_1+K_2n)r^n.

The expression ar2+br+car^2+br+c is a complex polynomial. Its non-zero roots are exactly the numbers for which the proposed exponential mode satisfies the substitution. The factor nn in the repeated-root solution matters for stability: even when ∣r∣=1|r|=1, the term nrnnr^n is unbounded.

If c=0c=0, then zero is a characteristic root and the recurrence reduces to axn+1+bxn=0a x_{n+1}+b x_n=0 for n≥1n\ge1. Here x0x_0 and x1x_1 are independent initial values. For b≠0b\ne0, the later terms are xn=x1(−b/a)n−1x_n=x_1(-b/a)^{n-1} for n≥1n\ge1; for b=0b=0, all terms from x2x_2 onward are zero. This handles the zero-root case without using 000^0.

Find continuous modes from a characteristic equation

For distinct roots r1,r2r_1,r_2 of ar2+br+c=0ar^2+br+c=0, the solution has the form

x(t)=K1er1t+K2er2t.x(t)=K_1e^{r_1t}+K_2e^{r_2t}.

For a repeated root rr, the solution has the form

x(t)=(K1+K2t)ert.x(t)=(K_1+K_2t)e^{rt}.

If r=α+iβr=\alpha+i\beta, then

ert=eαteiβt.e^{rt}=e^{\alpha t}e^{i\beta t}.

The factor eαte^{\alpha t} controls growth or decay, while eiβte^{i\beta t} supplies oscillation. When the coefficients and required solution are real, a conjugate pair α±iβ\alpha\pm i\beta (with β≠0\beta\ne0) combines into

eαt(Acos⁡(βt)+Bsin⁡(βt)),A,B∈R.e^{\alpha t}\bigl(A\cos(\beta t)+B\sin(\beta t)\bigr), \qquad A,B\in\mathbb R.

The constant-coefficient ODE method in Calculus is the same calculation, with repeated roots treated in more detail. The damped oscillator below shows each case.

On this page