#Z-transform question
29 messages ยท Page 1 of 1 (latest)
- Wait patiently for a helper to come along.
- Once someone helps you, say thank you and close the thread with:
+close
- Feel free to nominate the person for helper of the week in #helper-nominations
- Do not ping the mods, unless someone is breaking the rules.
- If you're happy with the help you got here, and the server overall, you can contribute financially as well:
or wait, if there are just constants they are excluded?
from the "conversion"
that explains why an is just A(z)
Hm... Let me look up Z-transform. I've heard of it, just haven't used it for recurrence relations. I assume the point is the same as Laplace transform for DE.
no problem! And yeah, you're correct its like 99% the same thing just different tables(some the same) and rules!
So, according to this, we have:
๐ต(a(n)) = A(z)
๐ต(a(n + 1)) = zA(z) - a(0)z
๐ต(a(n + 2)) = z^2 A(z) - a(0)z^2 - a(1)z
So, everything seems to be fine on the picture.
oh yeah i forgot to read that k > 0
and for just a(n) k isnt that
hence its just A(z)
Well, yeah, we take ๐ต(a(n)) = A(z) just to have a starting point, so to speak.
Yeah exactly
And for a(n + k) we just use the properties.
yeah and we stop at when z^(smt) = z^1?
Yes.
Aaaaah!!!!!!!
Tysm LordDarpinger
You're the best
i had this exam before
and funny enough i hadn't graspt this exactly thing
and i failed just cause of that
but this time i know this so now it should be better ๐
Interesting method! I've usually always just solved recurrence relations using the usual characteristic equation approach, like the linear DEs. Though, in hindsight, it's pretty obvious there should be a counterpart to Laplace transform for recurrence relations.
You're welcome!
ahaaaaa
Yeah i agree
+close