Scribd
Upload
48 views8 pages

Solving Equations Numerically: 21B Numerical Solutions

The document discusses three numerical methods for solving equations: 1) the bisection method, which works by repeatedly bisecting an interval containing a root; 2) Newton's method, which uses iterative calculations based on the function's derivative to home in on a root; and 3) the fixed-point method. It provides algorithms and examples for the bisection and Newton's methods. The bisection method is guaranteed to find a root but converges slowly, while Newton's method converges faster but may not work if the initial guess is not close to the root.

Uploaded by

raw.junk
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
48 views8 pages

Solving Equations Numerically: 21B Numerical Solutions

The document discusses three numerical methods for solving equations: 1) the bisection method, which works by repeatedly bisecting an interval containing a root; 2) Newton's method, which uses iterative calculations based on the function's derivative to home in on a root; and 3) the fixed-point method. It provides algorithms and examples for the bisection and Newton's methods. The bisection method is guaranteed to find a root but converges slowly, while Newton's method converges faster but may not work if the initial guess is not close to the root.

Uploaded by

raw.junk
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/ 8

21B Numerical Solutions

Solving Equations Numerically

21B Numerical Solutions

Three numeric methods for solving an equation numerically:


Bisection Method
Newton's Method
Fixed-point Method

21B Numerical Solutions

Bisection Method Algorithm


Let f(x) be a continuous function and let a1 and b1 be numbers

Pros:

satisfying a1<b1 and f(a1) f(b1)<0.


Let E denote the desired bound for the error |r-mn|.

Cons:

Repeat steps 1 to 5 for n=1,2,... until hn < E


1. Calculate
2. Calculate
3. Calculate
4. If
5. If

.
and if

then STOP.
(for error testing).

then set
then set

and
and

21B Numerical Solutions

EX 1: Approximate the real root to 2 decimal places.

21B Numerical Solutions

Newton's Method Algorithm


Let f(x) be a differentiable function and let x1 be an initial approximation
to the root, r of f(x) = 0. Let E denote a bound for the error |r-xn|.
Repeat the following step for n= 1,2,.. until |xn+1-xn|<E

Pros:
Cons:

21B Numerical Solutions

EX 2

Use Newton's method to approximate a root of 7x3+2x-5=0


to 5 decimal places.

21B Numerical Solutions

Warning on Newton's Method:

21B Numerical Solutions

You might also like