7.6 (continued)
\( u_c(t) \)
\( \delta(t-c) \)
It turns out \[ \frac{d}{dt} u_c(t) = \delta(t-c) \]
Why?
Ramp function
As \( h \to 0 \) we get \( u_c(t) \)
Derivative
Become \( \delta(t-c) \)
\( u_c(t) \)
\( \delta(t-c) \)
It turns out \[ \frac{d}{dt} u_c(t) = \delta(t-c) \]
As \( h \to 0 \) we get \( u_c(t) \)
Become \( \delta(t-c) \)
If \( c=0 \), \( \mathcal{L} \{ \delta(t) \} = 1 \) impulse at \( t=0 \)
\( ay'' + by' + cy = \delta(t) \) with \( y(0) = y'(0) = 0 \)
\( (as^2 + bs + c)Y = 1 \)
\( Y = \frac{1}{as^2 + bs + c} \) impulse response of the system
\( ay'' + by' + cy = f(t) \) with \( y(0) = y'(0) = 0 \)
\( (as^2 + bs + c)Y = F \)
\( Y = \underbrace{\frac{1}{as^2 + bs + c}}_{\text{impulse response}} F \)
Back to \( t \):
Convolution
Convolution is treating \( f(t) \) as a bunch of impulses at different times. Collect impulse responses at various \( t \) and stack them.
The input signal \( f(t) \) is represented as a continuous curve sampled by discrete impulses.
The system impulse response is denoted as \( g(t) \).
Impulse at \( t = 0 \)
\( t = t_1 \)
\( t = t_2 \), etc.
Stack them \( \rightarrow \) actual \( y(t) \)
\[ y = \int_{0}^{t} g(t - \tau) f(\tau) d\tau \]
\[ Y = G F \]
\[ Y = \frac{G}{s} \cdot Fs \]
Using some algebra and Laplace properties:
\[ y = h(t) f(0) + \int_{0}^{t} h(t - \tau) f'(\tau) d\tau \]
interchangeable \( \rightarrow \) Duhamel's principle
Numerical method to solve y' = f(t, y). Also applicable for higher order.
Basic idea: use tangent line approx. (like in Calculus I)
y(t) (unknown) but we have its slope at all (t, y):
One point we know: (t_0, y_0)
Slope from diff. eq.
If t - t_0 is "small" this should be a "good" approx.
We can choose how far to move: t - t0 = h "step size"
Use step size of h = 0.25 to estimate y(0.5)
Two steps: t0 = 0, target t = 0.5, step = 0.25
\[ t_0 = 0 \]
\[ y_0 = 1 \] (given)
Slope at previous point
Target \( t \), stop at end of this.
Solve \( \dots \)
If \( h = 0.01 \) (50 steps)
Error is proportional to \( h \).