msc app math

32
APPLIED MATHEMATICS DEPARTMENT FACULTY OF TECHNOLOGY AND ENGINEERING THE M. S. UNIVERSITY OF BAODA VADODARA 2 – Years Postgraduates course in M. Sc (Applied Mathematics) and M. Sc (Industrial Mathematics) F.S. of M.Sc. I (Applied Mathematics) Subject code Subject Scheme of Teaching Scheme of Examination L P Total Th. Pr. Total AMT 2105 Ordinary differential Equations 5 - 5 100 - 100 AMT 2123 Linear Algebra and Calculus of Variation 5 - 5 100 - 100 AMT 2106 Numerical Analysis 5 - 5 100 - 100 AMT 2124 Implementation of Mathematical Algorithms 5 - 5 100 - 100 AMT 2110 Applied Analysis I 5 - 5 100 - 100 AMT 2109L Programming Practicals - 3 3 - 50 50 TOTAL 25 3 28 500 50 550 S.S. of M.Sc. I (Applied Mathematics) Subject code Subject Scheme of Teaching Scheme of Examination L P Total Th. Pr. Total AMT 2201 Applied Statistics 5 - 5 100 - 100 AMT 2220 Functional Analysis 5 - 5 100 - 100 AMT 2203 Partial Differential Equations 5 - 5 100 - 100 AMT 2204 Applied Analysis II 5 - 5 100 - 100 AMT 2205 Mechanics 5 - 5 100 - 100 AMT 2221L Practicals on numerical Analysis and Statistical methods - 3 3 - 50 50 TOTAL 25 3 28 500 50 550

Transcript of msc app math

Page 1: msc app math

APPLIED MATHEMATICS DEPARTMENT FACULTY OF TECHNOLOGY AND ENGINEERING

THE M. S. UNIVERSITY OF BAODA VADODARA

2 – Years Postgraduates course in M. Sc (Applied Mathematics) and M. Sc (Industrial Mathematics)

F.S. of M.Sc. I (Applied Mathematics)

Subject code Subject Scheme of Teaching

Scheme of Examination

L P Total Th. Pr. Total AMT 2105 Ordinary differential Equations 5 - 5 100 - 100

AMT 2123 Linear Algebra and Calculus of Variation

5 - 5 100 - 100

AMT 2106 Numerical Analysis 5 - 5 100 - 100

AMT 2124 Implementation of Mathematical Algorithms

5 - 5 100 - 100

AMT 2110 Applied Analysis I 5 - 5 100 - 100 AMT 2109L Programming Practicals - 3 3 - 50 50

TOTAL 25 3 28 500 50 550

S.S. of M.Sc. I (Applied Mathematics)

Subject code Subject Scheme of Teaching

Scheme of Examination

L P Total Th. Pr. Total AMT 2201 Applied Statistics 5 - 5 100 - 100 AMT 2220 Functional Analysis 5 - 5 100 - 100 AMT 2203 Partial Differential Equations 5 - 5 100 - 100 AMT 2204 Applied Analysis II 5 - 5 100 - 100 AMT 2205 Mechanics 5 - 5 100 - 100

AMT 2221L Practicals on numerical Analysis and Statistical methods

- 3 3 - 50 50

TOTAL 25 3 28 500 50 550

Page 2: msc app math

On the the basis of merit rank of the M.Sc.-I(First year), first 10 students can opt M.sc.(Applied Mathematics)-Industrial Mathematics course in M.Sc.-II and remaining students will continue with M.Sc.(Applied Mathematics) course in M.Sc.-II.

F.S. of M.Sc.II (Applied Mathematics) Industrial Mathematics.

Subject code Subject Scheme of Teaching

Scheme of Examination

L P Total Th. Pr. Total

AMT 2301 Numerical methods for Partial Differential Equations

5 - 5 100 - 100

AMT 2313 Simulation and Mathematical Modelling

5 - 5 100 - 100

AMT 2303 Fluid Dynamics 5 - 5 100 - 100 AMT 2304 Optimization- I 5 - 5 100 - 100

AMT 2305 Wavelets and Image processing

5 - 5 100 - 100

AMT 2306 Modeling Seminar - 3 3 - 50 50

AMT 2312

Practicals on Numerical methods for PDE, Wavelets and Image processing And Optimization

- 3 3 - 50 50

TOTAL 25 6 31 500 100 600

S.S. of M.Sc.II (Applied Mathematics) Industrial Mathematics.

Subject code Subject Scheme of Teaching

Scheme of Examination

L P Total Th. Pr. Total AMT 2416 Optimization- II 4 1 5 80 20 100 AMT 2417 Computational Fluid Dynamics 4 1 5 80 20 100

AMT 2418 Neural Networks and Fuzzy Systems

4 1 5 80 20 100

AMT 2407L General Viva - 3 3 - 50 50

AMT 2420 Dissertation Based on Industrial Problems

- 5 5 100 - 100

TOTAL 12 11 23 340 110 450

Page 3: msc app math

F. S. of M. Sc. II (Applied Mathematics).

Subject code Subject Scheme of Teaching

Scheme of Examination

L P Total Th. Pr. Total

AMT 2301 Numerical methods for Partial Differential Equations

5 - 5 100 - 100

AMT 2313 Simulation and Mathematical Modelling

5 - 5 100 - 100

AMT 2303 Fluid Dynamics 5 - 5 100 - 100 AMT 2304 Optimization- I 5 - 5 100 - 100

AMT 2307L Practicals on Numerical methods for PDE And Optimization

- 3 3 - 50 50

Elective I 5 - 5 100 - 100 Seminar - 3 3 - 50 50 TOTAL (Without Dissertation) 25 6 31 500 100 600 TOTAL (With Dissertation) 20 6 26 400 100 500

S.S. of M.Sc. II (Applied Mathematics).

Subject code Subject Scheme of Teaching

Scheme of Examinitation

L P Total Th. Pr. Tota

l AMT 2401 Discrete Mathematics 5 - 5 100 - 100

AMT 2402 Differential Geometry and Integral equations

5 - 5 100 - 100

AMT 2403 Advanced Analysis 5 - 5 100 - 100 Elective II 5 - 5 100 - 100

AMT 2407L General Viva - 3 3 - 50 50

TOTAL (Without

Dissertation) 20

3 23 400 50 450

TOTAL (With Dissertation) 15

3 18 300+ 200

(Dissertation) 50 550

Elective I: Any one of the subjects below should be selected as an optional paper AMT 2308 Applied Fourier Analysis AMT 2309 Mathematical Control Theory – I AMT 2310 Theoretical Computer Science Elective II: Any one of the subjects below should be selected as an optional paper AMT 2404 Wavelet Analysis AMT 2405 Theory of Algorithms AMT 2406 Mathematical Control Theory – II

Page 4: msc app math

In lieu of two elective papers a student can select a self-study project and submit a dissertation at the end of forth semester. This project is to be carried out under the guidance of a teacher from the department. The project may also be carried out in an industry or organization keeping one of the teachers from the department as a joint guide. The number of projects offered will depend upon the availability of teachers to guide. The project work will be evaluated, on the basis of the dissertation and viva Examination conducted at the end of the forth semester, out of 200 marks. Optional papers taught will depend on the availability of the teachers in the department. Eligibility and standard for passing M.Sc (Applied Mathematics) and M.Sc (Industrial Mathematics) is as per common norms of Applied M.Sc’s.

UPDATED CURRICULAM EFFECTIVE FROM JUNE 2014

FIRST SEMESTER of M. Sc. - I

AMT 2105: Ordinary Differential Equations

• Mathematical modeling by means of ordinary differential equations

• Reduction of nth order equation into first order systems • Existence and uniqueness of solution of a nonlinear system of ordinary differential

