Abstract
We present methods for the high-order differentiation through ordinary differential equations (ODEs), and more importantly, differential algebraic equations (DAEs). First, methods are developed that assert that the requested derivatives are really those of the solution of the ODE, and not those of the algorithm used to solve the ODE. Next, high-order solvers for DAEs are developed that in a fully automatic way turn an n-th order solution step of the DAEs into a corresponding step for an ODE initial value problem. In particular, this requires the automatic high-order solution of implicit relations, which is achieved using an iterative algorithm that converges to the exact result in at most n + 1 steps. We give examples of the performance of the method.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Hoefkens, J., Berz, M., Makino, K. (2002). Efficient High-Order Methods for ODEs and DAEs. In: Corliss, G., Faure, C., Griewank, A., Hascoët, L., Naumann, U. (eds) Automatic Differentiation of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-0075-5_41
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0075-5_41
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6543-6
Online ISBN: 978-1-4613-0075-5
eBook Packages: Springer Book Archive