Compensating for order variation in mesh refinement for direct transcription methods II: computational experience

摘要

The numerical theory for Implicit Runge Kutta methods shows that there can be order reduction when these methods are applied to either stiff or differential algebraic equations. A previous paper introduced a way to try and compensate for this order reduction in designing mesh refinement strategies. This paper presents the results from a number of computational studies on the effectiveness of this approach. In addition, we present a new test problem which can be used to examine the efficiency of codes developed for a particular class of applications.