equations, Lispschitz condition, Gronwall's lemma. • Phase plane Analysis • Linearization of nonlinear systems

• Autonomous and non-autonomous Linear system Theory: Linear Dependence and independence of solution, Wronskian.

• Transition matrix(fundamental matrix ) for a linear system, solution of a nonlinear system by variation of parameters method, computation of transition matrix , eigenvalue method, Peano-Backer series method.

• Discrete dynamical systems

• Stability of dynamical systems, Lyapunov, exponential and asymptotic stability and their characterization.

• Sturm -Liouville equations, Eigenvalue problems

• Series solution of non-autonomous systems, Bessel and Legandre series, Frobenius method.

Reference Books: 1. S.L. Ross: Differential equations, Blaisdell publishing company, First

edition, 1964 2. Birkhoff G and Rota G.C.: Ordinary differential equations, Boston, 1962 3. Coddington E. A and N. Levinson: Theory of ordinary differential

equations, McGraw-Hill, New York, 1955. 4. Saber N. Elaydi: An introduction to Differential Equations, Springer-

Page 5: msc app math

verlag, Second edition, 1995 5. V.I. Arnold: Ordinary Differential Equations, Prentice- Hall of India,

New Delhi, 1998 6. Verhulst: Nonlinear Equations and Dynamical systems 7. Walter: ordinary Differential Equation.

AMT 2123: Linear Algebra and Calculus of Variation Linear Algebra

• Revision of basic concepts of vector spaces.

• Real world problems leading to a linear systems. • Linear Operators:

Operations on Linear transformations, Its norm, Hermitian adjoint of an Operator, Hermitian , Unitary , normal and compact operators, Cayley-

• Hamilton theorem. • Eigen Values: Eigen values and eigen vectors of an operator and its applications,

Eigen values and eigen vectors of special operators (Hermitian, unitary, normal and compact operators).

• The spectral theorem (The Real and complex case).

• System of Linear Differential Equations: • Diagonalization of an operator and of matrices, Matrix exponential, Solution of

system of linear differential equations, Jordan Canonical form of matrices.

• Quadratic Forms: Quadratic forms, reduction and classification of quadratic forms, Principal axes theorem.

• Stability and convergence issues of linear systems:

• Existence and uniqueness of operator equations, Ill condition systems, condition numbers-computations and properties, stability of linear systems, Pre-conditioning of systems.

Calculus of variation • Linear Functionals, necessary conditions for existence of minimum of a functional,

Euler equations, Variational notation. • Functional with many independent and dependent variables, natural and essential

boundary conditions, transversability conditions. Minimization of functional with constraints, Direct and Approximate method.

Reference Books :

1. Serge Lange: Linear Algebra, Addison-Wesley Publishing Company, Second edition, 1970.

2. Strang Gilbert: Linear Algebra and its Applications, Cengage Learning India Private Limited, Fourth edition, 2006.

3. Vanloan C.F and Golub G.H: Matrix computations, John Hopkins university press, Third edition, 1996.

Page 6: msc app math

4. David C. Lay: Linear Algebra and its applications, Pearson education, Third edition, 2003.

5. Jin Ho Kwak, Sungpyo Hong: Linear Algebra, Birkhauser (Springer International Edition), Second edition, 2004.

6. Inder K. Rana: An Introduction to Linear Algebra, Ane Books Private Limited, 2010.

7. Dr. Gunadhar Paria: Linear Algebra, New Central Book Agency (P.) Ltd., First edition, 1992.

8. Francis B. Hildebrand: Methods of Applied Mathematics, Prentice-Hall Inc., Second Edition, 1965.

9. Louis Konzsik: Applications of Calculus of Variations, CRC publications. 10. L. Elsgolks: Differential equation and Calculus of Variations, Mir publishers.

AMT 2106: Numerical Analysis

• Computer Arithmetic: Floating point numbers and round off errors, Absolute and relative errors.

• Polynomial Interpolation: Hermite's interpolation formula with error analysis, Richardson interpolation, splines and spline interpolation ,Aitken extrapolation

• Numerical differentiation, Gaussian quadrature, Romberg integration, adaptive quadrature

• Solution of system of Linear equations: Matrix inversion, Jordan's method, Escalator method and iterative method, The LU and Cholesky factorizations, Pivoting and constructing an algorithm based on Gaussian elimination method

• Solution of equations by iterative methods (Jacobi’s method, Gauss-Seidel method) • Algebraic Eigen value problem : • Properties of eigen values and eigen vectors

• Power method • Inverse power method

• Jacobi's method, Given's method • Schur and Gershgorins theorem • Orthogonal factorization

• QR algorithm for eigen value problem • Eigen values of complex matrix and complex eigen vectors

• Approximation: Different types of approximations, Least square polynomial approximation, Polynomial approximation by use of orthogonal polynomials, approximation with Chebyshev polynomials.

• Numerical Solution of ODE: single step method-Runge Kutta methods, Multistep method - Milne Simpson's method.

• System of non linear equations: Newton Raphson’s method

Page 7: msc app math

Reference Books: 1. C.E. Froberg: Introduction to Numerical Analysis, Addision Wesley publishing

Company, sixth edition, 1981. 2. S.S. Sastri: Introductory Methods of Numerical Analysis, Prentice Hall of India, New

Delhi, 1997. 3. E.V. Krishnamurthy and S.K.Sen: Computer based numerical Algorithms, East –

West press Pvt. Ltd. 1976 4. Conte S.D and Carl deboor: Elementary Numerical Analysis: an algorithmic

approach, Mc Graw Hill company, Third edition, 1981 5. M.K. Jain: Numerical analysis for scientists and Engineers, New Age International

Ltd. Publishing, 1992 6. J.D.Faires and R. Burden: Numerical methods, second edition, Brooks/cole publishing

Co.,1998. 7. E.Hairer, E.P.Norsett and G.Wanner: Solving ordinary differential equations I and II,

Springer series in computational mathematics 8, Springer Berlin, 1993. 8. Stoer and Burlisch: Introduction to Numerical Analysis.

AMT2124 Implementation of Mathematical Algorithms MATLAB

• Basic features :Variables, Comments, Punctuations, Matlab Workspace, Simple math, Complex numbers, Built-in Functions.

• Script / M-files : Files and directory management, File I/O Arrays and array operation, Relational and Logical operations, Set, Bit and Base conversion function, Character strings, String function, Time functions, Cell arrays and structures.

• Control Structures : For loops, While loops, If-else-end, Switch-case Statements, Function M-files, Command function duality, Inline functions, Debugging tools.

• Applications: • Solving system of linear equations, Eigen values and Eigen vectors of a matrix,

Sparse and Special matrices • Roots of polynomial equations, Operators on Polynomials

• Graphics : 2-D and 3-D Graph plotting Mathematical Algorithms through Object oriented programming:

• Reorientation of Object oriented Programming language and concepts (C++/java)

• Classes, methods, inheritance, polymorphism, interfaces etc. • Implementing mathematical objects, their operations and methodologies for: • Matrices, Polynomials, Complex numbers, Trigonometric functions

• Applications using objects and methodology to : • Solution of system of equations

• Finding roots (functions of one variables) • Interpolation • Numerical differentiation

• Statistical objects and methodologies

Page 8: msc app math

Reference Books:

1. Numerical Recips in c++, William H. Press.. Saul A. Teukolsky. Cambridge University Press

2. C++ and Object oriented computing for Scientists & Engineers, DaoqiiYang, Spinger-Verlag

3. Getting started with MATLAB 7, Rudra Pratap ,Oxford Press (Indian edition),2006.

4. Mastering Matlab, A Comprehensive tutorial and reference, .Duane Hanselman & Bruce Littlefied

