ASSIGNMENT

Topic: Numerical Analysis

Roll no: 04

Class/Section: BS Math-7

Submitted to: Mam Zartasha Aslam

Submitted by: Arslan Nasir

Page 1
 Numerical analysis
‘Numerical analysis’ is a rigorous mathematical discipline in which such
problems, and algorithms for their solution, are analysed in order to
establish the condition of a problem or the stability of an algorithm and
to gain insight into the design of better and more widely applicable
algorithms. This course contains some elementary numerical analysis,
and technical terms like condition and stability are discussed, although
the mathematical content is kept to a minimum. The course also covers
some aspects of the topic not normally found in numerical analysis
texts, such as numerical software considerations.
In summary, the purposes of this course are:
 To explain floating-point arithmetic, and to describe current
implementations of it.
 To show that design of a numerical algorithm is not necessarily
straightforward, even for some simple
 problems.
 To illustrate, by examples, the basic principles of good numerical
techniques.
 To discuss numerical software from the points of view of a user
and of a software designer.
Error analysis
Error analysis is a method commonly used to identify the cause of
student errors when they make consistent mistakes. It is a process of
reviewing a student’s work and then looking for patterns of
misunderstanding. Errors in mathematics can be factual, procedural, or
conceptual, and may occur for a number of reasons.
How to Conduct Error Analysis
The following steps describe the error analysis process, applied to
mathematics

Page 2
(Howell, Fox, & Morehead, 1993):
 Collect a sample of student work for each type of problem (e.g.,
single-digit
 addition; two-digit multiplication with regrouping), with at least
three to five
 items for each problem type.
 Have the student verbalize or think aloud as s/he solves the
problems without
 providing any type of cues or prompting.
 Record all student responses in written and verbal format.
 Analyze the responses and look for patterns among common
problem types.
 Look for examples of "exceptions" to an apparent pattern
(accurate "exceptions"
 could signal that the student does not fully understand the
procedure or concept).
 Describe the patterns observed in simple language and the
possible reasons for the
 student’s problems (e.g., if a student did not regroup double-digit
addition
 problems, it could be a sign that the student does not understand
the concept of
 place value).
 Interview the student by asking him/her to explain how s/he
solved the problem to
 confirm suspected error patterns.
Floating-point Arithmetic
Floating-point Arithmetic (FP) is arithmetic using formulaic
representation of real numbers as an approximation to support a trade-
off between range and precision. For this reason, floating-point
computation is often used in systems with very small and very large real
numbers that require fast processing times. In general, a floating-point

Page 3
number is represented approximately with a fixed number of significant
digits (the significand) and scaled using an exponent in some fixed base;
the base for the scaling is normally two, ten, or sixteen. A number that
can be represented exactly is of the following form significand x
base exponent
Approximations in Numerical Analysis
Mathematical problems arising from scientific applications present a
wide variety of difficulties that prevent us from solving them exactly.
This has led to an equally wide variety of techniques for computing
approximations to quantities occurring in such problems in order to
obtain approximate solutions. In this lecture, we will describe the types
of approximations that can be made, and learn some basic techniques
for analyzing the accuracy of these approximations.
Sources of Approximation Suppose that we are attempting to solve a
particular instance of a problem arising from a mathematical model of a
scientific application. We say that such a problem is well-posed if it
meets the following criteria:
 The problem has a unique solution.
 A small perturbation in the problem data results in a small
perturbation in the solution; i.e., the solution depends
continuously on the data.

Page 4