We consider the task of numerically approximating the solution of an ordinary differential equation initial value problem. A methodology is given for determining the computational complexity of finding an approximate solution with error not exceeding t. In addition, we determine the method of optimal order within a given class of methods, and show that under reasonable hypotheses, the optimal order increases as c decreases, tending to infinity as t tends to zero.
展开▼
