Scribd
Upload
84 views15 pages

Lecture1 Errors Bisection Method

The document discusses numerical methods for solving non-linear systems. It defines numerical methods as using numerical approximation to solve mathematical analysis problems. Reasons for using numerical methods are given as being able to solve problems that have no exact solution. The document then discusses error analysis in numerical methods and defines absolute and relative errors. It provides examples of approximating constants and calculating the absolute and relative errors. Finally, it discusses root-finding numerical methods for non-linear equations like the bisection method.

Uploaded by

Mary Joy B. Aban
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
84 views15 pages

Lecture1 Errors Bisection Method

The document discusses numerical methods for solving non-linear systems. It defines numerical methods as using numerical approximation to solve mathematical analysis problems. Reasons for using numerical methods are given as being able to solve problems that have no exact solution. The document then discusses error analysis in numerical methods and defines absolute and relative errors. It provides examples of approximating constants and calculating the absolute and relative errors. Finally, it discusses root-finding numerical methods for non-linear equations like the bisection method.

Uploaded by

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

T E R 1 : S O L UT IO N TO

CHAP S
NO N -L I N E AR S YS T E M PART 1

U ME RICAL M ET HODS
CMPE 30063: N
NUMERICAL METHODS & ANALYSIS

DEFINITION: THE STUDY OF ALGORITHMS THAT USE NUMERICAL


APPROXIMATION FOR THE PROBLEMS OF MATHEMATICAL ANALYSIS. A
COMPLETE AND UNAMBIGUOUS SET OF PROCEDURES FOR THE SOLUTION
OF A PROBLEM, TOGETHER WITH COMPUTABLE ERROR ESTIMATES.
WHY USE NUMERICAL METHODS?
TO SOLVE PROBLEMS THAT CANNOT BE SOLVED EXACTLY

x u2
1 

2 

e 2
du
ERRORS
ERROR ANALYSIS – IN NUMERICAL ANALYSIS WE APPROXIMATE THE
EXACT SOLUTION OF THE PROBLEM BY USING NUMERICAL METHOD AND
CONSEQUENTLY AN ERROR IS COMMITTED. THE NUMERICAL ERROR IS
THE DIFFERENCE BETWEEN THE EXACT SOLUTION AND THE
APPROXIMATE SOLUTION.

ABSOLUTE ERROR– THE ABSOLUTE ERROR OF THE ERROR IS DEFINED AS


THE ABSOLUTE VALUE OF THE ERROR
ERRORS

RELATIVE ERROR – THE RELATIVE ERROR OF THE ERROR IS DEFINED AS


THE RATIO BETWEEN THE ABSOLUTE ERROR AND THE ABSOLUTE VALUE
OF THE EXACT SOLUTION .

PROVIDED THAT
EXAMPLE 1
DURING THE ELEMENTARY AND HIGH SCHOOL DAYS, THE CONSTANT IS
APPROXIMATED AS . DURING COLLEGE, THE CONSTANT IS APPROXIMATED
AS .
A.) DETERMINE THE ABSOLUTE APPROXIMATE ERROR IN REFERENCE TO
THE NEW APPROXIMATION.
B.) COMPARING THE NEW AND PREVIOUS APPROXIMATES, HOW MANY
PERCENT IS THE RELATIVE ERROR?
ROUND OFF AND TRUNCATION ERRORS
COMPUTERS REPRESENT NUMBERS IN FINITE NUMBER OF DIGITS AND
HENCE SOME QUANTITIES CANNOT BE REPRESENTED EXACTLY. THE
ERROR CAUSED BY REPLACING A NUMBER A BY ITS CLOSEST MACHINE
NUMBER IS CALLED THE ROUNDOFF ERROR AND THE PROCESS IS CALLED
CORRECT ROUNDING.
TRUNCATION ERRORS ALSO SOMETIMES CALLED CHOPPING ERRORS
ARE OCCURRED WHEN CHOPPING AN INFINITE NUMBER AND REPLACED
IT BY A FINITE NUMBER OR BY TRUNCATED A SERIES AFTER FINITE
NUMBER OF TERMS.
EXAMPLE 2
APPROXIMATE THE FOLLOWING DECIMAL NUMBERS TO THREE DIGITS BY
USING ROUNDING AND CHOPPING (TRUNCATION) RULES:
1.
2.
3.
4.
5.
SOLUTIONS OF NON-LINEAR EQUATIONS
NUMERICAL METHODS IN SOLVING THE ROOTS OF NON-LINEAR
EQUATIONS: (ROOT-FINDING METHODS)
1. BISECTION METHOD
2. FALSE POSITION / REGULAR FALSI METHOD
3. SECANT METHOD
4. FIXED-POINT ITERATION
5. NETWON’S / NEWTON-RAPHSON METHOD
BISECTION METHOD
BISECTION METHOD IS THE SIMPLEST AMONG ALL THE NUMERICAL
SCHEMES TO SOLVE THE TRANSCENDENTAL EQUATIONS. IT IS USED TO
FIND THE ROOTS OF AN EQUATION. IT SEPARATE INTERVALS AND SELECT
A SUB-INTERVAL IN WHICH ROOT OF THE EQUATION LIES. IT IS SIMPLE
AND ALSO RELATIVELY SLOW METHOD. IT IS BASED ON THE
INTERMEDIATE THEOREM FOR CONTINUOUS FUNCTIONS. THIS ROOT
FINDING METHOD IS ALSO CALLED AS DICHOTOMY METHOD OR THE
INTERVAL HALVING METHOD.
BISECTION METHOD
PROCEDURES:
1. OBTAIN THE INTERVAL AND CONTAINING THE ROOT.
2. EVALUATE THE MIDPOINT OF INTERVAL.

3. CHECK THE SIGN OF THE PRODUCT.

A.) IF THE SIGN OF THE PRODUCT IS NEGATIVE, THEN THE ROOT LIES IN
THE INTERVAL.

B.) IF , THEN THE ROOT IS EQUAL TO .


BISECTION METHOD
PROCEDURES:
4. REPEAT STEPS 2 AND 3 UNTIL IT REACHES ZERO.
EXAMPLE 3
FIND THE SOLUTION OF
SOLUTION
EXAMPLE 4
CONDUCT 6 ITERATIONS:

You might also like