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.
Articles by others on the same topic
There are currently no matching articles.