dsolve/numeric/DAE_extension  find numerical solution of ordinary differentialalgebraic initial value problems

Calling Sequence


dsolve(, numeric, vars, method=meth, options)


Parameters


daesys



set or list; ordinary differential equation(s), algebraic equation(s) and initial conditions

numeric



literal; instruct dsolve to find a numerical solution

vars



(optional) dependent variable or a set or list of dependent variables for daesys

method



literal; keyword for specification of the method

meth



name; specification of the method, rkf45_dae, ck45_dae, or rosenbrock_dae

options



(optional) equations of the form keyword = value





Description


•

The dsolve DAE extension methods are standard numerical methods designed for ODE IVP that have been extended to the solution of DAE problems.


Specifically, the solvers have been extended to the solution of regular ODE and limited index 1 DAE (that can be isolated for a required dependent variable). The system is reduced to this specific index 1 system via index reduction.


Note: The index can be thought of as how far the DAE system is from being an ODE system.


The DAE extension methods then use the modified solver at each step. At the end of each step, the solution is projected back so that it satisfies any additional constraints of the problem. These additional constraints arise in the process of index reduction, and will only be present for systems for which index reduction is required.

•

dsolve has three extension methods, rkf45_dae, which is an extension of the rkf45 method, ck45_dae, which is an extension of the ck45 method, and rosenbrock_dae, which is an extension of the rosenbrock method.


As extensions, these methods retain many of the features of the original solvers, for example, events and range solutions. This page is concerned only with highlighting the differences between these methods, and any extension specific options.

•

One difference is that, by default, optimization is active for the extension methods, as the system is usually quite complex after relevant postprocessing has occurred.

•

For setup of the problem, it is required that the initial conditions are consistent, that is, that they satisfy any hidden constraints of the problem. In any cases where the constraints are not sufficiently satisfied, an error results, and the violated condition(s) are printed, allowing adjustment of the initial data to satisfy them.


In addition, if differential is false, it is possible to automatically compute values for any of the index 1 variables of the problem. Initial conditions for these variables need not be provided.

•

There are two major differences between the capabilities of the extension solvers and their original counterparts: the extension solvers can only be used with real valued problems and the initial values for the problem cannot be changed interactively.

•

Three options are specific to the DAE extension solvers:


This option specifies whether, after each step, the solution is projected back onto the set of constraints that are not in direct use by the solver. This is true by default. If the DAE IVP is highly stable, and speed is an issue, setting this to false can provide a reasonable solution in less time.


This option specifies that index reduction be performed until the system is fully differential (that is, does not take advantage of the index 1 capabilities of the modified solvers). This is false by default. The use of the index 1 capabilities of the solvers often provides a more stable and less stiff system than the full index reduction, and is usually faster.


This option specifies that parts of the extended system can be left in unsolved (implicit) form until they are evaluated. The solver determines which parts of the system must be put into solved form, in order to render the DAE problem numerically solvable, and which parts can be left in implicit form. This is essentially a smart form of the implicit option used for IVP problems (see dsolve[numeric,IVP]). This is a helpful option. It reduces the complication of the system derived quantities that must be computed to perform the numerical integration. The cost, though, is a linear solve every time the expressions must be evaluated. For problems in which the system is nearly in solved form with respect to the leading derivatives, this is somewhat slower than the direct method. For problems that are dense in the leading derivatives, this can be significantly faster.



Examples


The simple pendulum problem in natural coordinates:
>


 (1) 
>


 (2) 
>


>


 (3) 
>


 (4) 
Compare with projection=false:
>


 (5) 
>


>


 (6) 
>


>


 (7) 
>


 (8) 
Compare time with differential=true:
>


 (9) 
>


>


 (10) 
>


>


 (11) 
>


 (12) 

