Numerical Algorithms

, Volume 41, Issue 2, pp 161–171 | Cite as

Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time

Article

Abstract

The cost of solving an initial value problem for index-1 differential algebraic equations to accuracy ɛ is polynomial in ln(1/ɛ). This cost is obtained for an algorithm based on the Taylor series method for solving differential algebraic equations developed by Pryce. This result extends a recent result by Corless for solutions of ordinary differential equations. The results of the standard theory of information-based complexity give exponential cost for solving ordinary differential equations, being based on a different model.

Keywords

differential algebraic equations initial value problems adaptive step-size control Taylor series structural analysis automatic differentiation 

AMS subject classification

34A09 65L80 68Q25 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    E.L. Allgower and K. Georg, Introduction to Numerical Continuation Methods (SIAM Classics in Applied Mathematics, Philadelphia, 2003).MATHGoogle Scholar
  2. [2]
    R.P. Brent, Fast multiple-precision evaluation of elementary functions, J. Assoc. Comput. Mach 23(2) (1976) 242–251.MATHMathSciNetGoogle Scholar
  3. [3]
    P.S. Bullen, D.S. Mitrinovic and P.M. Vasic, Means and Their Inequalities, Mathematics and its Applications, East European Series (D. Reidel, Dordrecht, 1988).Google Scholar
  4. [4]
    J.C. Butcher, The Numerical Analysis of Ordinary Differential Equations, (Wiley, Chichester, 1987).MATHGoogle Scholar
  5. [5]
    R.M. Corless, A new view of the computational complexity of IVP for ODE, Numer. Algorithms 31 (2002) 115–124.MATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    R.M. Corless, An elementary solution of a minimax problem arising in algorithms for automatic mesh selection, SIGSAM Bulletin: Commun. Comput. Algebra 34(4) (2001) 7–15.Google Scholar
  7. [7]
    R.M. Corless, Error backward, Chaotic Numerics, AMS Contemporary Mathematics Series 172 (1994) 31–62.MathSciNetGoogle Scholar
  8. [8]
    G. Corliss and Y.F. Chang, Solving ordinary differential equations using Taylor series, ACM Tansactions on Mathematical Software 8(2) (1982) 114–144.MATHCrossRefMathSciNetGoogle Scholar
  9. [9]
    W.H. Enright, A new error control for initial value solvers, Appl. Math. Comput. 31 (1989) 288–301.CrossRefMathSciNetGoogle Scholar
  10. [10]
    W.H. Enright, Continuous numerical methods for ODEs with defect control, J. Comp. Appl. Math 125(1–2) (2000) 159–170.MATHCrossRefMathSciNetGoogle Scholar
  11. [11]
    S. Ilie and R.M. Corless, The cost of locating singularities and rank changes, in preparation.Google Scholar
  12. [12]
    K.R. Jackson and N. Nedialkov, Some recent advances in validated methods for IVPs for ODEs, Appl. Numer. Math. 42(1) (2002) 269–284.MATHCrossRefMathSciNetGoogle Scholar
  13. [13]
    E. Hairer, S.P. Norsett, G. Wanner, Solving Ordinary Differential Equations I, Computational Mathematics Vol. 8, (Springer, Berlin Heidelberg New York 1987).Google Scholar
  14. [14]
    E. Hairer and G. Wanner, Solving Ordinary Differential Equations II, Computational Mathematics, Vol. 14, (Springer, Berlin Heidelberg New York 1991).Google Scholar
  15. [15]
    W. Kahan, Handheld calculator evaluates integrals, Hewlett-Packard J. 31(8) (1980) 23–32.MathSciNetGoogle Scholar
  16. [16]
    C. Moler, Are we there yet? Zero crossing and event handling for differential equations, Matlab News & Notes (1997) 16–17.Google Scholar
  17. [17]
    N.S. Nedialkov and J.D. Pryce, Solving differential-algebraic equations by Taylor series (I): computing Taylor coefficients, BIT, accepted.Google Scholar
  18. [18]
    N.S.Nedialkov, Private Communication.Google Scholar
  19. [19]
    H. Nguyen, Interpolation and error control schemes for DAE using continuous implicit Runge–Kutta methods, PhD thesis, Univ. of Toronto, (1995).Google Scholar
  20. [20]
    J.D. Pryce, A simple structural analysis method for DAEs, BIT 41(2) (2001) 364–394.MATHCrossRefMathSciNetGoogle Scholar
  21. [21]
    J.D. Pryce, Solving high-index DAEs by Taylor series, Numer. Algorithms 19 (1998) 195–211.MATHCrossRefMathSciNetGoogle Scholar
  22. [22]
    L. Shampine, Solving ODEs and DDEs with residual control, Appl. Numer. Math 52(1) (2005) 113–127.MATHCrossRefMathSciNetGoogle Scholar
  23. [23]
    L.F. Shampine, M.W. Reichelt and J.A. Kierzenka, Solving Index-1 DAEs in Matlab and Simulink, SIAM Rev. 41(3) (1999) 538–552.MATHCrossRefMathSciNetGoogle Scholar
  24. [24]
    G. Söderlind, Automatic control and adaptive time-stepping, Numer. Algorithms 31 (2002) 281–310.MATHCrossRefMathSciNetGoogle Scholar
  25. [25]
    A.G. Werschulz, The Computational Complexity of Differential and Integral Equations (Oxford Science, Oxford, 1991).MATHGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  1. 1.Ontario Research Centre for Computer Algebra and Department of Applied MathematicsUniversity of Western OntarioLondonCanada

Personalised recommendations