Example 1.  Use Picard iteration to find the solution of the I.V.P.  

        [Graphics:Images/PicardIterationMod_gr_19.gif].  

Solution 1.

First define the function  [Graphics:../Images/PicardIterationMod_gr_20.gif]  and the initial condition  [Graphics:../Images/PicardIterationMod_gr_21.gif]  by typing:

[Graphics:../Images/PicardIterationMod_gr_22.gif]

[Graphics:../Images/PicardIterationMod_gr_23.gif]

Picard iteration for generating the first six approximations is started with the Mathematica command:

[Graphics:../Images/PicardIterationMod_gr_24.gif]

[Graphics:../Images/PicardIterationMod_gr_25.gif]

 

    Techniques from calculus can be used to find the solution  [Graphics:../Images/PicardIterationMod_gr_26.gif].  

Notice that when the last term in the Picard approximation is dropped, what is left is a Maclaurin (or Taylor) polynomial approximation.  

We can express  [Graphics:../Images/PicardIterationMod_gr_27.gif]  as a Maclaurin series and observe that the sequence  [Graphics:../Images/PicardIterationMod_gr_28.gif]  is converging to the solution.

      [Graphics:../Images/PicardIterationMod_gr_29.gif]   

Mathematica can sum the infinite series to obtain the analytic solution.

[Graphics:../Images/PicardIterationMod_gr_30.gif]



[Graphics:../Images/PicardIterationMod_gr_31.gif]

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

(c) John H. Mathews 2005