MM 233 NUMERICAL ANALYSIS WITH PYTHON (Elective)*

Texts:
1.Vernon L. Ceder, The Quick Python Book, Second Edition, Manning.

2.Richard L. Burden and J. Douglas Faires, Numerical Analysis, Ninth Edition,

Brooks/Cole, Cengage Learning.

Unit I

In this unit we discuss the basics of python based on chapters 4,5,6,8, 9, 10 and 18 of Text 1. All
topics of chapters 4-9 must be dicussed using exmples from mathematics. In chapter 10, only
sections 10.1-10.4 need to be discussed. Chapter 18 also shoud be discussed to get an overview of
the packages in python. The students should be encouraged to write programs related with
mathematical problems. (Some of the problmes are listed in the syllabus)

Unit II

Visualizing Data with Graphs - learn a powerful way to present numerical data: by drawing graphs
with Python. The unit is based on Chapter 2 of Text 3. The sections Creating Graphs with Matplotlib
and Plotting with Formulas must be done in full. In the section Programming Challenges, the
problems Exploring a Quadratic Function Visually, Visualizing Your Expenses and Exploring the
Relationship Between the Fibonacci Sequence and the Golden Ratio must also be discussed.

Unit III

The unit is based on chapters 4 and 7 of Text 3. Here we discuss Algebra and Symbolic Math with
SymPy and Solving Calculus Problems. In Chapter 4 the sections Defining Symbols and Symbolic
Operations, Working with Expressions, Solving Equations and Plotting Using SymPy should be
done in full. In the section Programming Challenges, the problems Factor inder, Graphical Equation
Solver, Summing a Series and Solving Single-Variable Inequalities also should be discussed. In
chapter 7, some problems discussed namely, Finding the Limit of Functions, Finding the Derivative
of Functions, Higher-Order Derivatives and Finding the Maxima and Minima and Finding the
Integrals of Functions are to be done. In the section Programming Challenges, the problems Verify
the Continuity of a Function at a Point, Area Between Two Curves and Finding the Length of a
Curve also should be discussed.

Unit IV

In this unit we discuss some numerical methods for solving system of linear equations, for finding
roots of equations and polynomial interpolation from Text 2.We first discuss bisection method,
methods of Newton, secant method and method of false position for solving equations of the form
f(x)=0. The topics can be found in sections 2.1 (only upto example 2) and 2.3. Interpolation and the
Lagrange Polynomial as per section 3.1 (only upto example 2) is to be discussed. Next we discuss
Gauss Elimination with backward substitution method and LU decomposition method as per
sections 6.1 (only upto Algorithm 6.1) and 6.5 ( Theorem 6.19 statement only and exclude
subsection Permutation Matrices. Also avoid the discussion of matrix factorization using Maple).
Students should be encouraged to do problems and write python program for each method (see ref
1).

Unit V

Here we discuss some numerical methdos for integration, differentiation and solving initial value
problems of ordinary differential equations from Text 2. The methods for approximating first
drivative of a function as per section 4.1 are to be discussed. They include forward-difference
formula, (n+1)-point formula, in particular three-point formulas. Rest of the toipics in this section
need not be discussed. Next we discuss the methods for numerical integration. Trapezoidal rule and
simposns rules are to be discussed from section 4.3. Then we discuss (n+1 )-point closed Newton-
Cotes formula and derive trapezoidal, Simpson's rule and Simpson's 3/8 rules from it. Remaining
topics in the section need not be done. We also discuss Composite Simpson’s rule and Composite
Trapezoidal rule from section 4.4 (theorems 4.4 and 4.5 only). Our discussion about numerical
methods for solving initial value problems of ordinary differential equations include Euler's
method, Runge-Kutta methods of second and fourth order. The topics can be found in sections 5.2
(excluding subsection Error Bounds for Euler’s Method) and section 5.4 (only Midpoint Method for
Runge-Kutta Methods of order two and Runge-Kutta method of order four need to be discussed
without any proof). Students should be encouraged to do problems and write python program for
each method (see ref 1).

Some problems for Unit I are listed below

Factorial of a number

Checking primality of a number

Listing all primes below a given number

Prime factorization of a number

Finding all factors of a number

gcd of two numbers using the Euclidean Algorithm

Finding the multiples in Bezout’s Identity

checking the convergence and divergence of sequences and series.

(For more problems visit https://www.nostarch.com/doingmathwithpython/,

The students should be encouraged to write programs to solve the problems given in the sections as
well as in the exercises.

The end semester evaluation should contain a theory and a practical examinations.

The duration of the theory examination will be 3 hours, with a maximum of 50 marks.

In the question papers for the theory examination, importance should be given to the definition,
concepts and methods discussed in each units, and not for writing long programs.

Practical examination shall also be of 3 hours duration for a maximum of 25 marks.

Weightage of marks for theory and a practical examinations is listed below

Unit Theory Practical

I 10 (two questions out of four)

II 10 5 (one questoin out of two)

III (one question out of two) 5 (one questoin out of two)

IV 20 (two questoins out of four) 5

V 20 (two questoins out of four) one questoin out of two (one from each unit)

Continuous evaluation follows the pattern - 5 marks for attendence, 10 marks for the internal
examination and 10 marks for the practical record. The record should contain at least 20 programs.

The practice of writing the record should be maintained by each student throughout the course
and it should be dually certified by the teacher in charge/internal examiner and evaluated by the
external examiner of practical examination.

References:

1.Jaan Kiusalaas, Numerical Methods in Engineering with Python3, Camdbridge University Press,
2013.

2.NumPy Reference Release 1.17.0, Written by the NumPy community. (available at

3.https://docs.python.org/3/tutorial/