Skip to article frontmatterSkip to article content

IVP systems

Few applications involve an initial-value problem with just a single dependent variable. Usually there are multiple unknowns and a system of equations to define them.

We now upgrade our IVP definition, Definition 6.1.1.

We use the terms IVP system and vector-valued IVP interchangeably; a system of scalar IVPs can be put into the form of (6.3.3) by appropriate definitions of u\mathbf{u} and f\mathbf{f}, as shown in Example 6.3.1.

6.3.1Numerical solutions

The generalization of any scalar IVP solver to handle systems is straightforward. Consider Euler’s method, which in system form becomes

ui+1=ui+hf(ti,ui),i=0,,n1. \begin{split} \mathbf{u}_{i+1} &= \mathbf{u}_i + h\,\mathbf{f}(t_i,\mathbf{u}_i), \qquad i=0,\ldots,n-1. \end{split}

The vector difference equation (6.3.4) is just Euler’s formula applied simultaneously to each component of the ODE system. Because operations such as addition and multiplication translate easily from scalars to vectors, Function 6.2.1 that we wrote for scalar IVPs works for systems as well. Practically speaking, the only changes that must be made are that the initial condition and the ODE function have to be coded to use vectors.

In the rest of this chapter we present methods as though they are for scalar equations, but their application to systems is taken for granted. The generalization of error analysis can be more complicated, but our statements about order of accuracy and other properties are true for systems as well as scalars. The codes are all written to accept systems.

6.3.2Transformation of high-order systems

Fortunately, the ability to solve first-order ODE systems implies the ability to solve systems of higher differential order, too. The reason is that there is a systematic way to turn a higher-order problem into a first-order one of higher dimension.

The trick illustrated in the preceding examples is always available. Suppose yy is a scalar dependent variable in the system. You should introduce a component of u\mathbf{u} for yy, yy', etc., up to but not including the highest derivative appearing anywhere for yy. This is done for each scalar variable in the original system. There should be one component of u\mathbf{u} for each scalar initial condition given. Many equations for the first-order system then come from the trivial relationships among all the lower derivatives. The remaining equations for the system come from the original, high-order equations. In the end, there must be as many scalar component equations as unknown first-order variables.

6.3.3Exercises

References
  1. Britton, N. F. (2003). Essential Mathematical Biology. Springer.
  2. Baer, S. M., & Erneux, T. (1986). Singular Hopf Bifurcation to Relaxation Oscillations. SIAM Journal on Applied Mathematics, 46(5), 721–739. 10.1137/0146047