For a one-step translation-invariant recurrence, the amplification factor is the multiplier satisfying
The Parseval identity converts the pointwise bound into non-growth of the discrete -norm.
For
the Fourier convention gives
provided the denominator does not vanish.

Articles by others on the same topic (0)

There are currently no matching articles.