Scribd
Upload
52 views2 pages

Chapter 2: Solution of Nonlinear Equations (5 Hours) (Required Time: 45 Minutes X 10 Periods) Periods Sub-Topic Methodology Code Time (Min)

This document outlines a 5 hour chapter on solving nonlinear equations. It is divided into 7 periods covering various methods: bisection method, false position method, Newton-Raphson method, secant method, and fixed point iteration method. For each method, the document describes the introduction, examples, algorithms, advantages/disadvantages, and rate of convergence. It also provides sample theory and numerical questions related to finding real roots of nonlinear equations using the different solving methods.

Uploaded by

SakiAtScribd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
52 views2 pages

Chapter 2: Solution of Nonlinear Equations (5 Hours) (Required Time: 45 Minutes X 10 Periods) Periods Sub-Topic Methodology Code Time (Min)

This document outlines a 5 hour chapter on solving nonlinear equations. It is divided into 7 periods covering various methods: bisection method, false position method, Newton-Raphson method, secant method, and fixed point iteration method. For each method, the document describes the introduction, examples, algorithms, advantages/disadvantages, and rate of convergence. It also provides sample theory and numerical questions related to finding real roots of nonlinear equations using the different solving methods.

Uploaded by

SakiAtScribd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CHAPTER 2: SOLUTION OF NONLINEAR EQUATIONS (5 HOURS) = (REQUIRED

TIME: 45 MINUTES X 10 PERIODS)

Periods Sub-topic Methodology Code Time (min)

2.1 Solution of Nonlinear Equations & a. Ex a. 10


Bisection Method b. Ex b. 10
a. Introduction c. Ex, Fg, De c. 20
b. Bracketing & Open Method d. Nu d. 20
c. Bisection Method e. Ex e. 10
3 d. Bisection Method Examples f. Ex f. 10
e. Bisection Method Algorithms g. Ex, De g. 10
f. Bisection Method Advantages &
Disadvantages
g. Rate of Convergence of
Bisection Method
2.2 False Position Method a. Fw, Ex, De, Fg a. 30
a. Introduction b. Nu b. 10
b. Examples c. Ex c. 20
4
c. Algorithms d. Ex d. 10
d. Advantages & Disadvantages e. Ex, De e. 20
e. Rate of Convergence

2.3 Newton Raphson Method a. Fw, Ex, De, Fg a. 30


a. Introduction b. Nu b. 10
b. Examples c. Ex c. 20
5
c. Algorithms d. Ex d. 10
d. Advantages & Disadvantages e. Ex, De e. 20
e. Rate of Convergence

2.4 Secant Method a. Fw, Ex, De, Fg a. 30


a. Introduction b. Nu b. 10
b. Examples c. Ex c. 20
6
c. Algorithms d. Ex d. 10
e. Ex, De e. 20
d. Advantages & Disadvantages
e. Rate of Convergence
2.5 Fixed Point Iteration Method a. Fw, Ex, De, Fg a. 30
a. Introduction b. Nu b. 10
b. Examples c. Ex c. 20
7
c. Algorithms d. Ex d. 10
e. Ex, De e. 20
d. Advantages & Disadvantages
e. Rate of Convergence

SAMPLE THEORY QUESTIONS


1. Explain graphically how real root of nonlinear equation is obtained using Secant method.
2. Discuss the algorithms for Newton Raphson method.
3. Write a program in C to find real root of nonlinear equation using Bisection method.

SAMPLE NUMERICAL QUESTIONS

1. Find real root of nonlinear equation: cos(x) – xex = 0 using Secant Method.
2. Find root of nonlinear equation x3 – 3x-11=0 using Newton Raphson method taking 0.9
as initial guess.

You might also like