5. Matlab Guide Desmond J. Higham & Nicolas J. Higham :, SIAM, 2000. 6. Mastering Matlab-6: A Comprehensive Tutorial and Reference, Duane Hanselman &

Bruce Littlefield , Prentice Hall, 2001. 7. Matlab programming for Engineers 4/e, Stephen Chapman,Cengage

Learning, 2008

AMT 2110 Applied Analysis I Complex Analysis

• Functions of complex variable, Continuity and Differentiability of function of complex variable, necessary and sufficient conditions for differentiability of f(z), Holomorphic and Homomorphic functions, Elementary properties of holomorphic functions, Harmonic functions and its applications to potential theory.

• Complex Integrals: contour and contour integrals, different theorems due to Cauchy, Consequences of Cauchy’s theorems, Morera’s theorem. Liouville’s Theorem, Maximum modulus theorem, Fundamental theorem of algebra.

• Power series representations of f(z), Calculus of residues, Residue theorem. Applications of residue theory.

• Mapping and transformations: Linear transformation,I nversion and Linear fractional transformation, Conformal mapping and its applications, Mapping by elementary functions and some special functions.

Laplace Transform: • Reorientation of Laplace Transform and Inverse Laplace transforms, Existance

theorem of Laplace Transform, Laplace Transform of Heaviside function and its applications, step functions, Unit impulse function, Laplace transform ofDirac’s Delta function and Periodic function, Applications of Laplace transform to ODE (involving heaviside function and dirac delta function), PDE and Integral equations, Inversion integral.

Page 9: msc app math

Reference Books:

1. R. V. Churchill and James Ward Brwon: Complex Variables and Applications, McGraw-Hill,Inc(VI edition)

2. John H. Mathews and Russel Howell: Compex Analysis for Mathematics and Engineering, Narosa Publishing house.

3. Murray R. Spiegel: Theory & problems of Compex Analysis, McGraw-Hill Co. (Metric Editions)

4. Serge Lang: Complex Analysis, (Third Edition), Springer 5. R. V. Churchill: Operational Mathematics.

Programming Practical By using Object Oriented programming / Matlab)

• Practicals on Matlab programs Implementation of Numerical and Mathematical Algorithms computation

• To find out square root of the number using an iterative algorithm • To calculate series expansion of function(sin x, cos x, ex, etc.)

• Gauss- Seidel method, Gauss-Elimination method • Bisection Method, Secant, Regula falsi and Newton-Raphson method

• Trapezoidal Rule, Simpson’s Rule and Wedle's rule • Polynomial and matrix operations

• Finding mean, median , mode and frequency distribution

SECOND SEMESTER OF M.Sc I

AMT 2201 Applied Statistics

• Reorientation of probability, discrete and continuous random variable, cumulative distribution function, Binomial, Poisson and Normal distributions, Expectations, moments and moment generating functions, Law of large number, Chebyshev's inequality, central limit theorem.

• Curve fitting, regression and multiple regression using least square techniques, correlation, chi-square test of goodness of fit, contingency tables, confidence interval for mean , variance. One population case, two population case, testing of hypotheses, small samples and large samples, sampling techniques, Simple random sampling with and without replacement, stratified sampling.

• Control charts for variables and attributes, acceptance sampling by attributes, simple, double and sequential sampling plans, Design of experiments.

Page 10: msc app math

• Stochastic processes: Markov chains with finite and countable state space, classification of states, limiting behavior of n-step transition probabilities, continuous Markov process. Hidden Markov chain with applications.

Reference Books:

1. Hogg and Tannis: Probability and Statistical inference, sixth edition, Prentice- Hall, Upper Suddle River, New Jersey, 2000

2. Larsen and Marx: An Introduction to Mathematical Statistics and its applications, Third edition, Prentice - Hall , Upper Saddle River, New Jersey, 2001

3. Mendenhall, Wackerly and Scheffer: Mathematical Statistics with applications, Third edition, PWS-KENT, Boston, 1996.

4. S.P.Gorden and F.S. Gorden: Contemporary Statistics, a computer approach, 1994 5. William Feller: An Introduction to Probability Theory and Its Applications, (Vol.I

& II) John Wiley inc. 6. K. L. Chung: Elementary Probability Theory With Stochastic Processes, Springer-

Verlag New York, Inc

AMT2220 Functional Analysis

• Normed linear spaces, definition and examples, completeness, Banach spaces. • Continuous linear mappings, Hahn-Banch theorem (for field of real numbers only).

• Equivalent norms, Riesz-lemma, compact sets in a normed linear space, Open mapping and closed graph theorems.

• Banach's fixed point theorem and its application to solution of linear equations, differential equations and integral equations.

• Hilbert spaces, orthonormal sets, orthogonal complements • Projection theorem, Riesz representation theorem, Bounded operators.

• Adjoint of an operator, normal, unitary and self adjoint operators, compact self-adjoint operators.

• Application to Sturm-Liouville problem and approximations. Reference Books:

1. B.V. Limaye : Functional Analysis ,Wiley Eastern Ltd. 2. G.F. Simmons : Introduction to Topology and Modern Analysis, McGraw - Hill. 3. E. Kreyszig: Functional Analysis and its application, John Wiley and sons. 4. J.N. Sharma & A Vashistha :Functional Analysis.

Page 11: msc app math

AMT2203 Partial Differential Equations

• Introduction to PDE, Modelling Problems related to PDE. • General II order PDE, Classification of PDE -hyperbolic, elliptic and parabolic PDE ;

Canonical form • Boundary conditions, well-posed problem, The Cauchy-Kowalewski theorem for

existence and uniqueness of solutions to PDE • Hyperbolic PDE

o Scalar first order Partial differential equations, Method of Characteristics, Compatible system of I order PDE, Charpits method, Weak Solutions.

o Quasi-linear first order equations and quasi-Linear systems of partial differential equations, weak solutions, shocks and rerefactions

o Burgers equation o Non-uniqueness and entropy conditions o Wave equation

• Elliptic PDE o Solution of Laplace equation using separable variable technique o Fundamental solution, Mean value theorem. o Strong Maximum Principle, uniqueness and regularity, Energy Methods, o Sobolev spaces and Lax-Milgram lemma.

• Parabolic PDE o Solution of Heat equation using Fourier Transform method o Mean Value Theorem, Maximum Principle, Regularity, Uniqueness. o Semigroup approach

Reference Books:

1. Strauss W. A: Partial differential equations, An Introduction, Wiley, John and sons 1992.

2. Renardy and Rogers: An introduction to PDE’s, Springer-Verlag, 1999. 3. Smoller: Shock Waves and reaction-diffusion equations, second edition, 1994. 4. Kevorkian: Partial Differential equations, Wadsworth and Brooks/ cole 5. F.John: Partial differential equations 6. Evans L.C.: Partial differential equations, AMS, 1998. 7. B. Folland: Lectures on partial differential equations, Tata institute of Fundamental

Research, Bombay, 1983. 8. B.Folland: Introduction to partial differential equations. 9. M.Junk: Analytical and Numerical Methods for Partial differential equations, 10. Lecturer notes, University of Kaiserslautern, 1999 11. D.Gilbarg and N.S. Trudinger: Elliptic Partial differential equations of

second order.

Page 12: msc app math

AMT2204 Applied Analysis II Real Analysis

• Integration Theory : • Measure spaces, Properties of measurable functions and measures, Integration of

positive and complex functions, Convergence theorems and completion of a measure, Lebesgue measure on Rk.

• LP spaces: Convex functions and inequalities, LP-spaces, Jensen, Holder and Minkowski inequalities, Approximation by continuous functions.

Fourier Series and Fourier Transform: • Orientation of Representation theory and convergence of Fourier series , Gibb’s

phenomenon. • Fourier Integral and Fourier transform in L1(R), Properties of the Fourier transform,

