Solving Picard Iteration: Step-by-Step Guide

  • Thread starter AkilMAI
  • Start date
In summary: Finally, we can compare this approximate solution with the actual solution to see how accurate it is. In summary, Picard's iteration is a useful method for finding approximate solutions to nonlinear differential equations. In this problem, we used it to find an approximation of the solution to the differential equation u' = v and v' = -u with initial conditions u(0) = 1 and v(0) = 0. By performing four steps of the iteration, we were able to find an approximation of the solution and compare it to the actual solution.
  • #1
AkilMAI
77
0
I'm doing some revision and I'm having some trouble understanding the principle behind picard's iteration.I tried to do some practice by tackling the following problem but I got nowhere as I don't know with what should I substitute f(s,u(s)) in the integral.
The problem states the following:
u'= v and v'= −u
with initial conditions u(0) = 1 and v(0) = 0, find an approximate solution by
performing 4 steps of Picard iteration and compare the results with the actual solution.
If someone has the time and patience to enlighten me with a step by step explanation that will be incredible.
Thanks at least for taking the time to read this
 
Physics news on Phys.org
  • #2
.Picard's iteration is a way of finding approximate solutions to nonlinear differential equations by using an iterative process. The idea is to start with an initial guess for the solution, then use this guess to calculate a better approximation of the solution. This is repeated until the desired accuracy is reached. In this problem, the differential equation is u' = v and v' = -u, with initial conditions u(0) = 1 and v(0) = 0. The first step of Picard's Iteration is to make an initial guess for the solution. Since we know the initial conditions, we can make an educated guess for the solution: u(s) = 1 and v(s) = 0. Now we use this initial guess to calculate a better approximation of the solution. This is done by substituting the initial guess into the equation and solving for the next step of the iteration:u'(s) = v(s) = 0 v'(s) = -u(s) = -1We can now use these equations to calculate our next approximation of the solution. We do this by integrating each equation with respect to s and using the initial conditions to find the constants of integration:u(s) = 1 + sv(s) = -sNow that we have a better approximation of the solution, we can repeat this process until we reach the desired accuracy. We do this by substituting our current guess for the solution back into the equation and solving for the next step:u'(s) = v(s) = -s v'(s) = -u(s) = -1 - sWe then integrate each equation with respect to s and use the initial conditions to find the constants of integration:u(s) = 1 + s - s^2/2v(s) = -s + s^2/2We can continue to repeat this process until we reach the desired accuracy. After four steps of Picard iteration, we get the following approximation of the solution:u(s) = 1 + s - s^2/2 + s^3/6 - s^4/24v(s) = -s + s^2/2 - s^3/6 + s^4/
 

FAQ: Solving Picard Iteration: Step-by-Step Guide

What is Picard Iteration?

Picard Iteration is a mathematical method for solving fixed point problems, which involve finding a point that doesn't change when a certain function is applied to it. It is commonly used in scientific and engineering applications.

How does Picard Iteration work?

Picard Iteration involves repeatedly applying a certain function to an initial guess until the result converges to a fixed point. This process is continued until the desired level of accuracy is achieved.

What are the advantages of using Picard Iteration?

Picard Iteration is a relatively simple and straightforward method that can be easily implemented in various numerical algorithms. It also has a wide range of applications and can be used to solve a variety of problems.

What are some common challenges when using Picard Iteration?

One of the main challenges of using Picard Iteration is finding a suitable initial guess that will lead to convergence. Another challenge is determining the number of iterations needed to achieve the desired level of accuracy.

How can I implement Picard Iteration in my own research or work?

Picard Iteration can be implemented in various programming languages, such as Python, MATLAB, or C++. It is important to understand the theory behind it and carefully choose the initial guess and number of iterations to ensure convergence and accuracy.

Similar threads

Replies
2
Views
855
Replies
4
Views
3K
Replies
3
Views
3K
Replies
1
Views
4K
Replies
14
Views
921
Replies
1
Views
1K
Replies
3
Views
1K
Back
Top