Agora

Taylor Series and Picard Method

y=mx+by = mx + b As we know, **tangent lines are decent approximations** for small intervals. However, they only work for a limited number of points. To approximate larger functions, we use **Taylor series**: f(x)=n=0f(n)(a)n!(xa)nf(x) = \sum_{n=0}^{\infty} \frac{f^{(n)}(a)}{n!} (x-a)^n

Problem Example:

Taylor Polynomial Solution Steps:

  1. The differential equation is: dydx=xy\frac{dy}{dx} = x - y
  2. Compute the second derivative for the Taylor polynomial: d2ydx2=1y+(y)(xy)=1y+yyxy\frac{d^2y}{dx^2} = 1 - y' + (-y') * (x - y) = 1 - y' + y * y' - x * y'
  3. Using the initial condition y(0)=1y(0) = 1: dydx(0)=01=1\frac{dy}{dx}(0) = 0 - 1 = -1 d2ydx2(0)=1(1)+(1)(1)=1\frac{d^2y}{dx^2}(0) = 1 - (-1) + (1)*(-1) = 1
  4. Approximate the solution using the degree 2 Taylor polynomial: y(x)1+(1)(x0)+1/2(x0)2=1x+0.5x2y(x) \approx 1 + (-1)*(x - 0) + 1/2*(x - 0)^2 = 1 - x + 0.5 x^2

Picard's Iteration Method:

y0(x)=y0,yn+1(x)=y0+x0xf(t,yn(t))dt y_0(x) = y_0, \\ y_{n+1}(x) = y_0 + \int_{x_0}^{x} f(t, y_n(t)) \, dt

This iterative method approximates the solution of dy/dx=f(x,y)dy/dx = f(x,y) starting at the initial point (x0,y0)(x_0, y_0). Each iteration uses the previous function inside the integral to get closer to the exact solution.

Checking Accuracy:

We can check how good this approximation is by using **Euler's method** with a small step size and comparing the results to the exact solution and the Taylor polynomial. Below is a graph showing:

Pickard's method is very intresting the idea is that succesive functions converge on the function Let's see that in action for a harder diffrential equation