Modulation and Translation, Convolution, Riemann-Lebesgue Lemma, Transforms of derivatives, and derivatives of transform, Inversion Theory: Jordan’s theorem, Parseval’s formula, Plancherel’s theorem.

• DFT and FFT:

• Definition and properties of the DFT, Description of FFT algorithm and examples Reference Books:

1. Rudin Walter: Real and Complex analysis, Mc Graw-Hill book company, Third edition

2. H. L. Royden: Real analysis, The Macmillan company, NewYork, 1963. 3. Rechard Goldberg : Fourier Transform 4. R. N. Bracewell: The Fourier transform and its applications 5. G. P. Tolstov: Fourier series, Prentice-Hall, inc.

AMT2205 Mechanics

• Introduction: Kinematic Equations of particle motion. Newton’s laws of motion. Basic vector & tensor results. General principles of mechanics.

• Statics: reductions of force Systems. Equilibrium of a system of particles and of rigid bodies. Generalized coordinates. Eulerian angles. Work, Potential Energy and the Principle of virtual work.

• Kinematics of particles and rigid bodies: moments of inertia, kinetic energy and angular momentum

• Dynamics of particle and a system of particles, moving frames of reference. • Dynamics of a rigid body, Euler’s equation of motion, simple pendulum, spinning top,

rigid body with a fixed point moving under no external forces. • Work and energy methods applied to the motion of particles & rigid bodies.

Page 13: msc app math

• Impulsive motion and mechanical vibrations. • Lagrange and Hamiltonian dynamics: Lagrange's equations for a particle in a plane.

Hamilton’s principle and principles of least action. • Hamilton – Jacobi theory, action – angle variables • Maps & Chaos : Poincare map, logistic map and Poincare- Birkhoff theorem.

Reference Books:

1. John L. Synge, Byron A. Griffith, “Principles of Mechanics”, McGraw-Hill Book Co., 1960.

2. Herbert Goldstein, “Classical Mechanics”, Addison-Wesley Publishing Co.,1980. 3. R. G. Takwale, P. S. Puranik, “Introduction to Classical Mechanics”,Tata McGraw-

Hill Publishing Co., 1979. 4. Marion and Thornton, “Classical Dynamics of Particles and Systems”, Harcourt; 4th

edition (January 17, 1995). 5. Robort C. Hilborn, “Chaos and Nonlinear Dynamics : An Introduction for Scientists

and Engineers”, Oxford University Press, USA (January 1, 1994)

Practicals on Numerical Analysis and Statistical Methods Numerical Analysis: (By Using Object Oriented Programming)

• Interpolation • Integration with Newton cote's, Gauss quadrature • Definition of a class for a matrix with the following members:

Number of rows, number of columns and a two dimensional array of numbers as attributes with methods for transpose of the matrix, determinant of the matrix, for finding largest eigen value (power method) etc.

• Implementing matrix inversion by Jordan & Escalator methods in the matrix class. • Romberg Integration • Least Square method: fitting a straight line, and second degree curve

• Solution of ODE through Euler, modified Euler, Runge-kutta and Milne-Simpson’s method.

Statistical Methods : (By Using Octave / Matlab) • Given a set of data, set up various graphical representation of data, Bar diagram,

Histogram, Pie charts, frequency polygon etc

• Given a set of data, calculate the various features of central tendency, measures of dispersion

• Given a large population, take samples from it, using various sampling technique

• Calculate Correlation Coefficient between two sets of data points, plot regression lines

• Fitting of curves, Multiple regression techniques to linear and nonlinear problems

• Testing of Hypothesis: Practical examples

Page 14: msc app math

• Confidence interval for mean, proportions • Simulation of Poisson, Binomial and Normal distribution

• Examples with small samples and large samples

FIRST SEMESTER OF M.Sc.II

AMT2301 Numerical Methods for Partial Differential Equations Finite Difference Method

• Numerical methods for parabolic PDE Finite difference method: Explicit methods, implicit methods and Crank- Nicolson implicit method, Stability, Convergence and error of these methods,Predictor -Corrector methods

• Numerical methods for hyperbolic PDE Explicit methods, implicit methods, stability, convergence and error of these methods, Method of characteristics, Lax-Wendroff method, method of artificial viscosity, Courant – Friedrichs -Lewy condition.

• Numerical Methods for elliptic PDE : Numerical solutions of Laplace and Poisson equation using forward difference scheme and its error.

Finite Element Method • Introduction, Advantages of FEM over other methods, Basic steps in FEM, Springs in

series analogy, Under standing about weak solution, Relay Ritz Method • Different approaches in FEM formulation, Variational and Galerkin's approach.

Descretization of problem, Descretization of geometry • Element types, Shape functions, Element equations, Assembly procedure, Imposition

of Essential boundary conditions, Properties of assembled matrix, Methodology for solving system of equations.

• Formulation of the FEM for elliptic problems • Variational and Glerkian formulation • Finite element discretizations in 1D

• Variational approach • Galerkin approach

• Finite element discretization in 2D • A FEM for Poisson’s equation, steady state heat equation , General second order pde

• Galerkin approach • Second order pde in different domain with physical parameter's description. • FEM as a tool for solving boundary value problems

Page 15: msc app math

Reference Books: 1. G.D Smith: Numerical solution of Partial Differential Equations: Finite

Differnce Methods, Third edition, Oxford University Press, 1986. 2. K. W. Morton and D. F. Mayers: Numerical solution of Partial Differential

Equations, Cambridge University Press, New York, 1993. 3. A. R. Mitchell and D. F. Griffiths: The Finite Difference Methods in Partial

Differential Equations, Wiley, April, 2001. 4. A. Quarteroni and A. Valli: Numerical Approximation of Partial

Differential Equations, Springer, 1994. 5. S. Brenner and L.R.Scott: The Mathematical theory of Finite element

methods, Springer-Verlag, 1994 6. C.Johnson: Numerical solution of partial differential equations by the

FEM, Cambridge University Press, 1994. 7. Cook, Malkus and Plesha: Concepts and Applications of finite element

analysis, Third edition , John Wiley and sons, 1989. 8. B. Szabo and I. Babuska: Finite element analysis, Wiley and Sons,1991. 9. K.H. Huebner: The Finite element Method for Engineers, John Wile

and Sons, 1975. 10. AN INTRODUCTION TO Finite Element Method, J.N Reddy, MacGrawHill.

AMT2313 Simulation and Mathematical Modeling Simulation:

• Random numbers: Generating uniform random variables: Pseudo – random numbers, congruential generators and their properties, alternative approaches Testing random numbers: empirical and theoretical tests or sequences of uniform random numbers

• General methods: Inversion method, acceptance-rejection, composition methods

• Particular methods for non–uniform random variables, Box–Muller methods to generate normal variates.

• Exponential, Binomial and Poisson variates • Discrete Event simulation modeling: • Introduction to simulation modeling

• Queuing models Simulation of queueing systems Output analysis of short and long term performance

• Verification and validation • Statistical simulations:

• Monte-Carlo simulation

Page 16: msc app math

• Variance reduction technique: Arithmetic variables, conditioning, control variates, importance sampling and common random numbers

• Simulation inference Mathematical Modeling

• Needs and Techniques of mathematical modeling: Idea of mathematical modeling, need for mathematical modeling, steps in mathematical modeling, Characteristics of mathematical modeling ,Interpretation

• Models in mechanical vibration :Spring mass system, pendulum problems

• Models in population dynamics:One species model, logistic model, growth model in time delays ,Predator-Prey models,Volterra-Lotka models

• Models of chemical processes, Electrical network and Diffusion processes • Partial Differential Equations models, Traffic flow models and different pde models

pertaining to human physiology. Computational Modeling

