The first part will consider the ``initial value problem.'' (IVP) in detail. The second part will present the ``boundary value problem'' (BVP) in a cursory way (see notes for 575B course, where we use variational methods to recast the BVP for its numerical solution, a powerful and elegant analytical technique that leads to a host of important numerical schemes).
An ordinary differential equation is a function that
maps
,
a natural number,
and it involves
the independent variable,
, and finite set
of derivatives of
.
It has the form
We can recast (1) in ``normal form.'' Solving for
we have
![]() | |||
Let with | |||
Then (1)
is equivalent to ![]() | |||
![]() | |||
Definition: Autonomous and Non-autonomous ODE'S:
where
becomes the last equation of (2) |
Example) We recast the following initial value problem as a
normalized autonomous system.
| Let | ![]() |
![]() | |||
![]() | |||
![]() | |||
![]() | |||
| Made autonomous: | ![]() | ||