Scribd
Upload
68 views10 pages

Root Finding Solutions

This document reports on the results of using bisection, Newton-Raphson, and secant root-finding methods on two equations. Bisection method failed because the initial guesses did not satisfy the requirement of being on opposite sides of the root. Newton-Raphson converged rapidly near the root but choice of initial guess and function nature impact convergence. Secant method required more iterations than Newton-Raphson and does not guarantee convergence but does not require evaluating the derivative.

Uploaded by

Hrishikesh Kulkarni
Copyright
© Attribution Non-Commercial (BY-NC)
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
68 views10 pages

Root Finding Solutions

This document reports on the results of using bisection, Newton-Raphson, and secant root-finding methods on two equations. Bisection method failed because the initial guesses did not satisfy the requirement of being on opposite sides of the root. Newton-Raphson converged rapidly near the root but choice of initial guess and function nature impact convergence. Secant method required more iterations than Newton-Raphson and does not guarantee convergence but does not require evaluating the derivative.

Uploaded by

Hrishikesh Kulkarni
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 10

Assignment number-1 Results and Discussions.

(Roll no-133100079)

Date: 11-8-2013

Bisection, Problem-1, Guess-0, 10000


Select an Equation for root finding. 1. X^2 - 2000*X + 1000000 2. X^2 - 200*X + 9999.9999 Number -1 Select the method of Root finding. 1. BISECTION METHOD 2. NEWTON-RAPHSON METHOD 3. SECANT METHOD Number 1 Enter the value of initial guess:0 Enter the value of second initial guess:10000 The initial Guesses provided are not appropriate.

Bisection, Problem-2, Guess-0, 1000


Select an Equation for root finding. 1. X^2 - 2000*X + 1000000 2. X^2 - 200*X + 9999.9999 Number -2 Select the method of Root finding. 1. BISECTION METHOD 2. NEWTON-RAPHSON METHOD 3. SECANT METHOD Number 1 Enter the value of initial guess:0 Enter the value of second initial guess:1000 The initial Guesses provided are not appropriate.

Discussion for bisection method.


Equation- 1 X^2 - 2000*X + 1000000

Equation- 2 X^2 - 200*X + 9999.9999

The Bisection method requires function to be negative at one of the initial guesses since this ensures at least one of the roots is present inside the interval. In both the given equations the initial guesses provided gives positive value of function. Therefore initial guesses are not appropriate for bisection method. As well as 1st equation has local minima at root so bisection method fails.

Newton-Raphson, Problem-1, Guess-0


Select an Equation for root finding. 1. X^2 - 2000*X + 1000000 2. X^2 - 200*X + 9999.9999 Number -1 Select the method of Root finding. 1. BISECTION METHOD 2. NEWTON-RAPHSON METHOD 3. SECANT METHOD Number 2 Enter the value of initial guess:0 The root of the Equation is 9.999999e+02 at iteration no-24. Error v/s number of iterations.

Newton-Raphson, Problem-1, Guess-100


Select an Equation for root finding. 1. X^2 - 2000*X + 1000000 2. X^2 - 200*X + 9999.9999 Number -1 Select the method of Root finding. 1. BISECTION METHOD 2. NEWTON-RAPHSON METHOD 3. SECANT METHOD Number - 2 Enter the value of initial guess:100 The root of the Equation is 9.999999e+02 at iteration no-24.

Error v/s number of iterations.

Newton-Raphson, Problem-1, Guess-1000


Select an Equation for root finding. 1. X^2 - 2000*X + 1000000 2. X^2 - 200*X + 9999.9999 Number -1 Select the method of Root finding. 1. BISECTION METHOD 2. NEWTON-RAPHSON METHOD 3. SECANT METHOD Number - 2 Enter the value of initial guess:0 The root of the Equation is 1000 at iteration no-0.

Newton-Raphson, Problem-1, Guess-10000


Select an Equation for root finding. 1. X^2 - 2000*X + 1000000 2. X^2 - 200*X + 9999.9999 Number -1 Select the method of Root finding. 1. BISECTION METHOD 2. NEWTON-RAPHSON METHOD 3. SECANT METHOD Number - 2 Enter the value of initial guess:10000 The root of the Equation is 1.000000e+03 at iteration no-27.

Error v/s number of iterations.

Newton-Raphson, Problem-2, Guess-0


