IVP’s With Step Functions — Question 10

PDF ↗

Question 10

Let Ha(t)=0H_a(t)=0 for t<at<a and Ha(t)=1H_a(t)=1 for t≥at\ge a. Use one-sided Laplace transforms. Solutions are continuous (and have continuous first derivative for second-order equations); satisfy the equation away from switches and use one-sided derivatives there. Isolated input values do not change the solution.

A unit input is switched on and off repeatedly: y′+y=f(t),y(0)=0,f(t)={1,2k≤t<2k+1,0,2k+1≤t<2k+2,k=0,1,2,….y'+y=f(t),\quad y(0)=0,\qquad f(t)=\begin{cases} 1,&2k\le t<2k+1,\\0,&2k+1\le t<2k+2, \end{cases}\quad k=0,1,2,\ldots. Use only step functions and a geometric series; no periodic-transform formula is needed.

Tasks

  1. Represent ff by a locally finite sum of steps, derive F(s)F(s) for s>0s>0, and obtain Y(s)Y(s) and a delayed-response series.

  2. For xk=y(2k)x_k=y(2k), derive and solve a recurrence for the samples.

  3. Find the attracting two-periodic response explicitly on one cycle and prove the exact transient error for all t≥0t\ge 0.

  4. Find its cycle minimum, maximum and mean. Does y(t)y(t) have a limit? Find the earliest T≥0T\ge 0 for which the error from the periodic response is at most 0.010.01 for every t≥Tt\ge T.

Original worksheet page 1: question and worked solution for 4-7-010
Show solutionHide solution

Question 10 – Solution

Strategy. The step series gives the transient solution, while the cycle map identifies a periodic state and its exact attraction rate.

Step 1: Transform the repeated switches. At each fixed time only finitely many terms are active: f=∑k=0∞(H2k(t)−H2k+1(t)),F=1−e−ss∑k=0∞e−2ks=1s(1+e−s),s>0.f=\sum_{k=0}^\infty(H_{2k}(t)-H_{2k+1}(t)),\qquad F=\frac{1-e^{-s}}s\sum_{k=0}^\infty e^{-2ks} =\frac 1{s(1+e^{-s})},\quad s>0. Integration of the nonnegative disjoint pulses justifies the sum. With r(t)=1−e−tr(t)=1-e^{-t} for t≥0t\ge 0, Y=1s(s+1)(1+e−s),y=∑k=0∞[H2k(t)r(t−2k)−H2k+1(t)r(t−2k−1)].Y=\frac 1{s(s+1)(1+e^{-s})},\qquad y=\sum_{k=0}^\infty[H_{2k}(t)r(t-2k)-H_{2k+1}(t)r(t-2k-1)]. This time series is locally finite; each activated response starts at zero and satisfies the required first-order equation on its active intervals.

Step 2: Solve the cycle recurrence. During the on-half, y(2k+1)=1+(xk−1)e−1y(2k+1)=1+(x_k-1)e^{-1}. During the off-half this value is multiplied by e−1e^{-1}, so xk+1=e−2xk+e−1(1−e−1),xk=m(1−e−2k),m=1e+1,x_{k+1}=e^{-2}x_k+e^{-1}(1-e^{-1}),\qquad \boxed{x_k=m(1-e^{-2k}),\quad m=\frac 1{e+1}}, using x0=0x_0=0. The cycle map has the unique fixed point mm.

Step 3: Build the periodic state and exact error. Write t=2k+τt=2k+\tau, 0≤τ<20\le\tau<2, and put M=e/(e+1)M=e/(e+1). Then yper(t)={1−(1−m)e−τ,0≤τ<1,Me−(τ−1),1≤τ<2.y_{\mathrm{per}}(t)=\begin{cases} 1-(1-m)e^{-\tau},&0\le\tau<1,\\ M e^{-(\tau-1)},&1\le\tau<2. \end{cases} The pieces match at MM, and the value at the end of the cycle is mm. Both solutions have the same forcing, so their difference satisfies d′+d=0d'+d=0 with d(0)=md(0)=m. Continuity propagates this identity across every switch: yper(t)−y(t)=me−t,t≥0.\boxed{y_{\mathrm{per}}(t)-y(t)=m e^{-t},\qquad t\ge 0.}

Step 4: Interpret the limiting cycle and tolerance. The periodic minimum is mm and maximum is MM. Integrating its equation over a cycle gives ∫02yperdt=1\int_0^2y_{\mathrm{per}}\,dt=1, so its mean is 1/21/2. The even and odd integer samples of yy tend to the different values m,Mm,M; there is no single limit. The error decreases strictly, giving the sharp time T=ln⁡(100e+1).\boxed{T=\ln\!\left(\frac{100}{e+1}\right).} Both responses have exact real transform domain s>0s>0, since their positive persistent cycles prevent convergence at or below zero.

See the diagram in the original worksheet below.

Original worksheet page 2: question and worked solution for 4-7-010

Original worksheet layout. Use Enlarge or open the PDF for a closer view.