ABSTRACT
To this point we have defined code order-of-accuracy verification, presented a systematic order-verification procedure, and discussed each of the steps of the procedure in detail. The main goal of this chapter is to address the obvious question: What is the benefit of verifying the order of a partial differentiation equation (PDE) code? Briefly stated, the answer is that, aside from certain robustness and efficiency mistakes, code order verification finds virtually all the dynamic coding mistakes that one really cares about in a PDE code. This statement assumes, of course, that the procedure and guidelines have been followed carefully and completely.