• Modeling dynamical systems: differential equations and their numerical solution, linear and non–linear dynamics, stability, convergence, attractors.

• Physical systems: System types and characteristics behaviour, Continuous-time,discrete – time and discrete -event systems, linear and non linear systems

• Exploration of behaviour through simulation:

• Developing simulations of dynamical systems using Matlab : representation and visualization of simulation experiments, analyzing behavioural characteristics for a range of classes of physical and computational systems eg. Predictor- prey models, evolutionary systems and cellular systems

Reference Books:

1. J.N.Kapur: Mathematical modelling ,Wiley eastern Ltd.,1994. 2. M.M. Gibbons : A concrete approach to Mathematical modeling , John Wiley and

sons, 1995. 3. H. Neunzert and A.H. Siddiqui: Topics in Industrial Mathematics, Kluwer

Academic Publishers, London, 2000 4. P. E. Wellstead : Introduction to Physical system modeling, Academic Press,

1979. 5. Richard Haberman: Mathematical Models, Practice- Hall Inc., NJ, 1979. 6. Jery Banks, John S., Carson II, Barry Nelson and David M.Nicol,:Discrete –

Event system simulation , Prentice hall, 2001 7. J.N.Kapoor, Mathematical modeling in biology & medicine, Eastwest press

Page 17: msc app math

AMT2303 Fluid Dynamics

• Review of vector notation and vector operators in various coordinate systems. Brief outline of Cartesian Tensor Analysis. Properties of second order tensors.

• Fundamental equation of fluid statics and derivation of Hydrostatic equation and Torricelli's Principle.

• Fluid kinematics : Flow description using Lagrangian and Eulerian methods. Stream lines and path lines. Material derivative and fluid acceleration, vorticity.

• Equation of continuity in cartesian and general vector form. Expression in cylindrical and spherical coordinates, stream tube flow. Boundary conditions.

• Euler's equation of motion in general vector form and derivation of Bernouilli's equation. Application to flow through orifices, Pitot's tube and Venturi meter.

• Navier Stokes equations : General theory of stress and rate of strain in fluid flow. Nature of stresses. Transformation of stress components. Nature of strains. Transformation of rates of strain. Derivation of the Navier-stokes equations. Derivation of Euler's equations as a special case of Navier – Stokes equation.

• Potential flow of ideal fluids : Velocity potential and irrotational flow, circulation and Kelvin's theorem, flows with axial symmetry, application to flow past spheres and spheres moving through fluid.

• Three dimensional singularities. Image systems. Stoke's stream function. Singularities in two-dimensional flow.

• Stream function in two dimensions. Complex velocity potential. Flow net. Superposition of simple flows. Rankine's method for construction of stream lines.

• Complex velocity potential. Boundary value problems. Indication of the use of complex analysis and conformal transformations in flow problems.

• Laminar flow of viscous incompressible fluids. Similarity of flows – Reynold's and Froude number. Flow between parallel plates – Couette flow and plane Poiseuille flow. Hagen – Poiseuille flow through pipes.

• Laminar boundary layer : Definition of boundary layer, Boundary layer equations in two-dimensional flow. Blasius solution for the boundary layer along a flat plate.

Reference Books: 1. S. W. Yuan : Foundations of fluid Mechanics, Prentice – Hall International, 1970. 2. M. E. O'Neill and F. Chorlton : Ideal and Incompressible fluid dynamics, John Wiley

& Sons, 1986. 3. Batchelor G. K. : An Introduction to Fluid Dynamics, Cambridge University Press,

1999. 4. Emanuel G : Analytical Fluid Dynamics, CRC Press, Boca Raton, Second edition, FL,

1999. 5. Panton R. L. : Incompressible Flows, Wiley Interscience, 1984. 6. Currie I. G. : Fundamental Mechanics of Fluids, McGrow-Hill, New-york, 1993. 7. Chorin : Mathematical introduction to Fluid Mechanics, Springer Verlag, Fourth

edition. 8. F. Chorlton, Textbook of Fluid Dynamics, Van Nostrand, 1967.

Page 18: msc app math

AMT2304 Optimization I

• Optimization problems in engineering and industries: • Optimization problem formulation

• Classification of optimization problem • Classical optimization techniques :

• Single variable optimization, Multivariable optimization, Constraint optimization, Lagrangain multiplier method, Khun-Tucker conditions

• Single variable optimization techniques:

• Bracketing method - Exchaust search • Region elimination method - Interval halving method, Golden section method • Interpolation method - Quadratic interpolation method

• Gradient base methods - Newton-Raphson method, bisection method • Multivariable optimization techniques(unconstrained):

• Univariate method • Direct Search method - Simplex search method, Powells conjugate direction method • Gradient base methods - steepest descent method, conjugate gradient method.

• Multivariable optimization techniques(Constrained): • Box complex method

• Sequential linear programming • Interior and Exterior Penalty function methods

• Constraint linear optimization problem : • Overview of linear optimization problem • Sensitivity analysis

• Quadratic programming: • Wolf's modified simplex method, Bailes methods

• Integer programming problem: • Gomorys cutting plane method, branch and bound techniques

Reference Books:

1. Rangrajan K. Sundaram: A first Course in Optimization Theory, Cambridge University Press, First edition, 1996.

2. S. S. Rao: Engineering Optimization (Theory and Practice), New Age International Publishers, New Delhi, Third edition, 2001.

3. Edwin K. P. Chong, Stanislaw H. Zak, An Introduction to Optimization, Wiley-India publishers, Second edition, 2001.

4. Mohan C. Joshi, Kannan M. Moudgalya: Optimization (Theory and Practice), Narosa Publishing House, First edition, 2004.

5. Kalyanmoy Deb: Optimization for Engineering Design (Algorithms and Examples), Prentice-Hall of India Private Limited, New Delhi, 1995.

Page 19: msc app math

6. Kantiswarup, P.K.Gupta and Manmohan: Operations Research , Sultan chand and Sons.

7. S.D. Sharma: Operations Research ( Theory, Methods and Applications), Kedar Nath, Ram Nath & Co., Fifteenth edition, 2005.

8. H.A. Taha :Operation research an Introduction, Prentice-Hall of India Private Limited, New Delhi, Sixth edition, 2001.

9. B.E. Gillet : Introduction to Operations Research-Computer Oriented Algorithm, 10. K. V. Mittal, Chandra Mohan: Optimization Methods in Operations Research and

System Analysis, New-Age international Publishers, 2008. 11. J. C. Pant: Introduction to Optimization: Operations Research, Jain Brothers, New

Delhi, 2010. 12. Wayne L. Wilson: Operations Research: Applications and Algorithms, Cengage

Learning India Pvt. Ltd., 2011.

AMT2305 Wavelets and Image Processing: Wavelets

• Fourier theory, sampling, signal processing , time-frequency representations

• Short time Fourier transform and Continuous wavelet transform, admissibility condition, some well-known wavelets

• Multiresolution Analysis Process

• Analysis of Haar expansion of discrete -time signals, • Wavelet transform and filter banks, Multichannel Filter Banks, Decomposition and

Reconstruction scheme.

• Orthonormal Wavelets, Biorthogonal Wavelets • Construction by lifting scheme: "next-generation wavlets" • Mallat’s MRA and Wavlet-Packets

• Multidimentional Wavelets. Image Processing

• Introduction to image processing: Fundamental steps in image processing, Digital image modelling, Image sampling and quantization-spatial and grey level resolution, zoomimg and shrinking digital images, relationship between pixels, Labelling connected components.

• Image enhancement in special domains: Basic grey level transformations, Image negatives, Histogram processing, Enhancement using arithmetic logic operations, Image averaging, Basics of special filtering, smoothing and sharpening filters, combining spatial enhancement methods.

