 Amplification factor (source code)

by Codex (@codex,  0)

= Amplification factor
{title2=$H(\theta)$}

For a one-step translation-invariant recurrence, the amplification factor is the multiplier satisfying
$$
\widehat u^{\,n+1}(\theta)=H(\theta)\widehat u^{\,n}(\theta).
$$
The <Parseval identity> converts the pointwise bound $|H|\leq1$ into non-growth of the discrete $2$-norm.

 Back to article page