We present a general method of solving differential-algebraic equations by expanding the solution as a Taylor series. It seems especially suitable for (piecewise) smooth problems of high index. We describe the method in general, discuss steps to be taken if the method, as initially applied, fails because it leads to a system of equations with identically singular Jacobian, and illustrate by solving two problems of index 5.
Unable to display preview. Download preview PDF.
- D.P. Bertsekas, Linear Network Optimization (MIT Press, Massachusetts and London, 1991).Google Scholar
- K.E. Brenan, S.L. Campbell and L.R. Petzold, Numerical Solution of Initial-Value Problems in Differential-Algebraic Equations (North-Holland, New York, 1989).Google Scholar
- S.L. Campbell and E. Griepentrog, Solvability of general differential algebraic equations, SIAM J. Sci. Comput. (1997, to appear).Google Scholar
- G.F. Corliss and W. Lodwick, Role of constraints in the validated solution of DAEs, Preprint, Marquette University, Milwaukee, USA (1996).Google Scholar
- H. Flanders, Automatic differentiation of composite functions, in: Automatic Differentiation of Algorithms: Theory, Implementation, and Application, eds. A. Griewank and G.F. Corliss (SIAM, Philadelphia, PA, 1991) pp. 95-99.Google Scholar
- R.J. Lohner, Enclosing the solutions of ordinary initial and boundary value problems, in: Computer Arithmetic: Scientific Computation and Programming Languages, eds. E.W. Kaucher, U.W. Kulisch and C. Ullrich, Wiley-Teubner Series in Computer Science, Stuttgart (1987) pp. 255-286.Google Scholar
- J.D. Pryce, Taylor series solution of DAEs: Local theory, Technical Report, Royal Military College of Science, Cranfield University (1998).Google Scholar