Scribd
Upload
3 views

chap1com

This document discusses the fundamentals of number systems and numerical error analysis, emphasizing the importance of numerical analysis in engineering applications. It covers types of numbers, error types (round-off and truncation), number representation in computers, and significant digits. Additionally, it addresses computational efficiency and methods for error estimation.

Uploaded by

Dawit Gizachew
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
3 views

chap1com

This document discusses the fundamentals of number systems and numerical error analysis, emphasizing the importance of numerical analysis in engineering applications. It covers types of numbers, error types (round-off and truncation), number representation in computers, and significant digits. Additionally, it addresses computational efficiency and methods for error estimation.

Uploaded by

Dawit Gizachew
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 14

CHAPTER ONE

NUMBER SYSTEM AND NUMERICAL ERROR


ANALYSIS
Introduction
• In practical applications, an engineer would finally obtain results in a
numerical form.
• For example, from a set of tabulated data derived from an experiment,
inferences may have to be drawn; or, a system of linear algebraic
equations is to be solved.
• The aim of numerical analysis is to provide efficient methods for
obtaining numerical answers to such problems using computer or
digital technology
The Error Problem
Two kinds of numbers
 Exact numbers like 2,3, , π, e ,0.5
Approximate numbers:-Represents numbers to a certain degree of
accuracy
example:-3.14,3.1415,1.414 used to approximate π and
respectively.

Significant digits(figures): The digits that are used to express a number


The Error Problem
Round off:-In numerical computation one may faced large number of
digits and it is necessary to cut the result to a useable figures.
Truncation:-Approximate formulae in computation can cause
truncation error.

Numerical Errors= round-off error + truncation error


Number Representation and Storage in Computers

Word :-An entity that consists of a string of binary digits, or bits


whereby information is represented.
Number Systems:-A convention of representing a quantity by using
numbers

base-10 system
base-8 or octal system
base-16 or hexadecimal system
base-2 or binary
Number Representation and Storage in Computers
Integer Representation:-The most straight forward approach to represent
numbers in computer is signed magnitude method.
 The first bit represents the sign of the stored number and others used
to store the number.
Example:-we can represent -173 using 16 bits computer memory

=-173
Number Representation and Storage in Computers
Note:-the signed magnitude method described above is not used
to represent integers on conventional computers.
A preferred approach called the 2’s complement technique
directly incorporates the sign into the number’s magnitude rather
than providing a separate bit to represent plus or minus.
Exercise:-represent -173 using 2’s complement with 16 bit memory
compute:- a)19-7 using 8 bit memory
b) -10-4 using 8 bit memory
Number Representation and Storage in Computers

Floating-Point Representation:-used to represent fractional


quantities in computer.
m · be
Where m = the mantissa, b = the base of the number system being used,
and e = the exponent.
Sign=1, Negative and sign=0, Positive number.

The value for right figure is equal to +0.5*2 -3


Significant Digits

Significant Digits :-Sort of the "interesting" or "important" digits.


 All nonzero digits are significant.

 All zeroes between significant digits are significant.

 All zeroes which are both to the right of the decimal point and to the right of all non-zero
significant digits are themselves significant.

Exercise:- Round 846,396 to four, three, and two significant digits:


Numerical Cancellation

1. Adding a large and a small number (100000+1 100000)


2. Subtractive cancellation refers to the round-off induced when subtracting two
nearly equal floating-point numbers. (e.g. b2 >> 4ac in quadratic equation, one
root becomes zero.)
 The easiest example is with the formula for derivative: (f(x+h)-f(x))/h. If we use
f(x)=x2 with x=3.253 and h=0.002, we get (3.2552 – 3.2532)/0.002 =10 which is
poor f’(3.253)=6.506
Algorithm for Conversion from one base to another

• Conversion between Decimal and Binary


• Binary number to hexadecimal

Do Examples
ASCII Character Set
Computational Efficiency

The execution speed of a program for a numerical solution depends


mostly on the number of function (subroutine) calls and arithmetic
operations performed in the program.
Therefore, we like the algorithm requiring fewer function calls and
arithmetic operations.
Computational Methods for Error Estimation

True/Absolute error Et = true value – approximation


True percent relative error t = () * 100%
Approximate percent relative error
εa = ()*100%
Stopping criterion Terminate computation when εa < εs where εs is the desired
percent relative error.

You might also like