#Z-transform question

29 messages ยท Page 1 of 1 (latest)

wild crane
#

Hi, i think they missed a part, at the red line shouldn't it be: zA(z) -a0 -a1?

narrow smeltBOT
#
  1. Wait patiently for a helper to come along.
  2. Once someone helps you, say thank you and close the thread with:
+close
  1. Feel free to nominate the person for helper of the week in #helper-nominations
  2. Do not ping the mods, unless someone is breaking the rules.
  3. If you're happy with the help you got here, and the server overall, you can contribute financially as well:
wild crane
#

or wait, if there are just constants they are excluded?

#

from the "conversion"

#

that explains why an is just A(z)

copper axle
#

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.

wild crane
copper axle
wild crane
#

oh yeah i forgot to read that k > 0

#

and for just a(n) k isnt that

#

hence its just A(z)

copper axle
#

Well, yeah, we take ๐’ต(a(n)) = A(z) just to have a starting point, so to speak.

wild crane
#

Yeah exactly

copper axle
#

And for a(n + k) we just use the properties.

wild crane
#

yeah and we stop at when z^(smt) = z^1?

copper axle
#

Yes.

wild crane
#

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 ๐Ÿ˜‰

copper axle
#

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.

copper axle