In theunivariate case, a DAE in the variablet can be written as a single equation of the form
where is a vector of unknown functions and the overdot denotes the time derivative, i.e.,.
They are distinct fromordinary differential equation (ODE) in that a DAE is not completely solvable for the derivatives of all components of the functionx because these may not all appear (i.e. some equations are algebraic); technically the distinction between an implicit ODE system [that may be rendered explicit] and a DAE system is that theJacobian matrix is asingular matrix for a DAE system.[1] This distinction between ODEs and DAEs is made because DAEs have different characteristics and are generally more difficult to solve.[2]
In practical terms, the distinction between DAEs and ODEs is often that the solution of a DAE system depends on the derivatives of the input signal and not just the signal itself as in the case of ODEs;[3] this issue is commonly encountered innonlinear systems withhysteresis,[4] such as theSchmitt trigger.[5]
This difference is more clearly visible if the system may be rewritten so that instead ofx we consider a pair of vectors of dependent variables and the DAE has the form
where,, and
A DAE system of this form is calledsemi-explicit.[1] Every solution of the second halfg of the equation defines a unique direction forx via the first halff of the equations, while the direction fory is arbitrary. But not every point(x,y,t) is a solution ofg. The variables inx and the first halff of the equations get the attributedifferential. The components ofy and the second halfg of the equations are called thealgebraic variables or equations of the system. [The termalgebraic in the context of DAEs only meansfree of derivatives and is not related to (abstract) algebra.]
The solution of a DAE consists of two parts, first the search for consistent initial values and second the computation of a trajectory. To find consistent initial values it is often necessary to consider the derivatives of some of the component functions of the DAE. The highest order of a derivative that is necessary for this process is called thedifferentiation index. The equations derived in computing the index and consistent initial values may also be of use in the computation of the trajectory. A semi-explicit DAE system can be converted to an implicit one by decreasing the differentiation index by one, and vice versa.[6]
The distinction of DAEs to ODEs becomes apparent if some of the dependent variables occur without their derivatives. The vector of dependent variables may then be written as pair and the system of differential equations of the DAE appears in the form
where
, a vector in, are dependent variables for which derivatives are present (differential variables),
, a vector in, are dependent variables for which no derivatives are present (algebraic variables),
, a scalar (usually time) is an independent variable.
is a vector of functions that involve subsets of these variables and derivatives.
As a whole, the set of DAEs is a function
Initial conditions must be a solution of the system of equations of the form
The behaviour of apendulum of lengthL with center in (0,0) in Cartesian coordinates (x,y) is described by theEuler–Lagrange equations
where is aLagrange multiplier. The momentum variablesu andv should be constrained by the law of conservation of energy and their direction should point along the circle. Neither condition is explicit in those equations. Differentiation of the last equation leads to
restricting the direction of motion to the tangent of the circle. The next derivative of this equation implies
and the derivative of that last identity simplifies to which implies the conservation of energy since after integration the constant is the sum of kinetic and potential energy.
To obtain unique derivative values for all dependent variables the last equation was three times differentiated. This gives a differentiation index of 3, which is typical for constrained mechanical systems.
If initial values and a sign fory are given, the other variables are determined via, and if then and. To proceed to the next point it is sufficient to get the derivatives ofx andu, that is, the system to solve is now
This is a semi-explicit DAE of index 1. Another set of similar equations may be obtained starting from and a sign forx.
DAEs also naturally occur in the modelling of circuits with non-linear devices.Modified nodal analysis employing DAEs is used for example in the ubiquitousSPICE family of numeric circuit simulators.[7] Similarly,Fraunhofer'sAnalog InsydesMathematica package can be used to derive DAEs from anetlist and then simplify or even solve the equations symbolically in some cases.[8][9] It is worth noting that the index of a DAE (of a circuit) can be made arbitrarily high by cascading/coupling via capacitorsoperational amplifiers withpositive feedback.[4]
are called semi-explicit. The index-1 property requires thatg issolvable fory. In other words, the differentiation index is 1 if by differentiation of the algebraic equations fort an implicit ODE system results,
which is solvable for if
Every sufficiently smooth DAE is almost everywhere reducible to this semi-explicit index-1 form.
It is a non-trivial task to convert arbitrary DAE systems into ODEs for solution by pure ODE solvers. Techniques which can be employed includePantelides algorithm anddummy derivative index reduction method. Alternatively, a direct solution of high-index DAEs with inconsistent initial conditions is also possible. This solution approach involves a transformation of the derivative elements throughorthogonal collocation on finite elements ordirect transcription into algebraic expressions. This allows DAEs of any index to be solved without rearrangement in the open equation form
Once the model has been converted to algebraic equation form, it is solvable by large-scale nonlinear programming solvers (seeAPMonitor).
Several measures of DAEs tractability in terms of numerical methods have developed, such asdifferentiation index,perturbation index,tractability index,geometric index, and theKronecker index.[10][11]
We use the-method to analyze a DAE. We construct for the DAE a signature matrix, where each row corresponds to each equation and each column corresponds to each variable. The entry in position is, which denotes the highest order of derivative to which occurs in, or if does not occur in.
For the pendulum DAE above, the variables are. The corresponding signature matrix is
^abUri M. Ascher;Linda R. Petzold (1998).Computer Methods for Ordinary Differential Equations and Differential-Algebraic Equations. SIAM. p. 12.ISBN978-1-61197-139-2.
^Achim Ilchmann; Timo Reis (2014).Surveys in Differential-Algebraic Equations II. Springer. pp. 104–105.ISBN978-3-319-11050-9.
^Ricardo Riaza (2013). "DAEs in Circuit Modelling: A Survey". In Achim Ilchmann; Timo Reis (eds.).Surveys in Differential-Algebraic Equations I. Springer Science & Business Media.ISBN978-3-642-34928-7.
^Hauser, M.; Salzig, C.; Dreyer, A. (2011). "Fast and Robust Symbolic Model Order Reduction with Analog Insydes".Computer Algebra in Scientific Computing. Lecture Notes in Computer Science. Vol. 6885. p. 215.doi:10.1007/978-3-642-23568-9_17.ISBN978-3-642-23567-2.
Hairer, E.; Wanner, G. (1996).Solving Ordinary Differential Equations II: Stiff and Differential-Algebraic Problems (2nd revised ed.). Berlin: Springer-Verlag.
Ascher, Uri M.;Petzold, Linda R. (1998).Computer Methods for Ordinary Differential equations and Differential-Algebraic equations. Philadelphia: SIAM.ISBN978-0-89871-412-8.
Kazuo Murota (2009).Matrices and Matroids for Systems Analysis. Springer Science & Business Media.ISBN978-3-642-03994-2. (Covers the structural approach to computing the DAE index.)
Matthias Gerdts (2012).Optimal Control of ODEs and DAEs. Walter de Gruyter.ISBN978-3-11-024999-6.
Lamour, René;März, Roswitha; Tischendorf, Caren (2013).Differential-Algebraic equations: a Projector based analysis. Heidelberg: Springer.ISBN978-3-642-27554-8.
Ilie, Silvana; Corless, Robert M.; Reid, Greg (2006). "Numerical Solutions of Differential Algebraic Equations of Index −1 Can Be Computed in Polynomial Time".Numerical Algorithms.41 (2):161–171.CiteSeerX10.1.1.71.7366.doi:10.1007/s11075-005-9007-1.S2CID14684538.