An iteration converging to x∗ has exact asymptotic order p if its nonzero errors ek=xk−x∗ satisfy the displayed limit. A bound ∥ek+1∥≤C∥ek∥p instead asserts at least order p. Finite termination is treated separately because the error ratios become undefined.