Advertisement

Sensitivity Analysis of Stiff and Non-Stiff Initial-Value Problems

  • Martin Kiehl
Part of the International Series of Numerical Mathematics book series (ISNM, volume 124)

Abstract

The solution y(t, t 0, y 0) of an initial-value problem (IVP) y(t) = f(t, y, p) with initial value y(t 0) = y 0 at a point t is a differentiable function of the initial value y 0 and the parameter vector p, provided f y and f p are continuous. The computation of the derivatives of y(t, t 0, y 0) plays an important role in the efficient numerical solution of optimal-control problems and in parameter identification.

Different implementations of numerical algorithms for the computation of ∂y(t)/∂y 0 already exist, but the techniques are often adapted to the special implementations and cannot easily be transferred to other integration methods. Here we chose a new approach that allows understanding of most of the existing implementations and may serve as theoretical basis of many more.

The basic idea is to regard the numerical approximation of ∂y(t)/∂y 0 as the solution of the variational differential equation of a linearised linear IVP with approximation of the linear right-hand side by the difference quotient of the original non-linear f.

This approach shows how integration codes can in general be extended so that the simultaneous and accurate computation of the sensitivity matrix is possible.

Keywords

Difference Approximation Integration Step Sensitivity Matrix Implicit Integration Parameter Identification Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Bock, H.: Numerical treatment of inverse problems in chemical reaction kinetics. In K. Ebert, P. Deuflhard, and W. Jäger, editors, Modelling of Chemical Reaction Systems, volume 18 of Springer Series in Chemical Physics. Springer, Heidelberg, 1981.Google Scholar
  2. [2]
    Buchauer, O.; Hiltmann, P.; Kiehl, M.: Sensitivity analysis of initial-value problems with application to shooting techniques. J Num. Math., 67:151–159, 1994.MathSciNetzbMATHCrossRefGoogle Scholar
  3. [3]
    Dormand, J.; Prince, P.: A family of embedded Runge-Kutta formulae. J. Comp. Appl. Math., 6:19–26, 1980.MathSciNetzbMATHCrossRefGoogle Scholar
  4. [4]
    Hairer, E.; Nørsett, S.; Wanner, G.: Solving Ordinary Differential Equations I. Springer, Berlin Heidelberg New York, 1987.zbMATHGoogle Scholar
  5. [5]
    Hairer, E.; Ostermann, A.: Dense output for extrapolation methods. Num. Math., 58:419–439, 1990.MathSciNetzbMATHCrossRefGoogle Scholar
  6. [6]
    Hairer, E.; Wanner, G.: Solving Ordinary Differential Equations II. Springer, Berlin Heidelberg New York, 1991.zbMATHCrossRefGoogle Scholar
  7. [7]
    Heim, A.: Parameteridentifikation in differentialalgebraischen Systemen. diploma thesis, Mathematisches Institut der TU München, 1992.Google Scholar
  8. [8]
    Oberle, H.; Grimm, G.: BNDSCO — A Program for the Numerical Solution of Optimal Control Problems. User Guide. Technical Report DLR IB 515-89/22, DLR, Germany, Oberpfaffenhofen, 1989.Google Scholar

Copyright information

© Springer Basel AG 1998

Authors and Affiliations

  • Martin Kiehl
    • 1
  1. 1.Lehrstuhl für Höhere Mathematik und Numerische MathematikTechnische Universität MünchenMünchenGermany

Personalised recommendations