MHB Integral equation by successive approximation

Click For Summary
The discussion centers on solving an integral equation using the method of successive approximation, also known as Picard Iterations. The user is exploring the convergence of the sequence defined by the iterations, specifically questioning the predictability of the leading terms in the polynomials generated. They express uncertainty about finding an explicit form for the approximations, denoted as $y_n(x)$. The integral equation relates to a differential equation with initial conditions, and the user provides specific values for $y_0$ and $y_1$. The conversation highlights the complexities involved in deriving solutions through this iterative method.
Suvadip
Messages
68
Reaction score
0
if
png.latex
, then what will be
png.latex
. In fact I was solving the integral equation
png.latex
by the method of successive approximation.
 
Mathematics news on Phys.org
I was not familiar with the name of the method until I noticed it's the same as Picard Iterations (after some googling). I tried some ways to see a pattern in the polynomials but I failed. Especially the leading terms are very unpredictable in my opinion. Perhaps it's not possible to find an explicit form for $y_n(x)$.

What's the background of this problem?
 
suvadip said:
if
png.latex
, then what will be
png.latex
. In fact I was solving the integral equation
png.latex
by the method of successive approximation.

Under appropriate conditions the solution of the differential equation ...

$\displaystyle y^{\ '} = f(x,y),\ y(0)= y_{0}\ (1)$

... must satisfy the following integral equation...

$\displaystyle y = y_{0} + \int_{x_{0}}^{x} f\{t, y(t)\}\ d t\ (2)$

If You define...

$\displaystyle y_{1} = y_{0} + \int_{x_{0}}^{x} f\{t, y_{0}\}\ d t\ (3)$

... and...

$\displaystyle y_{n} = y_{0} + \int_{x_{0}}^{x} f\{t, y_{n-1}\}\ d t\ (4)$

... then the sequence of $y_{n}$ converges to the solution $y(x)$...

In Your case is $y_{0}=1$, $x_{0}=0$ and $y_{1} = (1 + x)^{2}$, so that is $f(x,1) = 2\ (1+x)$...

Kind regards

$\chi$ $\sigma$
 
Here is a little puzzle from the book 100 Geometric Games by Pierre Berloquin. The side of a small square is one meter long and the side of a larger square one and a half meters long. One vertex of the large square is at the center of the small square. The side of the large square cuts two sides of the small square into one- third parts and two-thirds parts. What is the area where the squares overlap?

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K