Step Response of System with Pole in s = 0 at Infinity

pivu0
Messages
12
Reaction score
0

Homework Statement


A contininous time system has when laplace transformed, a pole in s = 0.
What is de stepresponse for the system when t goes to infinity


Homework Equations


H(s) is infinity in 0 (H(s) is unit response laplace transformed)
s(t) = h(t) * u(t) (the stepresponse is the output of a system when the input is the unit step function)(* means convolution)



The Attempt at a Solution


It's a MC
a) infinity
b) 0
c) finit

I thought the anwser is b, because when a input is put in s = infinity is would equal zero the input would only have a valeu if it is near t = 0
 
Last edited:
Physics news on Phys.org


pivu0 said:
I thought the anwser is b, because when a input is put in s = infinity is would equal zero the input would only have a valeu if it is near t = 0

No, it is step input, so it will be present from t=0 onwards.
One thing to be noted is convolution in time is multiplication in frequency domain.
Hence the system response with step input will be 1/s^2. Taking inverse Laplace transform will give you the output as function of t.
 


n.karthick said:
No, it is step input, so it will be present from t=0 onwards.
One thing to be noted is convolution in time is multiplication in frequency domain.
Hence the system response with step input will be 1/s^2. Taking inverse Laplace transform will give you the output as function of t.

I have made a mistake in OP, I ment that H(s) is the impulse reponse in s, not the unti response!
So, one can say that because there is only 1 pole in s = 0, the H(s) is 1/s ?
U(s) is also 1/s,
You say that convolution is multiplication in freq domein, do you mean S(s) = H(s)*U(s) ?
So that means the laplace transform of the step response is 1/s^2!

Thank you for your help!
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top