= Solution
{c}
A method has <numerical convergence> if it approximates the exact solution uniformly at mesh points on every fixed finite interval as $h\to0$, whenever its starting approximations converge to the corresponding exact starting values, for sufficiently smooth solutions of a well-posed initial-value problem.
The <Dahlquist equivalence theorem> states that a fixed-coefficient <linear multistep method> is convergent if and only if it is consistent and zero-stable, under the usual <Lipschitz condition> on the differential equation and convergent starting data. In this family <numerical consistency> forces the parameters found in part (a), and part (b) proves that choice is not zero-stable. All other parameter choices are inconsistent. Therefore \b[no member of the family is convergent].
Back to article page
