Stabilität differential-algebraischer Systeme
|
|
- Tracy Jacob Carroll
- 5 years ago
- Views:
Transcription
1 Stabilität differential-algebraischer Systeme Caren Tischendorf, Universität zu Köln Elgersburger Arbeitstagung, Februar 2008 Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
2 Outline 1 Stability Observation for DAEs - Circuit Example 2 What does A-stability mean? 3 Test Equation for DAEs? 4 Numerical Analysis for DAEs Reformulated 5 Concepts of B- and G-stability for ODEs/DAEs 6 Open Questions Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
3 Stability Observation for DAEs - Circuit Example Test Circuit C 1 2 i (j,t) S V G (t) 1 2 G (t) 1 j V C 2 v(e,t) 2 Circuit Equations ė 1 + G 1 (t)e 1 + j V = 0 ė 2 + G 2 (t)e 2 + i s (j V, t) = 0 e 1 = v(e 2, t) G 1(t) = 1 ηt λ, G 2(t) = η 1 ηt λ ηt v(e 2, t) = 1 1 ηt e2 i s(j V, t) = ηtj v e 1, e 2 - node potentials j V - current through the voltage source Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
4 Stability Observation for DAEs - Circuit Example Solution with the implicit Euler method for parameters λ = 5, η = 20 and stepsize h = 0.02 Stable solution! Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
5 Stability Observation for DAEs - Circuit Example Solution with the implicit Euler method for parameters λ = 5, η = 20 and stepsize h = 0.06 Unstable solution! Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
6 Stability Observation for DAEs ODE exact solution is asymptotically stable A-stable method numerical solution is asymptotically stable DAE exact solution is asymptotically stable A-stable method numerical solution is asymptotically stable reported for the first time in U. Ascher, L. R. Petzold. Stability of computational methods for constraint dynamic systems. SIAM J. Sci. Comp. 14, pp , Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
7 A-Stability A numerical method is A-stable. Dahlquists test equation The numerical method provides asymptotically stable solutions for x = λx, Re λ < 0. The numerical method provides asymptotically stable solutions for x = Ax, Re ϱ(a) < 0.. Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
8 A-Stability A numerical method is A-stable. Dahlquists test equation The numerical method provides asymptotically stable solutions for x = λx, Re λ < 0. The numerical method provides asymptotically stable solutions for x = Ax, Re ϱ(a) < 0. Is there a test equation for DAEs? How should it look like?. Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
9 Numerical Analysis for a Second DAE Example DAE (λ 1)x 1 + λtx 2 = 0 (λ 1)x 1 + (λt 1)x 2 = 0 inherent ODE + constraint x 2 = λx 2 x 1 = λt 1 1 λ x 2 Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
10 Numerical Analysis for a Second DAE Example DAE (λ 1)x 1 + λtx 2 = 0 (λ 1)x 1 + (λt 1)x 2 = 0 numerical method implicit Euler for DAE (λ 1) x 1,n x 1,n 1 h + λt n x 2,n x 2,n 1 h = 0 (λ 1)x 1,n + (λt n 1)x 2,n = 0 inherent ODE + constraint x 2 = λx 2 x 1 = λt 1 1 λ x 2 Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
11 Numerical Analysis for a Second DAE Example DAE (λ 1)x 1 + λtx 2 = 0 (λ 1)x 1 + (λt 1)x 2 = 0 numerical method implicit Euler for DAE (λ 1) x 1,n x 1,n 1 h + λt n x 2,n x 2,n 1 h = 0 (λ 1)x 1,n + (λt n 1)x 2,n = 0 inherent ODE + constraint x 2 = λx 2 x 1 = λt 1 1 λ x 2 explicit Euler for inherent ODE + constraint x 2,n = (1 + λh)x 2,n 1 x 1,n = λt n 1 1 λ x 2,n Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
12 Analysis of the Numerical Behaviour for Index-1 DAEs Assumption: P is a smooth projector that spans ker E DAE Ex = g(x, t) inherent ODE + constraint (Px) = P (Px) + Pf (Px, t) Qx = Qf (Px, t) Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
13 Analysis of the Numerical Behaviour for Index-1 DAEs Assumption: P is a smooth projector that spans ker E DAE Ex = g(x, t) numerical method inherent ODE + constraint (Px) = P (Px) + Pf (Px, t) Qx = Qf (Px, t) BDF method for DAE E n ρx n = g(x n, t n ) Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
14 Analysis of the Numerical Behaviour for Index-1 DAEs Assumption: P is a smooth projector that spans ker E DAE Ex = g(x, t) numerical method inherent ODE + constraint (Px) = P (Px) + Pf (Px, t) Qx = Qf (Px, t) BDF method for DAE E n ρx n = g(x n, t n ) some method for inherent ODE + constraint ρ(px) n = ρ(px) n P n ρx n + P n f ((Px) n, t n ) Q n x n = Q n f ((Px) n, t n ) Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
15 Analysis of the Numerical Behaviour for Index-1 DAEs Assumption: P is a smooth projector that spans ker E DAE Ex = g(x, t) inherent ODE + constraint (Px) = P (Px) + Pf (Px, t) Qx = Qf (Px, t) numerical method if im P = ker E is constant BDF method for DAE E n ρx n = g(x n, t n ) BDF method for inherent ODE + constraint (Px) n = ρ(px) n P n ρx n + P n f ((Px) n, t n ) Q n x n = Q n f ((Px) n, t n ) Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
16 Test Equation for DAEs? P. Kunkel, V. Mehrmann. Stability properties of differential-algebraic equations and spin-stabilized discretisations. Electronic Transactions on Numerical Analysis (ETNA) 26, pp , Proposal for a test equation for DAEs ( ) ( ) 1 ωt x λ ω(1 λt) = x ωt Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
17 Test Equation for DAEs? P. Kunkel, V. Mehrmann. Stability properties of differential-algebraic equations and spin-stabilized discretisations. Electronic Transactions on Numerical Analysis (ETNA) 26, pp , Proposal for a test equation for DAEs ( ) ( ) 1 ωt x λ ω(1 λt) = x ωt Time dependent transformation y = Rx { Ey = Ay y 1 = λy 1 y 1 = y 2 with ( ) ( ) ( ) 1 0 λ 0 1 ωt E =, A =, R = Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
18 Test Equation for DAEs? P. Kunkel, V. Mehrmann. Stability properties of differential-algebraic equations and spin-stabilized discretisations. Electronic Transactions on Numerical Analysis (ETNA) 26, pp , Proposal for a test equation for DAEs ( ) ( ) 1 ωt x λ ω(1 λt) = x ωt The stability domain depends on λ (asymptotical behaviour of the inherent ODE) and on ω (measuring the time dependent movement of the derivative term of the DAE). Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
19 Test Equation for DAEs? P. Kunkel, V. Mehrmann. Stability properties of differential-algebraic equations and spin-stabilized discretisations. Electronic Transactions on Numerical Analysis (ETNA) 26, pp , Proposal for a test equation for DAEs ( ) ( ) 1 ωt x λ ω(1 λt) = x ωt The stability domain depends on λ (asymptotical behaviour of the inherent ODE) and on ω (measuring the time dependent movement of the derivative term of the DAE). Open question: if a (spin stabilized) method is stable for the test equation, is it also stable for all linear (or at least a certain class of linear) DAEs? Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
20 Test Equation for DAEs? J. Wensch, R. Weiner, K. Strehmel. Stability investigations for index-2 systems. Technical Report, Univ. Halle, Hessenberg Index 2 DAE with a... y = By + Cz + q 0 = Dy + r... Scalar Essential Underlying ODE v = (RBS + R S)v + Rq (R + RB)Fr with RS = 0, RF = 0, DS = 0, DF = I, SR + FD = I, F = C(DC) 1 RBS = const, R S = const, R = const Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
21 Test Equation for DAEs? J. Wensch, R. Weiner, K. Strehmel. Stability investigations for index-2 systems. Technical Report, Univ. Halle, Hessenberg Index 2 DAE with a... y = By + Cz + q 0 = Dy + r A-stability for certain projected Runge-Kutta methods... Scalar Essential Underlying ODE v = (RBS + R S)v + Rq (R + RB)Fr with RS = 0, RF = 0, DS = 0, DF = I, SR + FD = I, F = C(DC) 1 RBS = const, R S = const, R = const Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
22 Stability Observation for DAEs - Third Example DAE of Index 2 [Gear, Petzold 86] x 1 + ηtx 2 + (1 + η)x 2 = q 1 x 1 + ηtx 2 = q 2 Unique solution x 2 = q 1 q 2 x 1 = q 2 ηtx 2 Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
23 Stability Observation for DAEs Numerical solution for different methods and parameter values All tested methods get into trouble for certain DAEs and stepsizes. Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
24 Stability Observation for DAEs - Third Example DAE of Index 2 DAE of Index 2 Reformulated x 1 + ηtx 2 + (1 + η)x 2 = q 1 x 1 + ηtx 2 = q 2 x 1 + (ηtx) 2 + x 2 = q 1 x 1 + ηtx 2 = q 2 Unique solution x 2 = q 1 q 2 x 1 = q 2 ηtx 2 Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
25 Stability Observation for DAEs Reformulated Numerical solution for different methods and parameter values All methods work without any trouble. Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
26 Numerical Analysis for the Second DAE Example Reformulated original DAE (λ 1)x 1 + λtx 2 = 0 (λ 1)x 1 + (λt 1)x 2 = 0 Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
27 Numerical Analysis for the Second DAE Example Reformulated original DAE (λ 1)x 1 + λtx 2 = 0 (λ 1)x 1 + (λt 1)x 2 = 0 DAE reformulated (λ 1)x 1 + (λtx 2 ) λx 2 = 0 (λ 1)x 1 + (λt 1)x 2 = 0 Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
28 Numerical Analysis for the Second DAE Example Reformulated DAE (λ 1)x 1 + (λtx 2 ) λx 2 = 0 (λ 1)x 1 + (λt 1)x 2 = 0 Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
29 Numerical Analysis for the Second DAE Example Reformulated DAE (λ 1)x 1 + (λtx 2 ) λx 2 = 0 (λ 1)x 1 + (λt 1)x 2 = 0 inherent ODE + constraint x 2 = λx 2 x 1 = λt 1 1 λ x 2 Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
30 Numerical Analysis for the Second DAE Example Reformulated DAE (λ 1)x 1 + (λtx 2 ) λx 2 = 0 (λ 1)x 1 + (λt 1)x 2 = 0 numerical method implicit Euler for DAE (λ 1) x 1,n x 1,n 1 λx 2,n h + λt nx 2,n λt n 1 x 2,n 1 h = 0 (λ 1)x 1,n + (λt n 1)x 2,n = 0 inherent ODE + constraint x 2 = λx 2 x 1 = λt 1 1 λ x 2 Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
31 Numerical Analysis for the Second DAE Example Reformulated DAE (λ 1)x 1 + (λtx 2 ) λx 2 = 0 (λ 1)x 1 + (λt 1)x 2 = 0 numerical method implicit Euler for DAE (λ 1) x 1,n x 1,n 1 λx 2,n h + λt nx 2,n λt n 1 x 2,n 1 h = 0 (λ 1)x 1,n + (λt n 1)x 2,n = 0 inherent ODE + constraint x 2 = λx 2 x 1 = λt 1 1 λ x 2 implicit Euler for inherent ODE + constraint x 2,n = 1 1 λh x 2,n 1 x 1,n = λt n 1 1 λ x 2,n Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
32 Analysis of the Numerical Behaviour for Index-1 DAEs Assumption: R is a smooth projector that spans ker A im D DAE A(Dx) + g(x, t) = 0 inherent ODE + constraint (Dx) = R (Dx) + Rf (Dx, t) Qx = Qf (Dx, t) Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
33 Analysis of the Numerical Behaviour for Index-1 DAEs Assumption: R is a smooth projector that spans ker A im D DAE A(Dx) + g(x, t) = 0 inherent ODE + constraint (Dx) = R (Dx) + Rf (Dx, t) Qx = Qf (Dx, t) numerical method BDF method for DAE A n ρ(dx) n + g(x n, t n ) = 0 Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
34 Analysis of the Numerical Behaviour for Index-1 DAEs Assumption: R is a smooth projector that spans ker A im D DAE A(Dx) + g(x, t) = 0 inherent ODE + constraint (Dx) = R (Dx) + Rf (Dx, t) Qx = Qf (Dx, t) numerical method BDF method for DAE A n ρ(dx) n + g(x n, t n ) = 0 some method for inherent ODE + constraint R n ρ(dx) n = R n f ((Dx) n, t n ) Q n x n = Q n f ((Dx) n, t n ) Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
35 Analysis of the Numerical Behaviour for Index-1 DAEs Assumption: R is a smooth projector that spans ker A im D DAE A(Dx) + g(x, t) = 0 inherent ODE + constraint (Dx) = Rf (Dx, t) Qx = Qf (Dx, t) numerical method if im D or ker A is constant BDF method for DAE A n ρ(dx) n + g(x n, t n ) = 0 BDF method for inherent ODE + constraint ρ(dx) n = R n f ((Dx) n, t n ) Q n x n = Q n f ((Dx) n, t n ) Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
36 Analysis of the Numerical Behaviour for Index-1 DAEs Assumption: R is a smooth projector that spans ker A im D DAE A(Dx) + g(x, t) = 0 inherent ODE + constraint (Dx) = Rf (Dx, t) Qx = Qf (Dx, t) numerical method if im D or ker A is constant BDF method for DAE A n ρ(dx) n + g(x n, t n ) = 0 BDF method for inherent ODE + constraint ρ(dx) n = R n f ((Dx) n, t n ) Q n x n = Q n f ((Dx) n, t n ) Such a reformulation is always possible if E is continuous with constant rank for Ex = h(x, t). Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
37 Analysis of the Numerical Behaviour for DAEs The diagram DAE numerical method for DAE inherent ODE + constraint (same) numerical method for inherent ODE + constraint commutes for BDF and stiffly accurate Runge-Kutta methods for index-1 DAEs if the DAE is formulated as A(Dx) + g(x, t) = 0, ker A im D, ker A or im D constant for higher index DAEs more restrictions are needed [Higueras, März, T. 03], [Lamour, März, T. in prep.] Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
38 Concepts of B- and G-stability for ODEs Wish: If x(t) y(t) x(t 0 ) y(t 0 ), t > t 0, for any two solutions of x (t) = f (t, x(t)) then X n Y n X n 1 Y n 1 for numerical solutions X n = (x n,..., x n k+1 ) and Y n = (y n,..., y n k+1 ). class of ODEs x = λx, Reλ < 0 x = f (t, x), f (t, x) f (t, y), x y β x y 2 x = f (t, x), f (t, x) f (t, y), x y β x y 2 numerical method A-stable method B-stable Runge-Kutta G-stable linear multist. Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
39 Criteria for A-, B-, G-stability for ODEs G-stability G-stability = A-stability [Dahlquist 78] B-stability Algebraic stability, i.e. B-stability A-stability b i 0, M = (b i a ij + b j a ji b i b j ) ij pos. semi-definite implies B-stability. [Burrage & Butcher 79, Crouzeix 79] Are the criteria for the ODE case also true in the DAE case? Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
40 Reflection of the Asymptotic Behavior for DAEs Wish (?): If x(t) y(t) x(t 0 ) y(t 0 ) for any two solutions of A(Dx) + g(x, t) = 0 then X n Y n X n 1 Y n 1 for numerical solutions X n = (x n,..., x n k+1 ) and Y n = (y n,..., y n k+1 ). Should we require this behaviour for the whole solution component? Is it appropriate to require such a solution behavior for the dynamic components only? Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
41 Conclusions and Open Questions A-stable methods may lead to stepsize restrictions (for stability reasons) in case of DAEs applicable range of test equations for DAEs not clear proper reformulations (cheap) of the DAE can avoid such stepsize restrictions concepts as B- and G-stability need criteria for contractivity of DAEs contractivity conditions for the dynamic components are developped for index-1 DAEs contractivity in the higher index DAEs? B- and G-stability for DAEs? contractivity for all components? contractivity for dynamic components in a certain subspace? contractivity/boundedness of the constraints? Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, / 23
Defect-based a-posteriori error estimation for implicit ODEs and DAEs
1 / 24 Defect-based a-posteriori error estimation for implicit ODEs and DAEs W. Auzinger Institute for Analysis and Scientific Computing Vienna University of Technology Workshop on Innovative Integrators
More informationCHAPTER 10: Numerical Methods for DAEs
CHAPTER 10: Numerical Methods for DAEs Numerical approaches for the solution of DAEs divide roughly into two classes: 1. direct discretization 2. reformulation (index reduction) plus discretization Direct
More informationInput-to-state stability and interconnected Systems
10th Elgersburg School Day 1 Input-to-state stability and interconnected Systems Sergey Dashkovskiy Universität Würzburg Elgersburg, March 5, 2018 1/20 Introduction Consider Solution: ẋ := dx dt = ax,
More informationDifferential-algebraic equations. Control and Numerics V
Differential-algebraic equations. Control and Numerics V Volker Mehrmann Institut für Mathematik Technische Universität Berlin with V.H. Linh, P. Kunkel, E. Van Vleck DFG Research Center MATHEON Mathematics
More informationLogistic Map, Euler & Runge-Kutta Method and Lotka-Volterra Equations
Logistic Map, Euler & Runge-Kutta Method and Lotka-Volterra Equations S. Y. Ha and J. Park Department of Mathematical Sciences Seoul National University Sep 23, 2013 Contents 1 Logistic Map 2 Euler and
More informationNumerical integration of DAE s
Numerical integration of DAE s seminar Sandra Allaart-Bruin sbruin@win.tue.nl seminar p.1 Seminar overview February 18 Arie Verhoeven Introduction to DAE s seminar p.2 Seminar overview February 18 Arie
More informationNumerical Oscillations and how to avoid them
Numerical Oscillations and how to avoid them Willem Hundsdorfer Talk for CWI Scientific Meeting, based on work with Anna Mozartova (CWI, RBS) & Marc Spijker (Leiden Univ.) For details: see thesis of A.
More informationExam in TMA4215 December 7th 2012
Norwegian University of Science and Technology Department of Mathematical Sciences Page of 9 Contact during the exam: Elena Celledoni, tlf. 7359354, cell phone 48238584 Exam in TMA425 December 7th 22 Allowed
More informationDefect-based a posteriori error estimation for index-1 DAEs
Defect-based a posteriori error estimation for index-1 DAEs W. Auzinger, H. Lehner, E. Weinmüller Institute for Analysis and Scientific Computing Vienna University of Technology Wiedner Hauptstrasse 8
More information1.2 Derivation. d p f = d p f(x(p)) = x fd p x (= f x x p ). (1) Second, g x x p + g p = 0. d p f = f x g 1. The expression f x gx
PDE-constrained optimization and the adjoint method Andrew M. Bradley November 16, 21 PDE-constrained optimization and the adjoint method for solving these and related problems appear in a wide range of
More informationINRIA Rocquencourt, Le Chesnay Cedex (France) y Dept. of Mathematics, North Carolina State University, Raleigh NC USA
Nonlinear Observer Design using Implicit System Descriptions D. von Wissel, R. Nikoukhah, S. L. Campbell y and F. Delebecque INRIA Rocquencourt, 78 Le Chesnay Cedex (France) y Dept. of Mathematics, North
More informationNumerical Treatment of Unstructured. Differential-Algebraic Equations. with Arbitrary Index
Numerical Treatment of Unstructured Differential-Algebraic Equations with Arbitrary Index Peter Kunkel (Leipzig) SDS2003, Bari-Monopoli, 22. 25.06.2003 Outline Numerical Treatment of Unstructured Differential-Algebraic
More informationIntroduction to standard and non-standard Numerical Methods
Introduction to standard and non-standard Numerical Methods Dr. Mountaga LAM AMS : African Mathematic School 2018 May 23, 2018 One-step methods Runge-Kutta Methods Nonstandard Finite Difference Scheme
More informationSolving scalar IVP s : Runge-Kutta Methods
Solving scalar IVP s : Runge-Kutta Methods Josh Engwer Texas Tech University March 7, NOTATION: h step size x n xt) t n+ t + h x n+ xt n+ ) xt + h) dx = ft, x) SCALAR IVP ASSUMED THROUGHOUT: dt xt ) =
More informationAPPLICATIONS OF FD APPROXIMATIONS FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS
LECTURE 10 APPLICATIONS OF FD APPROXIMATIONS FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS Ordinary Differential Equations Initial Value Problems For Initial Value problems (IVP s), conditions are specified
More informationA New Block Method and Their Application to Numerical Solution of Ordinary Differential Equations
A New Block Method and Their Application to Numerical Solution of Ordinary Differential Equations Rei-Wei Song and Ming-Gong Lee* d09440@chu.edu.tw, mglee@chu.edu.tw * Department of Applied Mathematics/
More informationMATH 304 Linear Algebra Lecture 8: Vector spaces. Subspaces.
MATH 304 Linear Algebra Lecture 8: Vector spaces. Subspaces. Linear operations on vectors Let x = (x 1, x 2,...,x n ) and y = (y 1, y 2,...,y n ) be n-dimensional vectors, and r R be a scalar. Vector sum:
More informationModelling Physical Phenomena
Modelling Physical Phenomena Limitations and Challenges of the Differential Algebraic Equations Approach Olaf Trygve Berglihn Department of Chemical Engineering 30. June 2010 2 Outline Background Classification
More informationNumerical Methods for Differential Equations
Numerical Methods for Differential Equations Chapter 2: Runge Kutta and Multistep Methods Gustaf Söderlind Numerical Analysis, Lund University Contents V4.16 1. Runge Kutta methods 2. Embedded RK methods
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 34, pp. 14-19, 2008. Copyrigt 2008,. ISSN 1068-9613. ETNA A NOTE ON NUMERICALLY CONSISTENT INITIAL VALUES FOR HIGH INDEX DIFFERENTIAL-ALGEBRAIC EQUATIONS
More informationNumerical solution of ODEs
Numerical solution of ODEs Arne Morten Kvarving Department of Mathematical Sciences Norwegian University of Science and Technology November 5 2007 Problem and solution strategy We want to find an approximation
More informationEfficient numerical methods for the solution of stiff initial-value problems and differential algebraic equations
10.1098/rspa.2003.1130 R EVIEW PAPER Efficient numerical methods for the solution of stiff initial-value problems and differential algebraic equations By J. R. Cash Department of Mathematics, Imperial
More informationMIDTERM REVIEW AND SAMPLE EXAM. Contents
MIDTERM REVIEW AND SAMPLE EXAM Abstract These notes outline the material for the upcoming exam Note that the review is divided into the two main topics we have covered thus far, namely, ordinary differential
More informationImplicit-explicit exponential integrators
Implicit-explicit exponential integrators Bawfeh Kingsley Kometa joint work with Elena Celledoni MaGIC 2011 Finse, March 1-4 1 Introduction Motivation 2 semi-lagrangian Runge-Kutta exponential integrators
More informationThe Kalman-Yakubovich-Popov Lemma for Differential-Algebraic Equations with Applications
MAX PLANCK INSTITUTE Elgersburg Workshop Elgersburg February 11-14, 2013 The Kalman-Yakubovich-Popov Lemma for Differential-Algebraic Equations with Applications Timo Reis 1 Matthias Voigt 2 1 Department
More information1. Tangent Vectors to R n ; Vector Fields and One Forms All the vector spaces in this note are all real vector spaces.
1. Tangent Vectors to R n ; Vector Fields and One Forms All the vector spaces in this note are all real vector spaces. The set of n-tuples of real numbers is denoted by R n. Suppose that a is a real number
More informationNumerical Algorithms as Dynamical Systems
A Study on Numerical Algorithms as Dynamical Systems Moody Chu North Carolina State University What This Study Is About? To recast many numerical algorithms as special dynamical systems, whence to derive
More informationComplex Dynamic Systems: Qualitative vs Quantitative analysis
Complex Dynamic Systems: Qualitative vs Quantitative analysis Complex Dynamic Systems Chiara Mocenni Department of Information Engineering and Mathematics University of Siena (mocenni@diism.unisi.it) Dynamic
More informationOn Linear-Quadratic Control Theory of Implicit Difference Equations
On Linear-Quadratic Control Theory of Implicit Difference Equations Daniel Bankmann Technische Universität Berlin 10. Elgersburg Workshop 2016 February 9, 2016 D. Bankmann (TU Berlin) Control of IDEs February
More informationMath Ordinary Differential Equations
Math 411 - Ordinary Differential Equations Review Notes - 1 1 - Basic Theory A first order ordinary differential equation has the form x = f(t, x) (11) Here x = dx/dt Given an initial data x(t 0 ) = x
More informationMATH 304 Linear Algebra Lecture 15: Linear transformations (continued). Range and kernel. Matrix transformations.
MATH 304 Linear Algebra Lecture 15: Linear transformations (continued). Range and kernel. Matrix transformations. Linear mapping = linear transformation = linear function Definition. Given vector spaces
More informationDifferential-Algebraic Equations (DAEs)
Differential-Algebraic Equations (DAEs) L. T. Biegler Chemical Engineering Department Carnegie Mellon University Pittsburgh, PA 15213 biegler@cmu.edu http://dynopt.cheme.cmu.edu Introduction Simple Examples
More informationthe reference terminal. For electrotechnical reasons, the current entering terminal n is given by i n = ; P n; k= i k. The conductance matrix G(v :::
Topological index calculation of DAEs in circuit simulation Caren Tischendorf, Humboldt-University of Berlin Abstract. Electric circuits are present in a number of applications, e.g. in home computers,
More information10.34: Numerical Methods Applied to Chemical Engineering. Lecture 19: Differential Algebraic Equations
10.34: Numerical Methods Applied to Chemical Engineering Lecture 19: Differential Algebraic Equations 1 Recap Differential algebraic equations Semi-explicit Fully implicit Simulation via backward difference
More informationSolving PDEs with PGI CUDA Fortran Part 4: Initial value problems for ordinary differential equations
Solving PDEs with PGI CUDA Fortran Part 4: Initial value problems for ordinary differential equations Outline ODEs and initial conditions. Explicit and implicit Euler methods. Runge-Kutta methods. Multistep
More informationOptimal control of nonstructured nonlinear descriptor systems
Optimal control of nonstructured nonlinear descriptor systems TU Berlin DFG Research Center Institut für Mathematik MATHEON Workshop Elgersburg 19.02.07 joint work with Peter Kunkel Overview Applications
More informationExponential Integrators
Exponential Integrators John C. Bowman and Malcolm Roberts (University of Alberta) June 11, 2009 www.math.ualberta.ca/ bowman/talks 1 Outline Exponential Integrators Exponential Euler History Generalizations
More informationLecture 17: Ordinary Differential Equation II. First Order (continued)
Lecture 17: Ordinary Differential Equation II. First Order (continued) 1. Key points Maple commands dsolve dsolve[interactive] dsolve(numeric) 2. Linear first order ODE: y' = q(x) - p(x) y In general,
More informationR. Marz with coecient functions A(x t) L(R n R m ) d(x t) R n and b(x t) R m x D R m t I R, that are continuous in their arguments, and which have the
Nonlinear dierential-algebraic equations with properly formulated leading term R. Marz 1 Introduction In [BaMa], a uniform theory for investigating linear dierential-algebraic equations (DAEs) and their
More informationLecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 9
Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T. Heath Chapter 9 Initial Value Problems for Ordinary Differential Equations Copyright c 2001. Reproduction
More informationENGI9496 Lecture Notes State-Space Equation Generation
ENGI9496 Lecture Notes State-Space Equation Generation. State Equations and Variables - Definitions The end goal of model formulation is to simulate a system s behaviour on a computer. A set of coherent
More informationAn Analysis of Five Numerical Methods for Approximating Certain Hypergeometric Functions in Domains within their Radii of Convergence
An Analysis of Five Numerical Methods for Approximating Certain Hypergeometric Functions in Domains within their Radii of Convergence John Pearson MSc Special Topic Abstract Numerical approximations of
More information( ) f (k) = FT (R(x)) = R(k)
Solving ODEs using Fourier Transforms The formulas for derivatives are particularly useful because they reduce ODEs to algebraic expressions. Consider the following ODE d 2 dx + p d 2 dx + q f (x) = R(x)
More informationQuadratic forms. Here. Thus symmetric matrices are diagonalizable, and the diagonalization can be performed by means of an orthogonal matrix.
Quadratic forms 1. Symmetric matrices An n n matrix (a ij ) n ij=1 with entries on R is called symmetric if A T, that is, if a ij = a ji for all 1 i, j n. We denote by S n (R) the set of all n n symmetric
More informationLecture 4: Numerical solution of ordinary differential equations
Lecture 4: Numerical solution of ordinary differential equations Department of Mathematics, ETH Zürich General explicit one-step method: Consistency; Stability; Convergence. High-order methods: Taylor
More informationOn The Numerical Solution of Differential-Algebraic Equations(DAES) with Index-3 by Pade Approximation
Appl. Math. Inf. Sci. Lett., No. 2, 7-23 (203) 7 Applied Mathematics & Information Sciences Letters An International Journal On The Numerical Solution of Differential-Algebraic Equations(DAES) with Index-3
More informationPolytechnic Institute of NYU MA 2132 Final Practice Answers Fall 2012
Polytechnic Institute of NYU MA Final Practice Answers Fall Studying from past or sample exams is NOT recommended. If you do, it should be only AFTER you know how to do all of the homework and worksheet
More informationNumerical Methods - Initial Value Problems for ODEs
Numerical Methods - Initial Value Problems for ODEs Y. K. Goh Universiti Tunku Abdul Rahman 2013 Y. K. Goh (UTAR) Numerical Methods - Initial Value Problems for ODEs 2013 1 / 43 Outline 1 Initial Value
More informationExponential Integrators
Exponential Integrators John C. Bowman (University of Alberta) May 22, 2007 www.math.ualberta.ca/ bowman/talks 1 Exponential Integrators Outline Exponential Euler History Generalizations Stationary Green
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 9 Initial Value Problems for Ordinary Differential Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign
More informationEXTENSIONS OF THE HHT-α METHOD TO DIFFERENTIAL-ALGEBRAIC EQUATIONS IN MECHANICS
EXTENSIONS OF THE HHT-α METHOD TO DIFFERENTIAL-ALGEBRAIC EQUATIONS IN MECHANICS LAURENT O. JAY AND DAN NEGRUT Abstract. We present second-order extensions of the Hilber-Hughes-Taylor-α HHT-α) method for
More informationThe Plan. Initial value problems (ivps) for ordinary differential equations (odes) Review of basic methods You are here: Hamiltonian systems
Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit V Solution of Differential Equations Part 2 Dianne P. O Leary c 2008 The Plan
More informationDiagonalization of Matrices
LECTURE 4 Diagonalization of Matrices Recall that a diagonal matrix is a square n n matrix with non-zero entries only along the diagonal from the upper left to the lower right (the main diagonal) Diagonal
More informationStepsize Restrictions for Boundedness and Monotonicity of Multistep Methods
Stepsize Restrictions for Boundedness and Monotonicity of Multistep Methods W. Hundsdorfer, A. Mozartova, M.N. Spijker Abstract In this paper nonlinear monotonicity and boundedness properties are analyzed
More informationCS 450 Numerical Analysis. Chapter 9: Initial Value Problems for Ordinary Differential Equations
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationLinear relations and the Kronecker canonical form
Linear relations and the Kronecker canonical form Thomas Berger Carsten Trunk Henrik Winkler August 5, 215 Abstract We show that the Kronecker canonical form (which is a canonical decomposition for pairs
More informationSturm-Liouville operators have form (given p(x) > 0, q(x)) + q(x), (notation means Lf = (pf ) + qf ) dx
Sturm-Liouville operators Sturm-Liouville operators have form (given p(x) > 0, q(x)) L = d dx ( p(x) d ) + q(x), (notation means Lf = (pf ) + qf ) dx Sturm-Liouville operators Sturm-Liouville operators
More informationNumerical Methods for Differential Equations
Numerical Methods for Differential Equations Chapter 2: Runge Kutta and Linear Multistep methods Gustaf Söderlind and Carmen Arévalo Numerical Analysis, Lund University Textbooks: A First Course in the
More information2.3. VECTOR SPACES 25
2.3. VECTOR SPACES 25 2.3 Vector Spaces MATH 294 FALL 982 PRELIM # 3a 2.3. Let C[, ] denote the space of continuous functions defined on the interval [,] (i.e. f(x) is a member of C[, ] if f(x) is continuous
More informationx 3y 2z = 6 1.2) 2x 4y 3z = 8 3x + 6y + 8z = 5 x + 3y 2z + 5t = 4 1.5) 2x + 8y z + 9t = 9 3x + 5y 12z + 17t = 7
Linear Algebra and its Applications-Lab 1 1) Use Gaussian elimination to solve the following systems x 1 + x 2 2x 3 + 4x 4 = 5 1.1) 2x 1 + 2x 2 3x 3 + x 4 = 3 3x 1 + 3x 2 4x 3 2x 4 = 1 x + y + 2z = 4 1.4)
More informationCoupled differential equations
Coupled differential equations Example: dy 1 dy 11 1 1 1 1 1 a y a y b x a y a y b x Consider the case with b1 b d y1 a11 a1 y1 y a1 ay dy y y e y 4/1/18 One way to address this sort of problem, is to
More informationThe formulas for derivatives are particularly useful because they reduce ODEs to algebraic expressions. Consider the following ODE d 2 dx + p d
Solving ODEs using Fourier Transforms The formulas for derivatives are particularly useful because they reduce ODEs to algebraic expressions. Consider the following ODE d 2 dx + p d 2 dx + q f (x) R(x)
More informationSimultaneous Step-size and Path Control for Efficient Transient Noise Analysis
Simultaneous Step-size and Path Control for Efficient Transient Noise Analysis Werner Römisch, Thorsten Sickenberger, and Renate Winkler Abstract Noise in electronic components is a random phenomenon that
More informationMathematical Methods - Lecture 7
Mathematical Methods - Lecture 7 Yuliya Tarabalka Inria Sophia-Antipolis Méditerranée, Titane team, http://www-sop.inria.fr/members/yuliya.tarabalka/ Tel.: +33 (0)4 92 38 77 09 email: yuliya.tarabalka@inria.fr
More informationStability analysis of differential algebraic systems
Stability analysis of differential algebraic systems Volker Mehrmann TU Berlin, Institut für Mathematik with Vu Hoang Linh and Erik Van Vleck DFG Research Center MATHEON Mathematics for key technologies
More informationReview For the Final: Problem 1 Find the general solutions of the following DEs. a) x 2 y xy y 2 = 0 solution: = 0 : homogeneous equation.
Review For the Final: Problem 1 Find the general solutions of the following DEs. a) x 2 y xy y 2 = 0 solution: y y x y2 = 0 : homogeneous equation. x2 v = y dy, y = vx, and x v + x dv dx = v + v2. dx =
More informationFeedback Linearization Lectures delivered at IIT-Kanpur, TEQIP program, September 2016.
Feedback Linearization Lectures delivered at IIT-Kanpur, TEQIP program, September 216 Ravi N Banavar banavar@iitbacin September 24, 216 These notes are based on my readings o the two books Nonlinear Control
More informationChapter 4: First-order differential equations. Similarity and Transport Phenomena in Fluid Dynamics Christophe Ancey
Chapter 4: First-order differential equations Similarity and Transport Phenomena in Fluid Dynamics Christophe Ancey Chapter 4: First-order differential equations Phase portrait Singular point Separatrix
More informationThe Behavioral Approach to Systems Theory
The Behavioral Approach to Systems Theory... and DAEs Patrick Kürschner July 21, 2010 1/31 Patrick Kürschner The Behavioral Approach to Systems Theory Outline 1 Introduction 2 Mathematical Models 3 Linear
More informationLinear ODEs. Existence of solutions to linear IVPs. Resolvent matrix. Autonomous linear systems
Linear ODEs p. 1 Linear ODEs Existence of solutions to linear IVPs Resolvent matrix Autonomous linear systems Linear ODEs Definition (Linear ODE) A linear ODE is a differential equation taking the form
More informationNumerical Methods - Boundary Value Problems for ODEs
Numerical Methods - Boundary Value Problems for ODEs Y. K. Goh Universiti Tunku Abdul Rahman 2013 Y. K. Goh (UTAR) Numerical Methods - Boundary Value Problems for ODEs 2013 1 / 14 Outline 1 Boundary Value
More informationAdvanced methods for ODEs and DAEs
Advanced methods for ODEs and DAEs Lecture 13: Overview Bojana Rosic, 13. Juli 2016 Dynamical system is a system that evolves over time possibly under external excitations: river flow, car, etc. The dynamics
More informationMathematical Preliminaries
Mathematical Preliminaries Economics 3307 - Intermediate Macroeconomics Aaron Hedlund Baylor University Fall 2013 Econ 3307 (Baylor University) Mathematical Preliminaries Fall 2013 1 / 25 Outline I: Sequences
More informationAdvanced methods for ODEs and DAEs
Advanced methods for ODEs and DAEs Lecture 8: Dirk and Rosenbrock Wanner methods Bojana Rosic, 14 Juni 2016 General implicit Runge Kutta method Runge Kutta method is presented by Butcher table: c1 a11
More informationMathematical foundations - linear algebra
Mathematical foundations - linear algebra Andrea Passerini passerini@disi.unitn.it Machine Learning Vector space Definition (over reals) A set X is called a vector space over IR if addition and scalar
More informationThe Additional Dynamics of the Least Squares Completions of Linear Differential Algebraic Equations. by Irfan Okay
ABSTRACT OKAY, IRFAN The Additional Dynamics of the Least Squares Completions of Linear Differential Algebraic Equations ( Under the direction of Dr Stephen L Campbell ) Differential equations of the form
More informationTowards One-Step Multirate Methods in Chip Design
Bergische Universität Wuppertal Fachbereich Mathematik und Naturwissenschaften Lehrstuhl für Angewandte Mathematik und Numerische Mathematik Preprint BUW-AMNA 04/09 M. Striebel, M.Günther Towards One-Step
More information11 a 12 a 21 a 11 a 22 a 12 a 21. (C.11) A = The determinant of a product of two matrices is given by AB = A B 1 1 = (C.13) and similarly.
C PROPERTIES OF MATRICES 697 to whether the permutation i 1 i 2 i N is even or odd, respectively Note that I =1 Thus, for a 2 2 matrix, the determinant takes the form A = a 11 a 12 = a a 21 a 11 a 22 a
More informationWorksheet 8 Sample Solutions
Technische Universität München WS 2016/17 Lehrstuhl für Informatik V Scientific Computing Univ.-Prof. Dr. M. Bader 19.12.2016/21.12.2016 M.Sc. S. Seckler, M.Sc. D. Jarema Worksheet 8 Sample Solutions Ordinary
More informationUniversity of Houston, Department of Mathematics Numerical Analysis II. Chapter 4 Numerical solution of stiff and differential-algebraic equations
Chapter 4 Numerical solution of stiff and differential-algebraic equations 4.1 Characteristics of stiff systems The solution has components with extremely different growth properties. Example: 2 u (x)
More informationc 2004 Society for Industrial and Applied Mathematics
SIAM J. SCI. COMPUT. Vol. 26, No. 2, pp. 359 374 c 24 Society for Industrial and Applied Mathematics A POSTERIORI ERROR ESTIMATION AND GLOBAL ERROR CONTROL FOR ORDINARY DIFFERENTIAL EQUATIONS BY THE ADJOINT
More informationTime-adaptive methods for the incompressible Navier-Stokes equations
Time-adaptive methods for the incompressible Navier-Stokes equations Joachim Rang, Thorsten Grahs, Justin Wiegmann, 29.09.2016 Contents Introduction Diagonally implicit Runge Kutta methods Results with
More informationMath 307: Problems for section 2.1
Math 37: Problems for section 2. October 9 26 2. Are the vectors 2 2 3 2 2 4 9 linearly independent? You may use MAT- 7 3 LAB/Octave to perform calculations but explain your answer. Put the vectors in
More informationMechanical Systems II. Method of Lagrange Multipliers
Mechanical Systems II. Method of Lagrange Multipliers Rafael Wisniewski Aalborg University Abstract. So far our approach to classical mechanics was limited to finding a critical point of a certain functional.
More informationMATH 205 HOMEWORK #3 OFFICIAL SOLUTION. Problem 1: Find all eigenvalues and eigenvectors of the following linear transformations. (a) F = R, V = R 3,
MATH 205 HOMEWORK #3 OFFICIAL SOLUTION Problem 1: Find all eigenvalues and eigenvectors of the following linear transformations. a F = R, V = R 3, b F = R or C, V = F 2, T = T = 9 4 4 8 3 4 16 8 7 0 1
More informationEigenvalue Problems and Singular Value Decomposition
Eigenvalue Problems and Singular Value Decomposition Sanzheng Qiao Department of Computing and Software McMaster University August, 2012 Outline 1 Eigenvalue Problems 2 Singular Value Decomposition 3 Software
More informationOn perturbations in the leading coefficient matrix of time-varying index-1 DAEs
On perturbations in the leading coefficient matrix of time-varying index-1 DAEs Institute of Mathematics, Ilmenau University of Technology Darmstadt, March 27, 2012 Institute of Mathematics, Ilmenau University
More informationB5.6 Nonlinear Systems
B5.6 Nonlinear Systems 1. Linear systems Alain Goriely 2018 Mathematical Institute, University of Oxford Table of contents 1. Linear systems 1.1 Differential Equations 1.2 Linear flows 1.3 Linear maps
More informationCITY UNIVERSITY LONDON
No: CITY UNIVERSITY LONDON BEng (Hons)/MEng (Hons) Degree in Civil Engineering BEng (Hons)/MEng (Hons) Degree in Civil Engineering with Surveying BEng (Hons)/MEng (Hons) Degree in Civil Engineering with
More informationPerturbation theory for eigenvalues of Hermitian pencils. Christian Mehl Institut für Mathematik TU Berlin, Germany. 9th Elgersburg Workshop
Perturbation theory for eigenvalues of Hermitian pencils Christian Mehl Institut für Mathematik TU Berlin, Germany 9th Elgersburg Workshop Elgersburg, March 3, 2014 joint work with Shreemayee Bora, Michael
More informationPH.D. PRELIMINARY EXAMINATION MATHEMATICS
UNIVERSITY OF CALIFORNIA, BERKELEY Dept. of Civil and Environmental Engineering FALL SEMESTER 2014 Structural Engineering, Mechanics and Materials NAME PH.D. PRELIMINARY EXAMINATION MATHEMATICS Problem
More informationReview Higher Order methods Multistep methods Summary HIGHER ORDER METHODS. P.V. Johnson. School of Mathematics. Semester
HIGHER ORDER METHODS School of Mathematics Semester 1 2008 OUTLINE 1 REVIEW 2 HIGHER ORDER METHODS 3 MULTISTEP METHODS 4 SUMMARY OUTLINE 1 REVIEW 2 HIGHER ORDER METHODS 3 MULTISTEP METHODS 4 SUMMARY OUTLINE
More informationECE-620 Reduced-order model of DFIG-based wind turbines
ECE-620 Reduced-order model of DFIG-based wind turbines Dr. Héctor A. Pulgar hpulgar@utk Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville November 18, 2015 Dr.
More informationA numerical study of SSP time integration methods for hyperbolic conservation laws
MATHEMATICAL COMMUNICATIONS 613 Math. Commun., Vol. 15, No., pp. 613-633 (010) A numerical study of SSP time integration methods for hyperbolic conservation laws Nelida Črnjarić Žic1,, Bojan Crnković 1
More informationFinite Differences for Differential Equations 28 PART II. Finite Difference Methods for Differential Equations
Finite Differences for Differential Equations 28 PART II Finite Difference Methods for Differential Equations Finite Differences for Differential Equations 29 BOUNDARY VALUE PROBLEMS (I) Solving a TWO
More informationTHE TRAPEZOIDAL QUADRATURE RULE
y 1 Computing area under y=1/(1+x^2) 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Trapezoidal rule x THE TRAPEZOIDAL QUADRATURE RULE From Chapter 5, we have the quadrature
More informationCHAPTER 5: Linear Multistep Methods
CHAPTER 5: Linear Multistep Methods Multistep: use information from many steps Higher order possible with fewer function evaluations than with RK. Convenient error estimates. Changing stepsize or order
More informationORBIT 14 The propagator. A. Milani et al. Dipmat, Pisa, Italy
ORBIT 14 The propagator A. Milani et al. Dipmat, Pisa, Italy Orbit 14 Propagator manual 1 Contents 1 Propagator - Interpolator 2 1.1 Propagation and interpolation............................ 2 1.1.1 Introduction..................................
More informationOrdinary Differential Equation Theory
Part I Ordinary Differential Equation Theory 1 Introductory Theory An n th order ODE for y = y(t) has the form Usually it can be written F (t, y, y,.., y (n) ) = y (n) = f(t, y, y,.., y (n 1) ) (Implicit
More informationSPECIALIZED RUNGE-KUTTA METHODS FOR INDEX 2 DIFFERENTIAL-ALGEBRAIC EQUATIONS
MATHEMATICS OF COMPUTATION Volume 75, Number 254, Pages 641 654 S 0025-5718(05)01809-0 Article electronically published on December 19, 2005 SPECIALIZED RUNGE-KUTTA METHODS FOR INDEX 2 DIFFERENTIAL-ALGEBRAIC
More information