<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Systems, which are Differential Equations Described by Systems Deterministic of Ordinary</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Vladyslav Khaidurov</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tamara Tsiupii</string-name>
          <email>ts.tamara19@gmail.com</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tetiana Zhovnovach</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Artur Zaporozhets</string-name>
          <email>a.o.zaporozhets@nas.gov.ua</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Olena</string-name>
          <email>olena80@ukr.net</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kharchenko</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Serhii Kharchenko</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Ternopil, Ukraine</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Cherkasy Branch of the European University</institution>
          ,
          <addr-line>Smilyanska st., 83, Cherkasy, 18000</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Institute of General Energy of NAS of Ukraine</institution>
          ,
          <addr-line>172, Antonovycha st., Kyiv, 03150</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>National Aviation University</institution>
          ,
          <addr-line>Liubomyra Huzara ave., 1, Kyiv, 03058</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>National University of Life and Environmental Sciences of Ukraine</institution>
          ,
          <addr-line>15, Heroyiv Oborony st., Kyiv, 03041</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>The result of the work is obtaining difference schemes for dynamic systems, which are described by systems of ordinary differential equations of the second order based on the classical methods of Bossak, Newmark and the generalized α-method. For the developed modifications of the methods, the corresponding software was developed in the MATLAB system of applied mathematics for conducting numerical experiments and testing methods. Deterministic system, Newmark's method, Bossack's method, generalized α-method, The development of computational methods for modeling dynamic systems occupies a significant place in solving scientific and technical tasks in today's conditions. A number of requirements are put forward to such methods, in particular, the methods that are developed should be stable and those that obtain a numerical solution with minimal errors [1; 2]. The rapid development of computer technology makes it possible to apply these methods in practice. Therefore, the work will demonstrate a tool for obtaining basic mathematical dependencies based on classical methods for the analysis of nonlinear systems, for example, systems described by Cauchy problems for second-order ordinary differential equations.</p>
      </abstract>
      <kwd-group>
        <kwd>Systems</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        2021 Copyright for this paper by its authors.
 ′′ +   ′ +  ( ) = 0,
 ( ) =  ̄  +  +  3.
where  – dynamic variable (or generalized coordinate),  ( ) – some non-linear function,  –
dissipation parameter. Depending on the different values of this parameter, different transformations of
the phase portrait of the nonlinear oscillator occur. In order to form a complete view of the nonlinear
oscillator near the catastrophe of the assembly, it is necessary to draw a function  ( ) species
equality (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ). In equation (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ), the function  ( ) has the following form:
      </p>
      <p>
        Equality (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) corresponds to an assembly type disaster. When varying parameter values  ̄ and  the
behavior of the system will also change. Therefore, the second type of disaster is called an "assembly"
disaster. In the behavior of the phase portrait curves, it is possible to observe both trajectories without
a jump, with smooth development, and with a jump in development.
      </p>
      <p>The catastrophe theory explains the dependence of unstable forms of the phase portrait on the
number of control parameters. Yes, if we have only one control parameter, we can observe a fold
disaster. If we have two control parameters, as in our case  ̄ і  , a build crash is observed.</p>
      <p>
        Based on equalities (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) and (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ), we can form a complete view of the nonlinear oscillator near the
assembly catastrophe:
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
In equation (
        <xref ref-type="bibr" rid="ref3">3</xref>
        )  is dissipation parameter,  ̄ and  are control parameters [5; 6].
2.1.
      </p>
    </sec>
    <sec id="sec-2">
      <title>Newmark’s method</title>
      <p>The Newmark method is a numerical integration method for solving differential equations. It is
widely used in the calculations of many engineering, technical, chemical problems for the numerical
evaluation of dynamic characteristics. The method is named after a former professor of civil engineering
at Illinois State University who developed it in 1959 for use in structural dynamics.</p>
      <p>
        To derive the formulas and analyze them, consider the Cauchy problem for an ordinary differential
equation of the second order. Its mathematical representation has the form:
 ′′ +   ′ +  ̄  +  +  3 = 0.
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
      </p>
      <p>
        Since the system (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) is nonlinear, then the classical Seidel method can be used for its numerical
