For a one-step translation-invariant recurrence, the amplification factor is the multiplier satisfyingThe Parseval identity converts the pointwise bound into non-growth of the discrete -norm.
New to topics? Read the docs here!
New to topics? Read the docs here!