The output is found by solving the equation recursively, then confirmed with a closed form from the z-transform.
Step 1: Initial values
x(k)=0 for k≤0, so x(0)=0. Put k=−1 in the equation, with x(−1)=0, u(−1)=0, u(0)=1:
x(1)−1.3679x(0)+0.3679x(−1)=0.3679u(0)+0.2642u(−1)⇒x(1)=0.3679
Step 2: Pulse transfer function
With zero initial conditions (the x(1) and u(0) terms cancel), taking z-transforms gives:
G(z)=U(z)X(z)=z2−1.3679z+0.36790.3679z+0.2642=(z−1)(z−0.3679)0.3679z+0.2642
The input is a finite sequence:
U(z)=1+0.2142z−1+0.2142z−2=z2z2+0.2142z+0.2142
Step 3: Recursive solution
x(k+2)=1.3679x(k+1)−0.3679x(k)+0.3679u(k+1)+0.2642u(k)
| k | Calculation of x(k+2) | x(k+2) |
|---|
| 0 | 1.3679(0.3679)−0+0.3679(0.2142)+0.2642(1) | 0.8463 |
| 1 | 1.3679(0.8463)−0.3679(0.3679)+0.3679(0.2142)+0.2642(0.2142) | 1.1576 |
| 2 | 1.3679(1.1576)−0.3679(0.8463)+0+0.2642(0.2142) | 1.3288 |
| 3 | 1.3679(1.3288)−0.3679(1.1576) | 1.3918 |
| 4 | 1.3679(1.3918)−0.3679(1.3288) | 1.4149 |
| 5 | 1.3679(1.4149)−0.3679(1.3918) | 1.4234 |
Step 4: Closed form for k≥3
X(z)=G(z)U(z)=z2(z−1)(z−0.3679)(0.3679z+0.2642)(z2+0.2142z+0.2142). For k≥3 only the poles at z=1 and z=0.3679 contribute to the residues of X(z)zk−1:
Resz=1Resz=0.3679=1(0.6321)(0.6321)(1.4284)=1.4284=(0.3679)2(−0.6321)(0.3995)(0.4284)(0.3679)k−1=−5.4375(0.3679)k
x(k)=1.4284−5.4375(0.3679)k,k≥3
Check: k=3 gives 1.4284−5.4375(0.04979)=1.1576, which matches.
Result
| k | 0 | 1 | 2 | 3 | 4 | 5 | 6 | ∞ |
|---|
| x(k) | 0 | 0.3679 | 0.8463 | 1.1576 | 1.3288 | 1.3918 | 1.4149 | 1.4284 |
The final value from the theorem is limz→1(1−z−1)X(z)=0.63210.6321(1+0.2142+0.2142)=1.4284.
Answer: x(0)=0, x(1)=0.3679, x(2)=0.8463, and x(k)=1.4284−5.4375(0.3679)k for k≥3. The output settles at 1.4284.
(With u(2)=−0.2142, the textbook deadbeat case, the output is exactly 1 for all k≥3.)