Numerical

Computation
Lecture 1

Dr. Metwally Rashad

2023
Course Chart

1/30
 Course Contents

Part 1 (4 Weeks) Part 2 (4 Weeks) Part 3 (4 Weeks)

 Foundations  More Algorithms
- The Role of Algorithms in - Sorting Algorithms
Computing - Graph Algorithms
- Design and Analysis algorithms - Dynamic Programming
- Growth of Functions - Greedy Algorithms
 Numerical Methods
- Solving Nonlinear
Equations
- Solving Linear Systems
- Interpolation,
Polynomial Approximation 2/30
 Course Category

Design and Analysis

Numerical Methods
Algorithms
- Solving Nonlinear Equations - Growth of Functions
- Interpolation , Polynomial Approximation - Sorting
- Numerical Integration - Graph Algorithms
- Solving Linear Systems - Dynamic Programming
- Greedy Algorithms
3/30
Course Material
Offline
- Richard L. Burden, J. Douglas Faires.
Numerical Analysis, Nine Edition, 2016.
- Slides: Should be available after the class
Online (Coursera)
- Divide and Conquer, Sorting and Searching,
and Randomized Algorithms
- Integral Calculus and Numerical Analysis for
Data Science
- Dynamic Programming, Greedy Algorithms
4/30
 Online (Coursera)
Online Material - Divide and Conquer, Sorting and Searching,
and Randomized Algorithms
- Integral Calculus and Numerical Analysis for
Data Science
- Dynamic Programming, Greedy Algorithms

5/31
5/30
Online Material (cont.)

6/30
Online Material (cont.)

7/30
Online Material (cont.)

8/30
Online Material (cont.)

9/31
9/30
3/18
Weighting of
Mid-Term Examination 20 %
Assessment
Quizzes 10 %
Absence 10 %
Activities (offline + online) 20 %
Final-term Examination 40 %
-----------------------------------------
Total 100 %

10/30
Lec.1: Introduction
Introduction to Numerical Method
 Numerical analysis is the study of algorithms for the
problem of continuous mathematics

 Numerical methods continues this long tradition of

practical mathematical calculations.

 Numerical methods: Algorithms that are used to obtain

numerical solutions of a mathematical problem.
12/30
Introduction to Numerical Method (cont.)
 Numerical methods are procedures that allow for efficient solution of a
mathematically formulated problem in a finite number of steps to
within an accuracy.

 Numerical methods commonly consist of a set of algorithms to perform

predetermined mathematical operations leading to an approximate
solution of a specific problem.
 We start with first Part : Solving Nonlinear Equations
- Bisection Method
- Newton’s Method
13/30
Introduction to Algorithms
 An algorithm is a set of computational steps for solving a well-
specified computational problem.
 Properties of an algorithm
 Input: an algorithm has input values from a specified set
 Output: from each set of input values an algorithm produces output values from a
specified set. The output values are the solution to the problem
 Definiteness: the steps of an algorithm must be defined precisely
 Correctness: an algorithm should produce the correct output values for each set of
input values
 Finiteness: an algorithm should produce the desired output after a finite number of
steps for input in the set
 Effectiveness: it must be possible to perform each step of an algorithm exactly and
in a finite amount of time
 Generality: the algorithm should be applicable for all problems of the desired form
14/30
not just for a particular set of input values
Introduction to Algorithms (cont.)
 What kinds of problems are solved by algorithms?
• Basic numerical algorithms
- arithmetic problems like finding the sum, product or quotient of two
numbers
• Cryptographic algorithms
- digitally sign and encrypt your data when it’s sent over the internet
• Sorting and searching algorithms
- allow programmers to arrange data in memory in many different ways
• Signal processing algorithms
- compress audio and video data very efficiently
15/30
Introduction to Algorithms (cont.)
• Graph algorithms
- find an efficient path through some kind of network — be it a computer
network, a road network
• Computational geometry algorithms
- important in games and are also heavily used in CAD software
• Computer vision algorithms
- allow software to recognize features in images

• Computer graphics algorithms

- Video games and movies are the most spectacular uses

16/30
Introduction to Algorithms (cont.)
 Algorithms Task

17/30
Introduction to Algorithms (cont.)
 Analysis: predict the cost of an algorithm in terms of
resources and performance

 Design: creating an efficient algorithm to solve a

problem in an efficient way using minimum time and
space.
18/30
Introduction to Algorithms (cont.)
 Time Complexity & Space Complexity

 Time Complexity is a function describing the a

mount of time required to run an algorithm in
terms of the size of the input.

 Space Complexity is a function describing the

a mount of memory an algorithm takes in terms
of the size of the input.
19/30
Introduction to Matlab Programming
 Matlab Definition
 Matlab stands for Matrix Laboratory , published by MathWorks
 MATLAB is a powerful technical computing system for handling
scientific and engineering calculations.
 The MATLAB environment allows the user to:
o Manage variables
o Import and export data
o Perform calculations
o Generate plots
o Develop and manage files for use with MATLAB.
20/30
Introduction to Matlab Programming(cont.)
 Uses of Matlab
Math and computation
Algorithm development
Modeling, simulation, and prototyping
Data analysis, exploration, and visualization
Scientific and engineering graphics
Application development, including graphical user
interface building.
21/30
Introduction to Matlab Programming(cont.)
 Matlab Environment
 Local Environment Setup
o Setting up MATLAB R 2013 a environment is a
matter of few clicks

o After downloading the installer from the mathworks

the software can be installed through few clicks

22/30
Introduction to Matlab Programming(cont.)

6/18
Introduction to Matlab Programming(cont.)

6/18
Introduction to Matlab Programming(cont.)

6/18
Introduction to Matlab Programming(cont.)

6/18
Introduction to Matlab Programming(cont.)

6/18
Introduction to Matlab Programming(cont.)
 Matlab Desktop

6/18
Introduction to Matlab Programming(cont.)
 Matrix Operations

29/30
6/18
Lec.2: The Role of
Algorithms in Computing
30/30
Thank
you!