• Image enhancement in frequency domain: 1-D and 2-D Fourier transforms and its inverse, 1-D and 2-D DFT and its inverse, Filtering in frequency domain, smoothing and sharpening frequency domain filters.

• Colour image image processing: Colour fundamentals, colour image models, pseudo colour image processing, colour transformations, colour complements, colour slicing.

Page 20: msc app math

• Image segmentation: Detection of discontinuities, Edge linking and boundary detection, global processing via Hough transform. Segmentation by Morphological water shades.

Reference Books:

1. C.K. Chui: An Introduction to wavelets, Academic Press. 2. S. Malat :A Wavelet Tour of Signal Processing,Academic Press,1998. 3. G.Strang and T Nguyen: Wavelets and Filter Banks, Wellesley-Cambridge

press,1996. 4. Adhemar Bultheal: Learning to swim in a sea of wavelets. 5. Ingrid Daubechies: Ten Lectures on Wavelets, Soc. For Industrial and Applied

Mathematics, Philadelphia, 1992 6. Rafael C. Gonzalez and Richard E. Woods: Digital Image Processing ,

Pearson Education (Asia) 2002.

Modelling Seminar An industrial problem will be given to a batch of five students and they will have to represent stage by stage formulation namely problem presentation, simple model, complicated model, numerical computations and results with discussion. Every students has to give one presentation. They have to submit final report at the end of semester. Twenty five marks will be allotted for presentation and Twenty five marks will be allotted for viva and report in the semester examination.

Practical on Numerical Methods for PDE, Wavelets & Image Processing and Optimization (Using Matlab Or Oops)

• Hyperbolic partial differential equation : Solution of wave equation using Finite difference method (Explicit method, Implicit methods)

• Solution of scalar conservation laws with upwind scheme, Mc-cormack scheme, Godunov scheme, Beam - Warming scheme, Lax – Wendroff scheme.

• Elliptic partial differential equation : Solution of Laplace and Poisson's equation with FEM

• Parabolic partial differential equation : Solution of Heat equation (Explicit, implicit and Crank- Nicolson scheme)

• Matlab programs for optimization problems

• FFT algorithm with Matlab • Multiresolution analysis and Wavelet packets and its applications in Signal

processing.

Page 21: msc app math

SECOND SEMESTER M.Sc. II AMT2416 Optimization – II

• General Constraint optimization problem: • Direct search method

• Random search method • Monte Carlo method

• Sequential Quadratic Programming techniques • Feasible direction methods-Zoutendijk’s method, Rosen’s Gradient projection method • Augmented Lagrangian method,

• Non traditional optimization algorithms: • Genetic algorithms

• Simulated anneling methods • Stochastic Optimization:

• Stochastic LPP • Stochastic NLPP • Multi-objective Optimization:

• Utility function method • Inverted Utility function method

• Global criteria method • Multistage optimization problems: • Dynamic programming problems techniques

• Project scheduling problems : • Bar charts, mile stone charts, fulkersons rule, Critical Path Method (CPM), project

evaluation and review techniques (PERT) Practical:

• MATLAB programs for fuzzy systems

• Real World optimization problem assignment Reference Books:

1. S. S. Rao: Engineering Optimization(Theory and Practice), New Age International Publishers, New Delhi, Third edition, 2001.

2. Kalyanmoy Deb: Optimization for Engineering Design (Algorithms and Examples), Prentice-Hall of India Private Limited, New Delhi, 1995.

3. S. Rajsekaran, G. A. Vijayalakshmi Pai: Neural Networks, Fuzzy logic, and Genetic Algorithms, Prentice-Hall of India Private Limited, New Delhi, 2003.

4. Kantiswarup, P.K.Gupta and Manmohan: Operations Research ,Sultan chand and Sons.

5. S.D. Sharma: Operations Research ( Theory, Methods and Applications), Kedar Nath, Ram Nath & Co., Fifteenth edition, 2005.

Page 22: msc app math

6. B.E. Gillet : Introduction to Operation Research, Computer Oriented algorithm. 7. H.A. Taha :Operation research an Introduction, Prentice-Hall of India Private

Limited, New Delhi, Sixth edition, 2001. 8. Srinath L.S.:PERT and CPM : Principles and Applications ,2nd edition, 1975.

AMT2417 Computational Fluid Dynamics

• Introduction to CFD, Applications; • Governing equations and assumptions, Equation types, Model equations, potential

flow, Heat conduction, Wave equation, Burgers equation, Euler equations. • Finite Differences, Algorithms, Errors and Accuracy, Consistency, Stability and

Convergence, Finite Volumes, Explicit algorithms, Implicit algorithms, Numerical boundary conditions, Method of lines, Shock Jump Relations, Shock capturing.

• One dimensional Euler equations, Lax – Wendroff Scheme, Mc-Cormack Scheme,

Implicit - method, Pseudo One Dimensional Euler Equations, boundary conditions, Flux – Splitting, Artificial viscosity, Flux limiters.

• Multidimensional Euler equations, Lax- Wendroff and Mc-Cormack schemes, stability of multidimensional schemes, Operator splitting Implicit algorithms, Beam - Warming algorithm.

Practical

• Numerical methods for discretizing fluid flow equations:

• Finite differences, finite element and finite volume method. Reference Books:

1. R. J. Leveque: Numerical methods for conservation Laws, Birkhauser Verlag, Basel, 1992.

2. J. D. Anderson: Computation Fluid dynamics, Mc-Graw – Hill, New York, 1995. 3. H. K. Versteeg and W. Malasekera: An Introduction to Computational Fluid

Dynamics: The finite volume method, Longman Scinetific and technical Essex, England, 1995.

4. J. Chorin and J. E. Marsden: A Mathematical Introduction to Fluid Mechanics 5. P. D. Lax: hyperbolic systems of conservation laws and mathematical theory of shock

waves, 1973.

Page 23: msc app math

AMT2418 Neural Networks And Fuzzy Systems Neural Networks

• Definition and brief history of Artificial neural networks. • Structure and function of a Single Neuron, Biological Neuron and artificial Neuron

Models • Architectures and Neural Networks:

• Fully connected • Layered networks • Feed forward

• A cyclic and modular networks • Supervized and Unsupervized networks

• Learning Algorithms: • Correlation learning • Competitive learning

• Habbian rule • Perceptron rule

• Delta rule • Back propagation algorithm.

• Hopfield Networks: • Continuous and Discrete • Energy function and its properties

• Capacity of Hopfield Networks. • Radial Basis Function Networks, Cover’s theorem.

• Application of Neural Networks • Classification • Clustering

• Pattern association • Function Approximation

• Forecasting • Control application

• Optimization

Fuzzy Systems: • Uncertainties and their importance in science and technology:

• Fuzzy sets, standard operation on fuzzy sets, fuzzy operations and their properties, fuzzy numbers and their airthmetic.

• Construction of fuzzy sets and operations on fuzzy sets • Fuzzy logic :Multivalued Logics, Fuzzy Propositions, Fuzzy quantifiers, Linguistic

Hedges and inference

Page 24: msc app math

• Fuzzy systems:Fuzzy controls,Fuzzy systems and neural network,fuzzy neural network.

Practical: • Given a one/two/three dimensional functions set up multilayer neural networks to

approximate the function using various training algorithms like Back-Propagation, Counter Back-Propagation.

• Set up a Hopfield-net to store a finite number of patterns. • Run a Neural Network algorithm to recognize character, Images and Sounds.

• Time series prediction applications to Artificial Neural Networks. • Simulation of Control Systems using Artificial Neural Networks.

• MATLAB programs for fuzzy systems. Reference Books:

1. 1.Heykin S: Neural Networks : A Comprehensive Foundation, McMillan, N.Y, 1994.

