Consistent Initial Condition Calculation for Differential-Algebraic Systems

From MaRDI portal





This paper is concerned with the calculation of consistent initial conditions for index-1 systems of differential-algebraic equations (DAEs). The authors consider a generalized form of semiexplicit DAEs given by: \(f(t,u,v,u')= 0\), \(g(t,u,v)= 0\), where \(u\) and \(v\) are the differential and algebraic variables, respectively, and the Jacobians \(f_{u'}\) and \(g_v\) are nonsingular. In connection with these equations two type of problems are studied: In the so-called Problem 1, for given initial values of the differential variables \(u(t_0)= u_0\), the authors propose to calculate consistent initial values \(v_0\), \(u_0'\) for \(v(t_0)\), \(u'(t_0)\). In Problem 2, given the derivatives of the differential variables \(u'(t_0)= u_0'\) the aim is to determine consistent values \(u_0\), \(v_0\) for \(u(t_0)\), \(v(t_0)\). The calculation of such sets of consistent values is carried out assuming that the problem is to be solved by using either DASSL [cf. \textit{K. E. Brenan}, \textit{S. L. Campbell} and \textit{L. R. Petzold}, Numerical solution of initial value problems in differential-algebraic equations, SIAM (1989; Zbl 0699.65057, Corr. republ. 1996; Zbl 0844.65058)] or else DASPK [cf. \textit{P. N. Brown}, \textit{A. C. Hindmarsh} and \textit{L. R. Petzold}, SIAM J. Sci. Comput. 15, No. 6, 1467-1488 (1994; Zbl 0812.65060)] which are based in BDF formulas. The authors propose Newton type iteration algorithms which use the calculations and factorizations required in the standard codes. Some results on the convergence of the proposed algorithms are presented and also a linesearch backtracking algorithm is given in order to improve the robustness of the Newton algorithm. Finally, some numerical experiments are presented with a two-species predator-prey model where the predator is assumed to have an infinitely fast reaction rate. This problem is described by a system of partial differential equations on a square and discretized in the spatial variables which yields to an index-1 system with high dimension. It is shown that with the DASPK code the iterative scheme for the consistent initialization behaves very much as expected for Problem 1 while it should be used with some caution for Problem 2 initializations.




Cited in
(32)


Describes a project that uses

Uses Software






This page was built for publication: Consistent Initial Condition Calculation for Differential-Algebraic Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389306)