Select an Equation for root finding. 1. X^2 - 2000*X + 1000000 2. X^2 - 200*X + 9999.9999 Number -2 Select the method of Root finding. 1. BISECTION METHOD 2. NEWTON-RAPHSON METHOD 3. SECANT METHOD Number - 2 Enter the value of initial guess:0 The root of the Equation is 9.999000e+01 at iteration no-16. Error v/s number of iterations.

Newton-Raphson, Problem-2, Guess-100


Select an Equation for root finding. 1. X^2 - 2000*X + 1000000 2. X^2 - 200*X + 9999.9999 Number -2 Select the method of Root finding. 1. BISECTION METHOD 2. NEWTON-RAPHSON METHOD 3. SECANT METHOD Number - 2 Enter the value of initial guess:100 The root of the Equation is 100 at iteration no-0.

Newton-Raphson, Problem-2, Guess-1000


Select an Equation for root finding. 1. X^2 - 2000*X + 1000000 2. X^2 - 200*X + 9999.9999 Number -2 Select the method of Root finding. 1. BISECTION METHOD 2. NEWTON-RAPHSON METHOD 3. SECANT METHOD Number - 2 Enter the value of initial guess:1000 The root of the Equation is 1.000100e+02 at iteration no-19. Error v/s iteration.

Discussion for Newton-Raphson method: 1. It can be observed from graph of Error v/s iterations that Newton-Raphson method converges slowly at the first few iterations but then speed of convergence increases rapidly near root. 2. The choice of initial guess and nature of function is very important in Newton methods since it decides the convergence. 3. The 2nd function has multiple roots in the given interval so that Newton-Raphson may converge to any one root. 4. for the 1st function f(x) as well as f(x) goes to zero at the root so we may get condition of division by zero. but if f(x) =0 condition is incorporated in program before f(x) =0, then f(x) reaches to 0 earlier than f(x). (According to Ralson and Rabinowitz, 1978) 5. Method is linearly convergent for multiple roots.

Secant, Problem-1, Guess-0, 100


Select an Equation for root finding. 1. X^2 - 2000*X + 1000000 2. X^2 - 200*X + 9999.9999 Number -1 Select the method of Root finding. 1. BISECTION METHOD 2. NEWTON-RAPHSON METHOD 3. SECANT METHOD Number - 3 Enter the value of initial guess:0 Enter the value of second initial guess:100 The root of the Equation is 9.999998e+02 at iteration no-33 and f(a)=2.700835e-08 Error V/s number of iterations.

Secant, Problem-1, Guess-0, 1000


Select an Equation for root finding. 1. X^2 - 2000*X + 1000000 2. X^2 - 200*X + 9999.9999 Number -1 Select the method of Root finding. 1. BISECTION METHOD 2. NEWTON-RAPHSON METHOD 3. SECANT METHOD Number - 3 Enter the value of initial guess:0 Enter the value of second initial guess:1000 The root of the Equation is 1000

Secant, Problem-1, Guess-0, 10000


Select an Equation for root finding. 1. X^2 - 2000*X + 1000000 2. X^2 - 200*X + 9999.9999 Number -1 Select the method of Root finding. 1. BISECTION METHOD 2. NEWTON-RAPHSON METHOD 3. SECANT METHOD Number - 3 Enter the value of initial guess:0 Enter the value of second initial guess:10000 The root of the Equation is 9.999998e+02 at iteration no-35. Error v/s iteration.

Secant, Problem-2, Guess-0, 100


Select an Equation for root finding. 1. X^2 - 2000*X + 1000000 2. X^2 - 200*X + 9999.9999 Number -2 Select the method of Root finding. 1. BISECTION METHOD 2. NEWTON-RAPHSON METHOD 3. SECANT METHOD Number - 3 Enter the value of initial guess:0 Enter the value of second initial guess:100 The root of the Equation is 100

Secant, Problem-2, Guess-0, 1000


Select an Equation for root finding. 1. X^2 - 2000*X + 1000000 2. X^2 - 200*X + 9999.9999 Number -2 Select the method of Root finding. 1. BISECTION METHOD 2. NEWTON-RAPHSON METHOD 3. SECANT METHOD Number - 3 Enter the value of initial guess:0 Enter the value of second initial guess:1000 The root of the Equation is 9.998999e+01 at iteration no-25. Error v/s iterations.

Discussion for secant method: 1. The method is less convergent than Newton-Raphson method (seen from number of iterations required) 2. This method does not guarantee the convergence. 3. The method does not require evaluation of derivative analytically.

You might also like