Unit 1
09 (a) Roots finding methods:
Roots of Transcendental and Polynomial Equations: Bisection method, Iteration methods based on first degree equation, Rate of convergence, system of nonlinear equations.
Course Name | Numerical Methods and Optimization |
Course Code | 19MAT343 |
Program | B. Tech. in Computer and Communication Engineering |
Year Taught | 2019 |
09 (a) Roots finding methods:
Roots of Transcendental and Polynomial Equations: Bisection method, Iteration methods based on first degree equation, Rate of convergence, system of nonlinear equations.
09 (b) Interpolations:
Interpolation and Approximation: Lagrange, Newton’s Divided Difference, Newton’s Forward and Backward interpolations.
07 (b) Multivariable optimization (2 Credits)
Optimality criteria – unidirectional search – direct search methods – gradient based methods. Lagrangian and Kuhn- Tucker conditions.
Textbook(s)
Reference(s)
Evaluation Pattern
Assessment | Internal | External |
Periodical 1 (P1) | 15 | – |
Periodical 2 (P2) | 15 | – |
*Continuous Assessment (CA) | 20 | – |
End Semester | – | 50 |
*CA – Can be Quizzes, Assignment, Projects, and Reports. |
DISCLAIMER: The appearance of external links on this web site does not constitute endorsement by the School of Biotechnology/Amrita Vishwa Vidyapeetham or the information, products or services contained therein. For other than authorized activities, the Amrita Vishwa Vidyapeetham does not exercise any editorial control over the information you may find at these locations. These links are provided consistent with the stated purpose of this web site.