2. Kohonen. T: Self-Organization and Associative Memory. 3. Kosko B: Neural Networks and Fuzzy Systems : Prentice Hall, Y.J, 1992. 4. K Mehrotra, C.K. Mohan, S. Ranka : Artificial Neural Networks, Penram

International Publishing, 1977. 5. Philip D. Wasserman: Neural Computing Theory and Practice : Van

Nostrand Reinhold, New York, 1989 6. Zurada J. M: Introduction to Artificial Neural Systems, Jaico Publishing

house, Second edition,1996. 7. George J. Klir and Bo Yuan: Fuzzy Sets and Fuzzy Logic ( Theory and

Applications), Prentice-Hall of India Private Limited, New Delhi, 1995.

Modeling Seminar An industrial problem will be given to a batch of five students and they will have to represent stage by stage formulation namely problem presentation, simple model, advance model, numerical computations and results with discussion. Every students has to give one presentation. They have to submit final report at the end of semester. Twenty five marks will be allotted for presentation and Twenty five marks will be allotted for viva and report in the semester examination.

Dissertation Based on Industrial Problems: An industrial problem will be given to each student and each student has to submit a dissertation at the end of fourth semester. The project work will be carried out in an industry or organization keeping one of the teachers from the department as a joint guide.

Page 25: msc app math

Seminar A topic will be given to each student and they will have to present a seminar. They have to submit final report at the end of semester. Twenty five marks will be allotted for presentation and Twenty five marks will be allotted for viva and report in the semester examination.

AMT2401 Discrete Mathematics Logic

• Propositional and predicate logic, propositions, predicates and quantifiers, quantifier and logical operators, rules of inference, methods of proof and logical verification of computer programs.

Theory of algorithms • Problems and instances algorithms, characteristics of algorithms, concepts of test

data, efficiency of algorithms, theoretical, empirical and hybrid approaches to measure efficiency, time complexity, space complexity, asymptotic notations, solving recurrences using characteristics equations, examples of simple algorithm and their analysis

• Graph theoretic algorithms and computer programs

• Recape the concepts and definitions of graph and trees as data structure , some basic algorithms, representation of graphs, breath first search, topological search, heap sort algorithm connectedness and assumptions, Lattice theory, Boolean algebra

Theory of Computation • Models in computer science, finite state automata, their use and properties,

Deterministic finite automata, non deterministic finite automata, regular languages and their unions, finite state transducers, Push down automata, context free languages, turning machine and computing by turing machines.

Reference Books:

1. Harry R. Lewis and Christosh H. Papadimitriou. Elements of the theory of computation, Prentice Hall of India. 1996

2. V.Aho, J.E.Hoperoft and J.D. Vilman, The design and analysis of Computer algorithms. 1974

3. Thomas H. Cormen Leiserson and Rivest, Introduction to algorithm, Prentice Hall of India, 1998

4. Dino Mandrioli, Carlo Ghezzi : Theoretical foundations of computer science, John-Wiley and sons, 1987

5. Kenneth A. Ross, Charles R. B. Wright: Discrete Mathematics, Pearson 2012 5th Edition.

