[go: up one dir, main page]
Scribd
Upload
135 views3 pages

Isoclines For y 2x y

Euler's method is a procedure for approximating solutions to initial value problems for first-order differential equations. It constructs a piecewise linear approximation called a polygonal line. Specifically, it uses the slope of the tangent line at each point to estimate the next value, marching forward in small steps h. This results in a sequence of approximations yn that can be calculated recursively using equations (2) and (3) in the document.

Uploaded by

ArvinAL
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
135 views3 pages

Isoclines For y 2x y

Euler's method is a procedure for approximating solutions to initial value problems for first-order differential equations. It constructs a piecewise linear approximation called a polygonal line. Specifically, it uses the slope of the tangent line at each point to estimate the next value, marching forward in small steps h. This results in a sequence of approximations yn that can be calculated recursively using equations (2) and (3) in the document.

Uploaded by

ArvinAL
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Example 1.

Draw the isoclines with their direction markers and sketch several solution
curves, including the the curve satisfying the given initial condition

y ′ = 2x2 − y, y(0) = 0.

SOLUTIONS

The isoclines for the given equations are the parabolas 2x2 − y = C, here C is an arbitrary
constant.
4

y 2

K 1.5 K1.0 K
0.5 0 0.5 1.0 1.5

K1

Figure 1. Isoclines for y ′ = 2x2 − y

y 2

K2 K1 0 1 2
x

K1

K2

Figure 2. Direction field for y ′ = 2x2 − y


4

y(x)
2

K2 K1 0 1 2
x

K
1

K
2

Figure 3. Solutions to y ′ = 2x2 − y

Section 1.4 The Approximation Method of Euler

Euler’s method (or the tangent line method) is a procedure for constructing approximate
solutions to an initial value problem for a first-order differential equation

y ′ = f (x, y),
(1)
y(x0 ) = y0 .
The main idea of this method is to construct a polygonal (broken line) approximation to
the solutions of the problem (1).

Assume that the the problem (1) has a unique solution ϕ(x) in some interval centered at x0 .
Let h be a fixed positive number (called the step size) and consider the equally spaced points

xn := x0 + nh, n = 0, 1, 2, . . .
The construction of values yn that approximate the solution values ϕ(xn ) proceeds as follows.
At the point (x0 , y0 ), the slope of the solution to (1) is given by dy/dx = f (x0 , y0). Hence, the
tangent line to the curve y = ϕx at the initial point (x0 , y0 ) is

y − y0 = f (x0 , y0)(x − x0 ), or

y = y0 + f (x0 , y0)(x − x0 ).

Using the tangent line to approximate ϕx, we find that for the point x1 = x0 + h

ϕ(x1 ) ≈ y1 := y0 + f (x0 , y0)(x − x0 ).


Next, starting at the point (x1 , y1), we construct the line with slope equal to f (x1 , y1 ). If
we follow the line in stepping from x1 to x2 = x1 + h, we arrive at the approximation
ϕ(x2 ) ≈ y2 := y1 + f (x1 , y1)(x − x1 ).
Repeating the process, we get

ϕ(x3 ) ≈ y3 := y2 + f (x2 , y2)(x − x2 ),


ϕ(x4 ) ≈ y4 := y3 + f (x3 , y3)(x − x3 ), etc.
This simple procedure is Euler’s method and can be summarized by the recursive formulas

xn+1 := x0 + (n + 1)h, (2)

yn+1 := yn + f (xn , yn )(x − xn ), n = 0, 1, 2, . . . (3)

Figure 1. Polygonal-line approximation given by Euler’s method

You might also like