solution. For this system, Seidel’s method will look like this:
 ′′ +   ′ +  +  +  3 = 0;
 ( 0) =  0,  ′( 0) =  0′.
      </p>
      <p>1
1
  +1 =   + ℎ  + ℎ2 (</p>
      <p>−  )   + ℎ2   +1,
 ( ++11) = − (   (+1+1) +    (++11) +  + (  (++11))3),</p>
      <p>0 =  0,  0 =  0′,  0 = −(  0 +   0 +  +  03),
where  is iteration number.</p>
      <p>The second version of Newmark's method can be presented in the following form:
  +1 =   + ℎ  + ℎ2 (1 −  )   + ℎ2   +1,</p>
      <p>2
  +1 =   + ℎ(1 −  )  + ℎ   +1,
  +1 = −(   +1 +    +1 +  +   3+1).</p>
      <sec id="sec-2-1">
        <title>Then we will have So,</title>
        <p>+1 =   + ℎ  − ℎ2 (1 −  ) (   +    +  +   3) − ℎ2 (   +1 +    +1 +  +   3+1),
2
  +1 =   − ℎ(1 −  )(   +    +  +   3) − ℎ (   +1 +    +1 +  +   3+1),
  +1(1 + ℎ2 ) =   + ℎ  − ℎ2 (1 −  ) (   +    +  +   3) − ℎ2 (   +1 +  +   3+1),
2
  +1(1 +  ℎ ) =   − ℎ(1 −  )(   +    +  +   3) − ℎ (   +1 +  +   3+1).</p>
      </sec>
      <sec id="sec-2-2">
        <title>Finally, the formulas for mathematical calculation take the form:</title>
        <p>+1 =
  + ℎ  − ℎ2 (12 −  ) (   +    +  +   3) − ℎ2 (   +1 +  +   3+1),</p>
        <p>1 + ℎ2
  +1 =   − ℎ(1 −  )(   +    +  +   3) − ℎ (   +1 +  +   3+1).</p>
        <p>1 +  ℎ</p>
        <p>Values   +1 and   +1 are calculated using computational methods. For example, Seidel's method
for this system of equations will have the form:
 ( +1) =
 +1
 ( +1) =
 +1
  + ℎ  − ℎ2 (12 −  ) (   +    +  +   3) − ℎ2 (   (+1) +  + (  (+)1)3) ,
  − ℎ(1 −  )(   +    +  +   3) − ℎ (   (++11) +  + (  (++11) )3)
1 + ℎ2
1 +  ℎ
.</p>
        <p>The third version of the Newmark method looks like this:
  +1 =   − ℎ(1 −  )(   +    +  +   3) − ℎ (   +1 +  +   3+1);</p>
        <p>
          1 +  ℎ
  +1 =
  + ℎ  − ℎ2 (12 −  ) (   +    +  +   3) − ℎ2 (   +1 +  +   3+1),
.
1 + ℎ2
(
          <xref ref-type="bibr" rid="ref6">6</xref>
          )
(
          <xref ref-type="bibr" rid="ref7">7</xref>
          )
        </p>
        <p>
          It should be noted that in (
          <xref ref-type="bibr" rid="ref7">7</xref>
          ) the second equation is substituted into the first equation. Next is the
value   +1, which is then substituted into the equation:
  +1 =   − ℎ(1 −  )(   +    +  +   3) − ℎ (   +1 +  +   3+1).
        </p>
        <p>1 +  ℎ</p>
      </sec>
      <sec id="sec-2-3">
        <title>In this case, Seidel's method solves only one equation [7; 8].</title>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>2.2. Generalized  -method</title>
      <p>Formulas for solving a nonlinear oscillator near the assembly catastrophe using the generalized 
method are derived similarly to Newmark's method. The difference is that the values of all variables at
 + 1 time steps are taken as averages, taking into account the average theorem.</p>
      <p>The equality that we need to solve by the method of generalized α has the following form:</p>
      <sec id="sec-3-1">
        <title>In equation (8),  is dissipation parameter,  ̅ and  control parameters.</title>
        <p>
          As before, let's mark  ′′ =  ,  ′ =  , and let's complete the equality (
          <xref ref-type="bibr" rid="ref8">8</xref>
          ). Now let's write down the
