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

11Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

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. © 2002 Elsevier Science B.V. All rights reserved.

Cite

CITATION STYLE

APA

Betts, J. T., Biehn, N., Campbell, S. L., & Huffman, W. P. (2002). Compensating for order variation in mesh refinement for direct transcription methods II: Computational experience. Journal of Computational and Applied Mathematics, 143(2), 237–261. https://doi.org/10.1016/S0377-0427(01)00509-X

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free