×

zbMATH — the first resource for mathematics

On simplifying assumptions of Runge-Kutta methods for index 2 differential algebraic problems. (English) Zbl 0823.65074
Author’s summary: We show a result that ensures certain order for the local error of Runge-Kutta methods for index 2 differential algebraic problems with the help of the simplifying conditions \(B(p)\), \(C(q)\), \(D(r)\) and \(A_ 1(s)\) for the differential component and \(B(p)\), \(C(q)\), and \(A_ 2(s)\) for the algebraic component.

MSC:
65L06 Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations
65L05 Numerical methods for initial value problems involving ordinary differential equations
34A34 Nonlinear ordinary differential equations and systems
Software:
RODAS
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Brenan, K. E., Petzold, L. R.: The numerical solution of higher index differential/algebraic equations by implicit methods. SIAM J. Numer. Anal.26, 976–996 (1989). · Zbl 0681.65050
[2] Brenan, K. E., Campbell, S. L., Petzold, L. R.: Numerical solution of initial value problems in differential/algebraic equations. New York: North-Holland 1989. · Zbl 0699.65057
[3] Burrage, K.: Efficiently implementable algebraic stable Runge-Kutta methods. SIAM J. Numer. Anal.19, 245–258 (1982). · Zbl 0483.65040
[4] Hairer, E., Lubich, Ch., Roche, M.: The numerical solution of differential-algebraic systems by Runge-Kutta methods. Berlin, Heidelberg, New York, Tokyo: Springer 1989 (Lecture Notes in Mathematics, Vol. 1409). · Zbl 0683.65050
[5] Hairer, E., Wanner, G.: Solving ordinary differential equations II. Stiff and differential-algebraic problems. Berlin, Heidelberg, New York, Tokyo: Springer 1991. · Zbl 0729.65051
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.