Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

NMO-Lecture 1-Root of Equations

Download as pdf or txt
Download as pdf or txt
You are on page 1of 20

Program: BE(Mechanical)

Class: TE
Course: Numerical Methods and
Optimization
Unit: Roots of Equation
Lecture 01: Types of Root
Topics 02

Introduction Syllabus Types of


What is root of
Discussion problem for
equation

Types of
Analytical Numerical Closing
method Method

SCHOOL OF ENGINEERING AND TECHNOLOGY


Title of the page 03

1. Prakash Madhukar Sutar


2. Years of Experience -09
3. M.E (CAD Cam & Automation)

SCHOOL OF ENGINEERING AND TECHNOLOGY www.sandipuniversity.edu.in


Course: Numerical Method and Optimization
Lecture 1: Syllabus and Structure

Presented by:
Prof. Prakash Madhukar Sutar
M.E. (CAD CAM & Manufacturing)
Course Objectives:

• Recognize the difference between analytical and Numerical Methods.


• Effectively use Numerical Techniques for solving complex Mechanical engineering Problems.
• Prepare base for understanding engineering analysis software.
• Develop logical sequencing for solution procedure and skills in soft computing.
• Optimize the solution for different real life problems with available constraints.
• Build the foundation for engineering research.
Course: CAD CAM & Automation
Lecture 1: Syllabus and Structure

Presented by:
Prof. Prakash Madhukar Sutar
M.E. (CAD CAM & Manufacturing)
Course Outcomes:

• Use appropriate Numerical Methods to solve complex mechanical engineering problems.


• Formulate algorithms and programming.
• Use Mathematical Solver.
• Generate Solutions for real life problem using optimization techniques.
• Analyze the research problem
Syllabus Structure
Contents
Unit 1: Errors and Approximations 8 Hours
• Types of Errors: Absolute, Relative, Algorithmic, Truncation, Round off Error, Error
Propagation,
• Concept of convergence-relevance to numerical methods.

Roots of Equation
• Bisection Method, False position Method, Newton Raphson method and
Successive approximation method.
Contents
• Unit 2: Simultaneous Equations 8 Hours

• Introduction, Analytical curves (Line, circle, ellipse, parabola, Gauss Elimination


Method, Partial pivoting, Gauss-Seidal method and Thomas algorithm for
Tridiagonal Matrix
Contents
• Unit 3: Optimization 10 Hours
• Introduction to optimization, Classification, Constrained optimization: Graphical
and Simplex method. One dimensional unconstrained optimization : Newton’s
Method.

• Modern Optimization techniques :Genetic Algorithm (GA), Simulated Annealing


(SA).
Contents
• Unit 4: Curve Fitting & Interpolation 6 Hours

• Curve Fitting :Least square technique- Straight line, Power equation, Exponential
equation and Quadratic equation.

• Interpolation : Langrage's Interpolation, Newtons Forward Interpolation, Hermit


Interpolation and Inverse Interpolation.
Contents
• Unit 5: Numerical Integration 6 Hours
• Trapezoidal rule , Simpsons (1/3 rd and 3/8th), Gauss Quadrature 2 point and 3
point method.
• Double Integration : Trapezoidal rule , Simpsons (1/3 rd Rule )
Contents
• Unit 6: Numerical Solutions of Differential Equations 6 Hours
• Ordinary Differential Equations [ODE]
• Taylor series method, Euler Method, Modified Euler Method(Iterative), Runge
Kutta fourth order
• Method, Simultaneous equations using RungeKutta2nd order method.
• Partial Differential Equations [PDE]: Finite Difference methods
• Introduction to finite difference method, PDEs- Parabolic explicit solution, Elliptic
explicit solution.
Term Work
1.Program on Roots of Equation (Validation by suitable solver, all four compulsory)
a). Bisection Method, b). False position Method,
c). Newton Raphson method d). Successive approximation method
2. Program on Simultaneous Equations (Validation by suitable solver, all three compulsory)
a) Gauss Elimination Method,
b) Thomas algorithm for tridiagonal matrix,
c) Gauss-Seidal method.
3. Program on Numerical Integration(Validation by suitable solver, all four compulsory)
a) Trapezoidal rule,
b) Simpsons 1/3rd, 3/8th) [In one program only]
c) Gauss Quadrature Method- 2 point, 3 point. [In one program only]
d) Double integration: Trapezoidal rule, Simpsons 1/3 rd Rule.
Term Work
4. Program on Curve Fitting using Least square technique (Validation by suitable solver, all four compulsory)
a) Straight line,
b) Power equation
c) Exponential equation
d) Quadratic equation
5. Program on Interpolation(Validation by suitable solver, all three compulsory)
a) Langrange's Interpolation
b) Newtons Forward Interploation
c) Inverse interpolation
6. Program on ODE(Validation by suitable solver, all three compulsory)
a) Euler Method(Iterative),
b) Runge-Kutta Methods- fourth order,
c) Simultaneous equations.(Runge-Kutta 2nd order: One step only).
7. Program on PDE(Validation by suitable solver)
8. Theory assignment on Modern Optimization techniques
Books
Text Books
• 1. Steven C. Chapra, Raymond P. Canale, Numerical Methods for Engineers, 4/e, Tata McGraw Hill Editions
• 2. Dr. B. S. Garewal, Numerical Methods in Engineering and Science, Khanna Publishers,.
• 3. Steven C. Chapra, Applied Numerical Methods with MATLAB for Engineers and Scientist, Tata
• Mc-GrawHill Publishing Co-Ltd
• 4. Rao V. Dukkipati, Applied Numerical Methods using Matlab, New Age International Publishers
Reference Books
• 1. Gerald and Wheatley, Applied Numerical Analysis, Pearson Education Asia
• 2. E. Balagurusamy, Numerical Methods, Tata McGraw Hill
• 3. P. Thangaraj, Computer Oriented Numerical Methods, PHI
• 4. S. S. Sastry, Introductory Methods of Numerical Analysis, PHI.
Root of Equation 04

SCHOOL OF ENGINEERING AND TECHNOLOGY


05

SCHOOL OF ENGINEERING AND TECHNOLOGY


06

SCHOOL OF ENGINEERING AND TECHNOLOGY


06

SCHOOL OF ENGINEERING AND TECHNOLOGY


07

Numerical Methods to obtain root of Equations

Bracketing Method

Bisection Method

Open End Method

Newtons Raphson

Successive Approximation

SCHOOL OF ENGINEERING AND TECHNOLOGY

You might also like