Guest User

Untitled

a guest
Sep 28th, 2020
112
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 5.77 KB | None | 0 0
  1. Calculus: Functions of two or more variables, continuity, directional derivatives, partial
  2. derivatives, total derivative, maxima and minima, saddle point, method of Lagrange’s
  3. multipliers; Double and Triple integrals and their applications to area, volume and surface area;
  4. Vector Calculus: gradient, divergence and curl, Line integrals and Surface integrals, Green’s
  5. theorem, Stokes’ theorem, and Gauss divergence theorem.
  6.  
  7. Linear Algebra: Finite dimensional vector spaces over real or complex fields; Linear
  8. transformations and their matrix representations, rank and nullity; systems of linear equations,
  9. characteristic polynomial, eigenvalues and eigenvectors, diagonalization, minimal polynomial,
  10. Cayley-Hamilton Theorem, Finite dimensional inner product spaces, Gram-Schmidt
  11. orthonormalization process, symmetric, skew-symmetric, Hermitian, skew-Hermitian, normal,
  12. orthogonal and unitary matrices; diagonalization by a unitary matrix, Jordan canonical form;
  13. bilinear and quadratic forms.
  14.  
  15. Real Analysis: Metric spaces, connectedness, compactness, completeness; Sequences and
  16. series of functions, uniform convergence, Ascoli-Arzela theorem; Weierstrass approximation
  17. theorem; contraction mapping principle, Power series; Differentiation of functions of several
  18. variables, Inverse and Implicit function theorems; Lebesgue measure on the real line,
  19. measurable functions; Lebesgue integral, Fatou’s lemma, monotone convergence theorem,
  20. dominated convergence theorem.
  21.  
  22. Complex Analysis: Functions of a complex variable: continuity, differentiability, analytic
  23. functions, harmonic functions; Complex integration: Cauchy’s integral theorem and formula;
  24. Liouville’s theorem, maximum modulus principle, Morera’s theorem; zeros and singularities;
  25. Power series, radius of convergence, Taylor’s series and Laurent’s series; Residue theorem
  26. and applications for evaluating real integrals; Rouche’s theorem, Argument principle, Schwarz
  27. lemma; Conformal mappings, Mobius transformations.
  28.  
  29. Ordinary Differential equations: First order ordinary differential equations, existence and
  30. uniqueness theorems for initial value problems, linear ordinary differential equations of higher
  31. order with constant coefficients; Second order linear ordinary differential equations with variable
  32. coefficients; Cauchy-Euler equation, method of Laplace transforms for solving ordinary
  33. differential equations, series solutions (power series, Frobenius method); Legendre and Bessel
  34. functions and their orthogonal properties; Systems of linear first order ordinary differential
  35. equations, Sturm's oscillation and separation theorems, Sturm-Liouville eigenvalue problems,
  36. Planar autonomous systems of ordinary differential equations: Stability of stationary points for
  37. linear systems with constant coefficients, Linearized stability, Lyapunov functions.
  38.  
  39. Algebra: Groups, subgroups, normal subgroups, quotient groups, homomorphisms,
  40. automorphisms; cyclic groups, permutation groups, Group action, Sylow’s theorems and their
  41. applications; Rings, ideals, prime and maximal ideals, quotient rings, unique factorization
  42. domains, Principle ideal domains, Euclidean domains, polynomial rings, Eisenstein’s
  43. irreducibility criterion; Fields, finite fields, field extensions, algebraic extensions, algebraically
  44. closed fields
  45.  
  46. Functional Analysis: Normed linear spaces, Banach spaces, Hahn-Banach theorem, open
  47. mapping and closed graph theorems, principle of uniform boundedness; Inner-product spaces,
  48. Hilbert spaces, orthonormal bases, projection theorem, Riesz representation theorem, spectral
  49. theorem for compact self-adjoint operators.
  50.  
  51. Numerical Analysis: Systems of linear equations: Direct methods (Gaussian elimination, LU
  52. decomposition, Cholesky factorization), Iterative methods (Gauss-Seidel and Jacobi) and their
  53. convergence for diagonally dominant coefficient matrices; Numerical solutions of nonlinear
  54. equations: bisection method, secant method, Newton-Raphson method, fixed point iteration;
  55. Interpolation: Lagrange and Newton forms of interpolating polynomial, Error in polynomial
  56. interpolation of a function; Numerical differentiation and error, Numerical integration:
  57. Trapezoidal and Simpson rules, Newton-Cotes integration formulas, composite rules,
  58. mathematical errors involved in numerical integration formulae; Numerical solution of initial
  59. value problems for ordinary differential equations: Methods of Euler, Runge-Kutta method of
  60. order 2.
  61.  
  62. Partial Differential Equations: Method of characteristics for first order linear and quasilinear
  63. partial differential equations; Second order partial differential equations in two independent
  64. variables: classification and canonical forms, method of separation of variables for Laplace
  65. equation in Cartesian and polar coordinates, heat and wave equations in one space variable;
  66. Wave equation: Cauchy problem and d'Alembert formula, domains of dependence and
  67. influence, non-homogeneous wave equation; Heat equation: Cauchy problem; Laplace and
  68. Fourier transform methods.
  69.  
  70. Topology: Basic concepts of topology, bases, subbases, subspace topology, order topology,
  71. product topology, quotient topology, metric topology, connectedness, compactness, countability
  72. and separation axioms, Urysohn’s Lemma.
  73.  
  74. Linear Programming: Linear programming models, convex sets, extreme points; Basic feasible
  75. solution, graphical method, simplex method, two phase methods, revised simplex method ;
  76. Infeasible and unbounded linear programming models, alternate optima; Duality theory, weak
  77. duality and strong duality; Balanced and unbalanced transportation problems, Initial basic
  78. feasible solution of balanced transportation problems (least cost method, north-west corner rule,
  79. Vogel’s approximation method); Optimal solution, modified distribution method; Solving
  80. assignment problems, Hungarian method.
Add Comment
Please, Sign In to add comment