6. Seymour Lipschutz, Marc Lipson: Discrete Mathematics (Schaum's Outlines), Tata McGraw Hill

Page 26: msc app math

AMT2402 Differential Geometry and Integral Equations: Differential Geometry

• Concept of a curve, regular cuve, arc length as a parameter, order of contact, orthogonal triad t , n , b. Curvature,Torsion and, Frenet-Serret formulae, Intrinsic equations, The fundamental existance and Uniqueness theorem, Curves of constant slope or cylindrical Helices,circle of curvature ,locus of centre of curvature,sphere of curvature. Osculating curves & Surfaces.

• Involutes and Evolutes, Bertrand curves. Surfaces, Envelopes, Edge of regression, developable surface, general equation to developable surface.

Linear Integral equations

• Definition,relation between diferential & integral equations, Green's function.

• Fredholm and Volterra equations,Method of successive approximations, equations with separable kernels.

• Hilbert-schmidt theory,Fredholm theory. • Singular Integral equations.

Reference Books:

1. T.J. Willmore: An Introduction to Differential Geometry, Oxford University Press(India).

2. Martin Lipschultz : Differential Geometry (Schaum's Outlines), Tata McGraw- Hill publishing Co. ltd (India)

3. D.J, Struik :Classical Differential Geometry. 4. Francis B. Hildebrand: Methods of Applied Mathematics, Prentice-Hall,

Inc., Second Edition, 1965. 5. R.V. Churchill :Operational Mathematics 6. B.P. Parashar: Differential and Integral equations, CBS Publishers, Second

edition, 1992. 7. M. Krasnov, A. Kiselev, G. Makarenko: Problems and Exercises in Integral

Equations, Mir Publishers, Moscow, 1971.

AMT2403 Advanced Analysis

• Distributions • Introduction to weak weak * topologies, locally convex topological spaces. • Test Functions and Distributions

• Some operations with Distributions • Supports of Distributions

• Convolution of Functions • Convolution of Distributions

Page 27: msc app math

• Fundamental Solutions • The Fourier Transform, The Schwartz Space and the Fourier Inversion Fomula

• Tempered Distributions • Sobolev Spaces

• Definition and basic Properties • Approximation by smooth Functions • Extension Theorems

• Imbedding Theorems • Compactness Theorems

• Dual Spaces,Fractional Order spaces and Trace Spaces • Trace Theory

• Weak solutions of Elliptic Boundary value problems • Some Abstract Variational Problems • Examples of Elliptic Boundary Value Problems

• Regularity of Weak Solutions Reference Books:

1. S. Kesavan: Topics in Functional analysis and Applications, Wiley Eastern Ltd.1989. 2. Adams R.A., Sobolev Spaces ,Academic Press, 1975. 3. J. T. Oden and J. N. Reddy: An introduction to the Mathematical Theory of 4. Finite Elements, John Wiley ,NY, 1976.

Page 28: msc app math

ELECTIVE I

AMT2310 Theoretical Computer Science:

• Sets, relations, functions, Alphabets ,strings and languages, recursive functions. • Models in computer science, finite state automata, their use and properties, pushdown

automata, their use and properties. • Turing machines, their use and properties.

• Grammers, non-deterministic automata and Turing machines. • Solvability and unsolvability, Ability of a Mechanism to solve a problem,

formalization of the notion of a problem.

• Turing machines, programming languages, Algorithms and church's thesis. • Petri nets : Introduction, Their purpose, A graph modeling of the static Properties of a

system, Dynamic nets. Modeling concurrent processors, Petrinet theory, Petrinet Analysis. Various examples.

• Definition of complexity, Asymptotic behaviour, other sources of complexity. • The impact of formal techniques on program reliability, Basic ideas of formal

specification and formal semantics, handling quantified assertions. Reference Books:

1. Dino Mandrioli & Carlo Ghezzi : Theoretical Foundations of Computer Science.

2. H.R. Lewis & C.H. Papadimitriou : Element of Theory of Computations 3. Mervin Minsky:"computation :Finite and Infinite Machines". 4. V.J. Rayward Smith : A first course in computability. 5. Martin D. Davis and E.J. Weynker : Computability, Complexity and Langurges. 6. George J Tourlakis : Computability

AMT2308 Applied Fourier Analysis

• Trigonometric series and Fourier series, Wave forms trigonometric polynomials, Sine and Cosine series with monotone coefficients, Evaluation of Fourier Coefficients when function is given in the form of a discrete data.

• Lp - spaces, Orthonormal systems, Complete orthonormal system, Riesz-Fischer Theorem, Bessel’s inequality, Parseval’s inequality.

• Functions of bounded variation, Order of Fourier coefficients, Basic properties of Fourier coefficients, Riemann-Lebesgue lemma, Uniqueness of Fourier coefficients, Completeness of trigonometric systems.

• Partial sums of Fourier series and their rate of growth, Riemann’s Principle of Localization, Convergence tests for Fourier series, Dini’s and Jordan’s test.

• Cesaro summability of Fourier series, Fejer’s Theorem, Fejer-Lebesgue theorems, Estimates of partial sums.

Page 29: msc app math

• Uniform convergence, Absolute convergence, Lusin-Denjoy Theorem. • Walsh function series: Definition of Walsh series, Relation between Fourier and

Walsh series, Function ordering, Walsh function derivation, Wave form synthesis using Walsh & Fourier series.

• Walsh transformation: Definition, Comparison with Discrete Fourier Transform, Conversion between Discrete Walsh and Fourier transformation, The Fast Walsh Transform, The generalized transform.

• The Haar Function: Definition, Relation between Walsh and Haar functions, The Fast Haar Transforms, Two dimensional Haar transformation, The Haar Power Spectrum.

• Applications in Communications and Signal Processing. Reference Books:

1. Charles Sparks Rees, S. M. Shah, C. V. Stanojevic: Theory and applications of Fourier Analysis, Marcel Dekkar, Inc. New York.

2. Rajendra Bhatia, Fourier Series, Hindustan Book Agency, Delhi. 3. N. K. Bary, A Treatise on Trigonometric Series, Pergamon Press. 4. A. Zygmund: Trigonometric Series, Cambridge Press. 5. Hwei P. Hsu, Haroourt Brace Jovanovich: Applied Fourier Analysis New York. 6. K. G. Beauchhamp,Walsh Functions and their applications Academic 7. Press. E. Oran Brigham,The Fast Fourier Transform Prentice Hall of India.

AMT2309 Mathematical Control Theory – I 1. Introduction

• State-Space and frequency domain representation of control systems. • Discrete -Time and Continuous-Time Systems. • Linear and nonlinear systems with examples.

2. Reachability and Controllability

• Basic Reachability Notions

• Time-Invariant Systems • Controllable Pairs of Matrices

• Controllability Under Sampling • More on Linear Controllability • Bounded Controls

• First-Order Local Controllability • Controllability of Recurrent Nets

• Piecewise Constant Controls 3. Feedback and Stabilization

• Constant Linear Feedback • Feedback Equivalence

Page 30: msc app math

• Feedback Linearization • Disturbance Rejection and Invariance

• Stability and Other Asymptotic Notions • Unstable and Stable Modes

• Lyapunov and Control-Lyapunov Functions • Linearization Principle for Stability • Introduction to Nonlinear Stabilization.

Reference Books:

1. Sontag E D : Mathematical control theory – Deterministic Finite Dimensional Systems, Springer, NY 2002.

2. Russell D L : Mathematics of Finite Dimensional Control Systems, Marcel Dekker, NY, 1979.

3. Brockett R W: Linear systems, John Wiley, 1985. 4. Joshi M C: Differential Equations, A modern Perspective, Narosa Publ. 2004

ELECTIVE II AMT2405 Theory of Algorithms:

• Basics • What is an Algorithm?, Problems and Instances, Efficiency of algorithms

• ( Empirical, Theoretical and Hybrid) • Average and Worst case efficiency, Elementary operations, Need for efficient

algorithms, When an algorithm is specified?

• Illustrations of certain well known algorithms. • Asymptotic Notations

• A notation for “the order of ”, θ and Ω notations, Conditional asymptotic notations on asymptotic notations.

• Analysis of Algorithms

• Analyzing control structures, Using a barometer, Average- case and worst case analysis, Amortized analysis., Suitable illustrations.

• Designing of Efficient Algorithm

• Recursive algorithms • Illustrations, Solving recurrences- Homogeneous & Inhomogeneous recurrences,

change of variables, Range transformations. • Greedy Algorithms • General characteristics, Illustrations like “Giving change” problem, Finding shortest

path, Scheduling – Minimizing time in the system, Scheduling with deadlines. • Divide and Conquer: • Multiplying large integers, Binary search, Merge-sort, divide sort, Matrix

multiplication. • Dynamic Programming

Page 31: msc app math

• Shortest paths, Chained Matrix multiplication • Strassen’s matrix multiplication algorithms, Inversion of matrices, LUP

decomposition of matrices. • Probabilistic Algorithms: • Expected versus average time, Numerical probabilistic algorithms, Buffon’s needle,

Numerical Integration. Reference Books:

1. Gilles Brassard and Paul Bratley: Fundamentals of Algorithmics Prentice-Hall International Iue,1998.

2. Thomas H Cormen, Charles E- Leiserson, Ronald L. Rivert Introduction to Algorithms, PHI, India Pvt. Ltd., 1998.

3. A.V. Aho. J. E. Hopcroft, J.D. Uilman: The Design and Analysis of Computer Algorithmss.

4. E Horoutiz and Sartaj Sahani : Fundamentals of Computer Algorithms.

AMT2404 Wavelet Analysis

• From Fourier Analysis to Wavelet analysis • Time Frequency Analysis

• Continuous Wavelet Transform • Discretizing the Wavelet Transform

• Frames • Frames of Wavelets

• A necessary condition (Admissibility of the mother wavelet) • The dual frame • Examples of Tight frames, The Mexican hat function, a modulated Gaussian

• Frames for the Windowed Fourier transform • Time-Frequency Density

• Orthonormal Wavelet bases • Multi Resolution Analysis & Construction of Wavelets from MRA • Riesz bases of scaling function

• The Battle-Lemaire wavelets. Construction of compactly supported wavelets • Regularity of Orthonormal wavelet bases

• Orthonormal Bases of Compactly Supported Wavelets with Examples • Regularity of Compactly Supported Wavelets

Reference Books: 1. Ingrid Daubechies :Ten Lectures on Wavelets, OBMS-NSF

SIAM, Philadelphia,1992. 2. Charles K. Chui An introduction to wavelets, Academic Press ,1992 3. G. Kaiser, Friendly Guide to wavelets , Birkhauser Boston 1994. 4. E. Hernandez and Guido Weiss: A first course on wavelets, CRC Press, 1996.

Page 32: msc app math

AMT 2406 Mathematical Control Theory – II 1. Observability

• Basic Observability Notions • Time-Invariant Systems

• Continuous-Time Linear Systems • Linearization Principle for Observability

• Realization Theory for Linear Systems • Recursion and Partial Realization

• Rationality and Realizability • Abstract Realization Theory • Observers and Dynamic Feedback

• Observers and Detectability • Dynamic Feedback

• External Stability for Linear Systems • Frequency-Domain Considerations

2. Optimal Control Problems

• Dynamic Programming • Linear Systems with Quadratic Cost

• Tracking and Kalman Filtering • Infinite-Time (Steady-State) Problem

• Nonlinear Stabilizing Optimal Controls • Optimality: Multipliers • Unconstrained Control

• Constrained Controls: Minimum Principle • Optimality: Minimum-Time for Linear Systems

• Existence Results • Maximum Principle for Time-Optimality

• Applications of the Maximum Principle

Reference Books: 1. Sontag E D : Mathematical control theory – Deterministic Finite Dimensional

Systems, Springer, NY 2002. 2. Russell D L : Mathematics of Finite Dimensional Control Systems, Marcel Dekker,

NY, 1979. 3. Anderson BDO and Moore J B: Optimal Control –Linear Quadratic Methods,Prince

Hall, New Delhi 1991. 4. Fleming W H and Rishel R W: Deterministic and stochastic Optimal Control,

Springer verlag, N 1975. 5. Kwakernak and Sivan, Linear Optimal Control Systems, Wiley Inter, NY, 1972.