SEM VI Syllabus
SEM VI Syllabus
Semester-VI
BMATH613: Complex Analysis
Total Marks: 150 (Theory: 75, Internal Assessment: 25 and Practical: 50)
Workload: 4 Lectures, 4 Practicals (per week), Credits: 6 (4+2)
Duration: 14 Weeks (56 Hrs. Theory + 56 Hrs. Practical) Examination: 3 Hrs.
Course Objectives: This course aims to introduce the basic ideas of analysis for complex
functions in complex variables with visualization through relevant practicals. Emphasis has
been laid on Cauchy’s theorems, series expansions and calculation of residues.
Course Learning Outcomes: The completion of the course will enable the students to:
i) Learn the significance of differentiability of complex functions leading to the
understanding of Cauchy−Riemann equations.
ii) Learn some elementary functions and valuate the contour integrals.
iii) Understand the role of Cauchy−Goursat theorem and the Cauchy integral formula.
iv) Expand some simple functions as their Taylor and Laurent series, classify the nature
of singularities, find residues and apply Cauchy Residue theorem to evaluate
integrals.
Reference:
1. Brown, James Ward, & Churchill, Ruel V. (2014). Complex Variables and
Applications (9th ed.). McGraw-Hill Education. New York.
64
Department of Mathematics, University of Delhi
Additional Readings:
i. Bak, Joseph & Newman, Donald J. (2010). Complex Analysis (3rd ed.).
Undergraduate Texts in Mathematics, Springer. New York.
ii. Zills, Dennis G., & Shanahan, Patrick D. (2003). A First Course in Complex Analysis
with Applications. Jones & Bartlett Publishers, Inc.
iii. Mathews, John H., & Howell, Rusell W. (2012). Complex Analysis for Mathematics
and Engineering (6th ed.). Jones & Bartlett Learning. Narosa, Delhi. Indian Edition.
65
Department of Mathematics, University of Delhi
12. Use ML inequality to show that W1 \ 2mW ≤ , where C is the straight line
+ C;u
segment from 2 to 2 + i. While solving, represent the distance from the point z to the
points i and – i, respectively, i.e. m − 9 and m + 9 on the complex plane ℂ.
h
13. Show that 1 T[\ , where z1/2 is the principal branch of the square root function and
C
C is the line segment joining 4 to 8 + 6i. Also plot the path of integration.
14. Find and plot three different Laurent series representations for the function Um =
\
, involving powers of z.
C+@
15. Locate the poles of Um = and specify their order.
u +C \ +u
t `t
16. Locate the zeros and poles of ^m = \
and determine their order. Also justify
that Res(g, 0) = −π 2 3.
C
17. Evaluate 1 X exp YZ 2m, where + 0 denotes the circle {z : |z| = 1} with positive
T
orientation. Similarly evaluate 1 X + ] @C \ 2m.
T
ote: For practicals: Sample materials of files in the form Mathematica/Maple 2011.zip,
www.jblearning.com/catalog/9781449604455/.
67
Department of Mathematics, University of Delhi
Course Objectives: This course introduces the basic concepts of ring of polynomials and
irreducibility tests for polynomials over ring of integers, used in finite fields with applications
in cryptography. This course emphasizes the application of techniques using the adjoint of a
linear operator and their properties to least squares approximation and minimal solutions to
systems of linear equations.
Courses Learning Outcomes: On completion of this course, the student will be able to:
i) Appreciate the significance of unique factorization in rings and integral domains.
ii) Compute the characteristic polynomial, eigenvalues, eigenvectors, and eigenspaces, as
well as the geometric and the algebraic multiplicities of an eigenvalue and apply the
basic diagonalization result.
iii) Compute inner products and determine orthogonality on vector spaces, including
Gram−Schmidt orthogonalization to obtain orthonormal basis.
iv) Find the adjoint, normal, unitary and orthogonal operators.
Additional Readings:
i. Luenberger, David G. (1998). Investment Science, Oxford University Press. Delhi.
ii. Ross, Sheldon M. (2011). An elementary Introduction to Mathematical Finance (3rd
ed.). Cambridge University Press. USA.
Course Objectives: This course develops the ideas underlying the Simplex Method for
Linear Programming Problem, as an important branch of Operations Research. The course
covers Linear rogramming with applications to transportation, assignment and game problem.
Such problems arise in manufacturing resource planning and financial sectors.
Course Learning Outcomes: This course will enable the students to:
i) Learn about the graphical solution of linear programming problem with two variables.
ii) Learn about the relation between basic feasible solutions and extreme points.
iii) Understand the theory of the simplex method used to solve linear programming
problems.
iv) Learn about two-phase and big-M methods to deal with problems involving artificial
variables.
v) Learn about the relationships between the primal and dual problems.
vi) Solve transportation and assignment problems.
vii) Apply linear programming method to solve two-person zero-sum game problems.
Unit 4: Applications
Transportation Problem: Definition and formulation; Methods of finding initial basic feasible
solutions; Northwest-corner rule. Least- cost method; Vogel’s approximation method;
Algorithm for solving transportation problem.
Assignment Problem: Mathematical formulation and Hungarian method of solving.
Game Theory: Basic concept, Formulation and solution of two-person zero-sum games,
Games with mixed strategies, Linear programming method of solving a game.
References:
1. Bazaraa, Mokhtar S., Jarvis, John J., & Sherali, Hanif D. (2010). Linear
Programming and etwork Flows (4th ed.). John Wiley and Sons.
81
Department of Mathematics, University of Delhi
Additional Readings:
i. Hillier, Frederick S. & Lieberman, Gerald J. (2015). Introduction to Operations
Research (10th ed.). McGraw-Hill Education (India) Pvt. Ltd.
ii. Thie, Paul R., & Keough, G. E. (2014). An Introduction to Linear Programming and
Game Theory. (3rd ed.). Wiley India Pvt. Ltd.
82
Department of Mathematics, University of Delhi
Keywords: Artificial variables, Big-M method, Duality, Extreme points and basic feasible
solutions, Simplex method, Two-phase method, Vogel’s approximation method.
83