system of differential equations at  + 1 instant of time according to the method of generalized  .
  +1 =   + (1 −  )    +    +1,
        </p>
        <p>1
  +1 =   +    + ( −  )   2  +   2  +1,</p>
        <p>2
{  +1−  +    +1−  +  ̄   +1−  +  +  3+1−  = 0,
where   +1−  ,   +1−  ,   +1−  are equal to:
  +1−  = (1 −   )  +1 +     ,   +1−  = (1 −   )  +1 +     ,</p>
        <p>+1−  = (1 −   )  +1 +     .</p>
        <p>Moreover, the values of all constants are equal to:</p>
        <p>1 1 2
 = −   +   ,  = (1 −   +   ) ,   =
2 4
2 ∞ − 1
 ∞ + 1
,   =  ∞ .</p>
        <p>∞ + 1
With the condition that 0 ≤  ∞ ≤ 1.</p>
        <p>Let's rewrite (9) considering (10):
  +1 =   + (1 −  )   +    +1</p>
        <p>1
  +1 =   +    + ( −  )   2  +   2  +1</p>
        <p>
          2
(1 −   )  +1 +     +  (1 −   )  +1 +      +
{+ ̄ (1 −   )  +1 +     +  + (1 −   ) 3+1 +    3 = 0
(
          <xref ref-type="bibr" rid="ref8">8</xref>
          )
(9)
(10)
(11)
(12)
        </p>
        <p>We see that equality (12) is written in vector form. Therefore, to simplify the notations, we introduce
the vectors:</p>
        <p>From equality (11) we see that  is a vector, and therefore velocity and acceleration are also vectors.</p>
      </sec>
      <sec id="sec-3-2">
        <title>We obtained a closed system of 3 algebraic equations, with 3 unknowns. Everything that is on the  + 1 step is unknown and it is necessary to look for their value. To do this, we move all variables  + 1 steps to the left, and n steps to the right:</title>
        <p>{
   +1 −   +1 = −  − (1 −  )</p>
        <p>1
   2  +1 −   +1 = −  −    − ( −  )   2</p>
        <p>2
(1 −   )  +1 +  (1 −   )  +1 +  ̄ (1 −   )  +1 + (1 −   ) 3+1 =</p>
        <p>= −    −      −     −  −    3
  +1 = −  − (1 −  )   ,   +1 = −  −  v − (21 −  )   2  ,</p>
        <p>+1 = −    −      −     −  −    3.
{

Next, we divide the first equality (13) by  , and the second equality – by   2
  +1 −  1</p>
        <p>+1 =  1
1
1</p>
        <p>Now subtract the first from the second equality (14), and from the third the first multiplied by
(1 −   ).</p>
        <p>1
  +1 −   2   +1 =   2   +1 −  1
1 1
1 −   )   +1 +  ̄ (1 −   )  +1 + (1 −   ) 3+1 =   +1 − 
1 −     +1.</p>
        <p>For simplification, we introduce  = ( (1 −   ) + (1 −   )⁄( )). Rewrite (15):
{   +1 +  ̄ (1 −   )  +1 + (1 −   ) 3+1 =   +1 − 
1 −     +1.</p>
      </sec>
      <sec id="sec-3-3">
        <title>Next, we subtract the first multiplied by  from the second equality (16).</title>
        <p>In order to avoid division by zero, let's multiply equality (17) by  :
 ̄ (1 −   )  +1 +</p>
        <p>=   +1 − 
1 −     +1 +    +1 −</p>
        <p>+1.</p>
        <p>+1 + (1 −   ) 3+1 =
( ̄  (1 −   ) +  )  +1 + (1 −   )
=    +1 −    +1 + (

−
1 −    )   +1.</p>
        <p>3+1 =
From here we find  . From the first equality (16), we find  :</p>
        <p>+1 −  Δ   +1 =  Δ
 (  +1 +   +1) −   +1.</p>
      </sec>
      <sec id="sec-3-4">
        <title>From the first equality (14), we find  :</title>
        <p>Let's write down the obtained formulas of the generalized α method for solving a nonlinear oscillator
near the assembly catastrophe:
( ̄  (1 −   ) +  )  +1 + (1 −   )</p>
        <p>3+1 −
−   +1 +    +1 − (
−
1 −    )   +1 = 0,</p>
        <p>1</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>2.3. Bossak’s method</title>
      <p>Bossak’s method is a continuation of Newmark’s method. The derivation of the formulas for solving
the nonlinear oscillator near the assembly catastrophe is carried out similarly to the Newmark’s method.
The difference is that the values of the second derivatives at  + 1 time steps are taken as averages
(taking into account the average theorem).</p>
      <p>
        The equality that we need to solve by Bossak’s method has the form (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ). Everything that is on the
 + 1 step is unknown and it is necessary to find their value. To do this, we will transfer all the variables
 + 1 steps to the left, and n steps to the right:
      </p>
      <p>+1 −   +1 = −  − (1 −  )   
  2  +1 −   +1 = −  −    − ( −  )   2 
{(1 −  )  +1 +    +1 +  ̄   +1 +  +  3+1 = −</p>
      <p>We see that the equalities in (20) are written in vector form. Therefore, to simplify the notations, we
introduce the vectors
(20)
(21)
(22)
Next, we divide the first equality (21) by   , and the second equality – by   2.</p>
      <p>{

(1 −  )  +1 +    +1 +  ̄   +1 +  +  3+1 =   +1
1
1
  +1 − 
  +1 = 
{(1 −  )  +1 +    +1 +  ̄   +1 +  +  3+1 =   +1</p>
      <p>Now subtract the first from the second equality (22), and subtract the first multiplied by (1 −  )
from the third.</p>
      <p>{
( +
1 − 
  +1 −   2   +1 =   2   +1 − 
)  +1 +  ̄  +1 +  +  3+1 =   +1 −</p>
      <p>+1.
For simplification, we introduce  = ( + (1 −  )⁄( )). Rewrite (23):
{   +1 +  ̄  +1 +  +  3+1 =   +1 − 




1
Next, we subtract from the second equality (24) the first multiplied by  .</p>
      <p>̄  +1 +  +  3+1 + 
   +1 =   +1 −
1 − 

  +1 − 

   +1 +    +1.</p>
      <sec id="sec-4-1">
        <title>In order to avoid division by zero, let's multiply equality (25) by  Δ :</title>
        <p>Δ ( ̄  +1 +  +  3+1)+    +1 =  Δ   +1 −
  +1 −    +1 +    +1. (26)</p>
      </sec>
      <sec id="sec-4-2">
        <title>From here we find  . From the first equality (24), we find  : We find  from the first equality:</title>
        <p>+1 −     +1 = 

1 − 

1
 ( ̄  +1 +  +  3+1)+    +1 −    +1 +</p>
        <p>+1 +    +1 −    +1 = 0,
(  +1 +   +1)−   +1,   +1 =</p>
        <p>Let's write down the obtained formulas of Bossack’s method for solving a nonlinear oscillator near
the assembly catastrophe:</p>
      </sec>
      <sec id="sec-4-3">
        <title>Solution (27) is represented as a curve.</title>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>2.4. Programs and Calculation experiments</title>
      <p>The general structure of the developed software consists of modules, the names of which are shown
in Figure 1. The software was developed in the computer mathematics environment MATLAB.</p>
      <sec id="sec-5-1">
        <title>Module of Results</title>
      </sec>
      <sec id="sec-5-2">
        <title>Visualization</title>
      </sec>
      <sec id="sec-5-3">
        <title>Module of Initial</title>
      </sec>
      <sec id="sec-5-4">
        <title>Conditions</title>
      </sec>
      <sec id="sec-5-5">
        <title>Program Software for</title>
      </sec>
      <sec id="sec-5-6">
        <title>Modelling Dynamic</title>
      </sec>
      <sec id="sec-5-7">
        <title>Systems</title>
      </sec>
      <sec id="sec-5-8">
        <title>Module of Solving</title>
      </sec>
      <sec id="sec-5-9">
        <title>Ninlinear Equetions on one time-step</title>
      </sec>
      <sec id="sec-5-10">
        <title>Module of Glogal</title>
      </sec>
      <sec id="sec-5-11">
        <title>Constants</title>
        <p>The developed fragment of the program in MATLAB, with the help of which the solution is found
at each time step, has the following form:
t(i+1) = t(i) + h;
A_n = -v(i) - (1-gamma)*h*A(i);
B_n = -x(i) - h*v(i) - (0.5-betta)*h^2*A(i);
C_n = -al_m*A(i) - g*k2*v(i) - a*k2*x(i) - (k2*x(i))^3 - b;
D = betta*h^2*C_n - B_n*k1 - g*k3*h*(gamma*B_n - betta*h*A_n);
A = k3*betta*h^2;
B = 3*k2*k3^2*betta*h^2*x(i);
C = (3*k2^2*k3*x(i)^2+a*k3)*betta*h^2 + k1 + k3*g*gamma*h;
x(i+1) = Newton (x(i));
v(i+1) = gamma/(betta*h) * (x(i+1) + B_n)-A_n;
A(i+1) = 1/(gamma*h) * (v(i+1) + A_n);
i = i+1;</p>
        <p>The obtained dependences of the methods for the considered dynamic systems were tested on
different values of the initial conditions and model constants. Some of the results are shown in Figure
2 and Figure 3. Initial Condition is  (0) = 1;  (0) = 2.</p>
        <p>Classical methods (Euler’s method and Runge-Kutta method) gave less accurate results.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>3. General conclusions</title>
      <p>In the work, the main dependencies are obtained on the basis of the implicit methods of Newmark,
Bossak and the generalized  -method for the example of a nonlinear oscillator near the assembly
catastrophe. Curves of changes are plotted for different values of control parameters. The programs of
implicit methods of Newmark, Bossack and the generalized α-method, Euler method and Runge-Kutta
method with automatic step selection for the solution of a nonlinear oscillator near the assembly
catastrophe are also implemented. Appropriate software for modeling deterministic nonlinear systems,
which are described by Cauchy problems of the second order for ordinary differential equations, has
been developed.</p>
    </sec>
    <sec id="sec-7">
      <title>4. References</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Franke</surname>
            ,
            <given-names>M.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lynch</surname>
            ,
            <given-names>P.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Healy</surname>
            ,
            <given-names>A.J.</given-names>
          </string-name>
          ,
          <source>“A 50-Year History of the Dynamic Systems and Control Division” ASME J. Dyn. Sys. Meas., and Control</source>
          . Pp.
          <volume>223</volume>
          -
          <fpage>233</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Craig</surname>
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Kluever</surname>
          </string-name>
          . Dynamic Systems: Modeling, Simulation, and Control.
          <source>ISBN: 978-1-119- 63540-6. Wiley; 1st edition</source>
          .
          <year>2015</year>
          ,
          <volume>496</volume>
          p.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Kuznetsov</surname>
            <given-names>A.P.</given-names>
          </string-name>
          <string-name>
            <surname>Fluctuations</surname>
          </string-name>
          . Catastrophes. Bifurcations. Chaos. Saratov.
          <year>2000</year>
          . 99 p.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Kuznetsov</surname>
            <given-names>A.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsov</surname>
            <given-names>S.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ryskin</surname>
            <given-names>N.M.</given-names>
          </string-name>
          <article-title>Nonlinear oscillations</article-title>
          . M.:
          <string-name>
            <surname>Fizmatlit</surname>
          </string-name>
          ,
          <year>2002</year>
          . 309 p.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Lambert</surname>
            <given-names>J</given-names>
          </string-name>
          .
          <source>Computational Methods in Ordinary Differential Equations</source>
          ,
          <year>1973</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Shampine</surname>
            <given-names>L.</given-names>
          </string-name>
          <article-title>Numerical solution of ordinary differential equations</article-title>
          ,
          <source>Chapman &amp; Hall</source>
          ,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Shampine</surname>
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gordon</surname>
            <given-names>M. Computer</given-names>
          </string-name>
          <article-title>Solution of Ordinary Differential Equations</article-title>
          , Freeman,
          <year>1975</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Shampine</surname>
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gladwell</surname>
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thompson</surname>
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Solving ODEs with</surname>
            <given-names>MATLAB</given-names>
          </string-name>
          , Cambridge,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>