Chapter Newton-Raphson Method of Solving a Nonlinear Equation

Similar documents
Chapter Newton-Raphson Method of Solving a Nonlinear Equation

6 Roots of Equations: Open Methods

DCDM BUSINESS SCHOOL NUMERICAL METHODS (COS 233-8) Solutions to Assignment 3. x f(x)

Remember: Project Proposals are due April 11.

GAUSS ELIMINATION. Consider the following system of algebraic linear equations

Chapter Runge-Kutta 2nd Order Method for Ordinary Differential Equations

Chapter Gauss-Seidel Method

Chapter 3 Solving Nonlinear Equations

4. Eccentric axial loading, cross-section core

Applied Statistics Qualifier Examination

Introduction to Numerical Integration Part II

Chapter Direct Method of Interpolation More Examples Civil Engineering

Rank One Update And the Google Matrix by Al Bernstein Signal Science, LLC

Partially Observable Systems. 1 Partially Observable Markov Decision Process (POMDP) Formalism

Model Fitting and Robust Regression Methods

The Schur-Cohn Algorithm

Definition of Tracking

Chapter Direct Method of Interpolation More Examples Electrical Engineering

Quiz: Experimental Physics Lab-I

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives

Chapter Newton s Method

Summary with Examples for Root finding Methods -Bisection -Newton Raphson -Secant

Principle Component Analysis

4.5 JACOBI ITERATION FOR FINDING EIGENVALUES OF A REAL SYMMETRIC MATRIX. be a real symmetric matrix. ; (where we choose θ π for.

UNIVERSITY OF IOANNINA DEPARTMENT OF ECONOMICS. M.Sc. in Economics MICROECONOMIC THEORY I. Problem Set II

CISE 301: Numerical Methods Lecture 5, Topic 4 Least Squares, Curve Fitting

INTRODUCTION TO COMPLEX NUMBERS

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite

Improper Integrals, and Differential Equations

Polynomial Approximations for the Natural Logarithm and Arctangent Functions. Math 230

Abhilasha Classes Class- XII Date: SOLUTION (Chap - 9,10,12) MM 50 Mob no

Unit #9 : Definite Integral Properties; Fundamental Theorem of Calculus

INTERPOLATION(1) ELM1222 Numerical Analysis. ELM1222 Numerical Analysis Dr Muharrem Mercimek

ORDINARY DIFFERENTIAL EQUATIONS

Before we can begin Ch. 3 on Radicals, we need to be familiar with perfect squares, cubes, etc. Try and do as many as you can without a calculator!!!

Chapter 6 Notes, Larson/Hostetler 3e

PHYS Summer Professor Caillault Homework Solutions. Chapter 2

Fact: All polynomial functions are continuous and differentiable everywhere.

Definition of Continuity: The function f(x) is continuous at x = a if f(a) exists and lim

Chapter Bisection Method of Solving a Nonlinear Equation

Lecture 4: Piecewise Cubic Interpolation

Energy Bands Energy Bands and Band Gap. Phys463.nb Phenomenon

Variable time amplitude amplification and quantum algorithms for linear algebra. Andris Ambainis University of Latvia

ITERATIVE METHODS FOR SOLVING SYSTEMS OF LINEAR ALGEBRAIC EQUATIONS

Calculus II: Integrations and Series

INTRODUCTION TO INTEGRATION

approaches as n becomes larger and larger. Since e > 1, the graph of the natural exponential function is as below

Dennis Bricker, 2001 Dept of Industrial Engineering The University of Iowa. MDP: Taxi page 1

Chapter Direct Method of Interpolation More Examples Chemical Engineering

Exam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1

8. INVERSE Z-TRANSFORM

DERIVATIVES NOTES HARRIS MATH CAMP Introduction

Lecture 12: Numerical Quadrature

In this Chapter. Chap. 3 Markov chains and hidden Markov models. Probabilistic Models. Example: CpG Islands

11.1 Exponential Functions

p(t) dt + i 1 re it ireit dt =

7.2 Volume. A cross section is the shape we get when cutting straight through an object.

Review of Calculus, cont d

Chapter 0. What is the Lebesgue integral about?

Linear and Nonlinear Optimization

PART 1 MULTIPLE CHOICE Circle the appropriate response to each of the questions below. Each question has a value of 1 point.

Lesson 1: Quadratic Equations

The Number of Rows which Equal Certain Row

Jens Siebel (University of Applied Sciences Kaiserslautern) An Interactive Introduction to Complex Numbers

Math 113 Exam 2 Practice

Uniform Circular Motion

Trigonometry. Trigonometry. Solutions. Curriculum Ready ACMMG: 223, 224, 245.

6.6 The Marquardt Algorithm

ESCI 342 Atmospheric Dynamics I Lesson 1 Vectors and Vector Calculus

and that at t = 0 the object is at position 5. Find the position of the object at t = 2.

SUMMER KNOWHOW STUDY AND LEARNING CENTRE

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.

Section 5.1 #7, 10, 16, 21, 25; Section 5.2 #8, 9, 15, 20, 27, 30; Section 5.3 #4, 6, 9, 13, 16, 28, 31; Section 5.4 #7, 18, 21, 23, 25, 29, 40

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER /2019

Chapters 4 & 5 Integrals & Applications

Interpreting Integrals and the Fundamental Theorem

ME 501A Seminar in Engineering Analysis Page 1

The Fundamental Theorem of Calculus Part 2, The Evaluation Part

Lecture 1. Functional series. Pointwise and uniform convergence.

Chapter Linear Regression

We partition C into n small arcs by forming a partition of [a, b] by picking s i as follows: a = s 0 < s 1 < < s n = b.

ODE: Existence and Uniqueness of a Solution

Riemann is the Mann! (But Lebesgue may besgue to differ.)

UNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3

Math 131. Numerical Integration Larson Section 4.6

Chapter 6 Techniques of Integration

Chapter 1: Fundamentals

ARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac

Duality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.

Math 1B, lecture 4: Error bounds for numerical methods

20 MATHEMATICS POLYNOMIALS

( ) ( )()4 x 10-6 C) ( ) = 3.6 N ( ) = "0.9 N. ( )ˆ i ' ( ) 2 ( ) 2. q 1 = 4 µc q 2 = -4 µc q 3 = 4 µc. q 1 q 2 q 3

Chapter 1: Logarithmic functions and indices

p-adic Egyptian Fractions

Electrochemical Thermodynamics. Interfaces and Energy Conversion

P 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0)

AP Calculus Multiple Choice: BC Edition Solutions

Improper Integrals. Type I Improper Integrals How do we evaluate an integral such as

Mathematics Number: Logarithms

Effects of polarization on the reflected wave

Transcription:

Chpter.4 Newton-Rphson Method of Solvng Nonlner Equton After redng ths chpter, you should be ble to:. derve the Newton-Rphson method formul,. develop the lgorthm of the Newton-Rphson method,. use the Newton-Rphson method to solve nonlner equton, nd 4. dscuss the drwbcks of the Newton-Rphson method. Introducton Methods such s the bsecton method nd the flse poston method of fndng roots of nonlner equton f ( requre brcketng of the root by two guesses. Such methods re clled brcketng methods. These methods re lwys convergent snce they re bsed on reducng the ntervl between the two guesses so s to zero n on the root of the equton. In the Newton-Rphson method, the root s not brcketed. In fct, only one ntl guess of the root s needed to get the tertve process strted to fnd the root of n equton. The method hence flls n the ctegory of open methods. Convergence n open methods s not gurnteed but f the method does converge, t does so much fster thn the brcketng methods. Dervton The Newton-Rphson method s bsed on the prncple tht f the ntl guess of the root of f ( s t, then f one drws the tngent to the curve t f (, the pont + where the tngent crosses the -s s n mproved estmte of the root (Fgure. Usng the defnton of the slope of functon, t f ( tn θ f (, + whch gves f ( + ( f (.4.

.4. Chpter.4 Equton ( s clled the Newton-Rphson formul for solvng nonlner equtons of the form f (. So strtng wth n ntl guess,, one cn fnd the net guess, +, by usng Equton (. One cn repet ths process untl one fnds the root wthn desrble tolernce. Algorthm The steps of the Newton-Rphson method to fnd the root of n equton (. Evlute f ( symbolclly. Use n ntl guess of the root, f ( + f ( f re, to estmte the new vlue of the root, +, s. Fnd the bsolute reltve ppromte error s + + 4. Compre the bsolute reltve ppromte error wth the pre-specfed reltve error tolernce, s. If > s, then go to Step, else stop the lgorthm. Also, check f the number of tertons hs eceeded the mmum number of tertons llowed. If so, one needs to termnte the lgorthm nd notfy the user. f ( f ( [, f ( ] f ( + θ + + Fgure Geometrcl llustrton of the Newton-Rphson method.

Newton-Rphson Method.4. Emple You hve sphercl storge tnk contnng ol. The tnk hs dmeter of 6 ft. You re sked to clculte the heght h to whch dpstck 8 ft long would be wet wth ol when mmersed n the tnk when t contns 6 ft of ol. Dpstck Sphercl Storge Tnk r h Fgure Sphercl storge tnk problem. The equton tht gves the heght h of the lqud n the sphercl tnk for the gven volume nd rdus s gven by f ( h h 9h +.897 Use the Newton-Rphson method of fndng roots of equtons to fnd the heght h to whch the dpstck s wet wth ol. Conduct three tertons to estmte the root of the bove equton. Fnd the bsolute reltve ppromte error t the end of ech terton nd the number of sgnfcnt dgts t lest correct t the end of ech terton. Soluton f ( h h 9h +. 897 f ( h h 8h Let us tke the ntl guess of the root of ( h Iterton The estmte of the root s f ( h h h f h ( ( 9( + ( 8(.897 f s h.

.4.4 Chpter.4 4.8 5 (. 7869.7 The bsolute reltve ppromte error h h h t the end of Iterton s. 7. 7 8.66% The number of sgnfcnt dgts t lest correct s, s you need n bsolute reltve ppromte error of 5 % or less for one sgnfcnt dgt to be correct n your result. Iterton The estmte of the root s f ( h h h f h ( (. 7 9(. 7 + (. 7 8(. 7. 7.48764. 7.4. 7 (.469.6786 The bsolute reltve ppromte error h h h.6786. 7. 6786 6.97% The number of sgnfcnt dgts t lest correct s. Iterton The estmte of the root s f ( h h h f h.897 ( (. 6786 9(. 6786 + (.6786 8(. 6786.6786.56. 6786.84 t the end of Iterton s.897

Newton-Rphson Method.4.5 (.57. 6786.67747 The bsolute reltve ppromte error h h h t the end of Iterton s. 67747. 6786. 67747.78% Hence the number of sgnfcnt dgts t lest correct s gven by the lrgest vlue of m for whch m.5 m.78.5 m.46 log (.46 m m log(.46. 4665 So m The number of sgnfcnt dgts t lest correct n the estmted root.67747 s. Drwbcks of the Newton-Rphson Method. Dvergence t nflecton ponts If the selecton of the ntl guess or n terted vlue of the root turns out to be close to the nflecton pont (see the defnton n the ppend of ths chpter of the functon f ( n the equton f (, Newton-Rphson method my strt dvergng wy from the root. It my then strt convergng bck to the root. For emple, to fnd the root of the equton f ( ( +.5 the Newton-Rphson method reduces to ( +.5 + ( Strtng wth n ntl guess of 5., Tble shows the terted vlues of the root of the equton. As you cn observe, the root strts to dverge t Iterton 6 becuse the prevous estmte of.9589 s close to the nflecton pont of (the vlue of f ' ( s zero t the nflecton pont. Eventully, fter more tertons the root converges to the ect vlue of..

.4.6 Chpter.4 Tble Dvergence ner nflecton pont. Iterton Number 5..656.7465.84 4.6 5.9589 6.9 7 9.746 8.8 9 8.7 5.498.44.7464.8556 4.858 5.9784 6.7475 7.994 8. Fgure Dvergence t nflecton pont for ( (. Dvson by zero For the equton 6 f. +. 4 the Newton-Rphson method reduces to ( +. +. 4.6 6 f.

Newton-Rphson Method.4.7 For or., dvson by zero occurs (Fgure 4. For n ntl guess close to. such s. 999, one my vod dvson by zero, but then the denomntor n the formul s smll number. For ths cse, s gven n Tble, even fter 9 tertons, the Newton-Rphson method does not converge. Tble Dvson by ner zero n Newton-Rphson method. Iterton f ( Number % -6.999.6.648 8.778.75.76 5.568 5.8.74.6485 5.4 4.77765.4884 5.6 5.558.447 5.946 6.45.486 5.4 7.69.69 5.7 8.468.755 5.7 9.9449.9 54.6.E-5 7.5E-6 f( 5.E-6.5E-6.E+ -. -. -.....4 -.5E-6. -5.E-6-7.5E-6 -.E-5 Fgure 4 Ptfll of dvson by zero or ner zero number.. Osclltons ner locl mmum nd mnmum Results obtned from the Newton-Rphson method my oscllte bout the locl mmum or mnmum wthout convergng on root but convergng on the locl mmum or mnmum. Eventully, t my led to dvson by number close to zero nd my dverge. For emple, for f ( + the equton hs no rel roots (Fgure 5 nd Tble.

.4.8 Chpter.4 6 f( 5 4 4 - - -.75 -.4.5.4 - Fgure 5 Osclltons round locl mnm for ( + f. Tble Osclltons ner locl mm nd mnm n Newton-Rphson method. Iterton f ( Number % 4 5 6 7 8 9..5.75.57.4.59.766 5.795.6955.97678..5 5.6.9.874.57.9 4.94 9.66.954. 8.57 476.47 9.66 5.8 89.88.99.9 75.96 4. Root jumpng In some cse where the functon f ( s osclltng nd hs number of roots, one my choose n ntl guess close to root. However, the guesses my jump nd converge to some other root. For emple for solvng the equton sn f you choose.4π ( 7.598 s n ntl guess, t converges to the root of s shown n Tble 4 nd Fgure 6. However, one my hve chosen ths s n ntl guess to converge to π 6. 885.

Newton-Rphson Method.4.9 Tble 4 Root jumpng n Newton-Rphson method. Iterton f ( Number % 4 5 7.598 4.46.5499.67 4 8.76.9586.95.969.56.6 5 8.75.9586 68.97 7.44 97.9 7.54 4.8 4 f(.5.5-4 6 8 -.67.5499 4.46 7.598 -.5 - -.5 Fgure 6 Root jumpng from ntended locton of root for ( sn f. Append A. Wht s n nflecton pont? For functon f (, the pont where the concvty chnges from up-to-down or down-to-up s clled ts nflecton pont. For emple, for the functon f ( (, the concvty chnges t (see Fgure, nd hence (, s n nflecton pont. An nflecton ponts MAY est t pont where f ( nd where f ''( does not est. The reson we sy tht t MAY est s becuse f f (, t only mkes t possble nflecton pont. For emple, for f ( 4 6, f (, but the concvty does not chnge t. Hence the pont (, 6 s not n nflecton pont of f ( 4 6. For f ( (, f ( chnges sgn t ( f ( < for <, nd f ( > for >, nd thus brngs up the Inflecton Pont Theorem for functon f ( tht sttes the followng. If f '( c ests nd f (c chnges sgn t c, then the pont ( c, f ( c s n nflecton pont of the grph of f.

.4. Chpter.4 Append B. Dervton of Newton-Rphson method from Tylor seres Newton-Rphson method cn lso be derved from Tylor seres. For generl functon f (, the Tylor seres s f" f ( f ( f + + ( ( + ( + ( + +! As n ppromton, tkng only the frst two terms of the rght hnd sde, f f + f ( + ( ( ( + nd we re seekng pont where f (, f ( +, f ( + f ( ( whch gves + ( ( tht s, f we ssume f + f' Ths s the sme Newton-Rphson method formul seres s derved prevously usng the geometrc method. NONLINEAR EQUATIONS Topc Newton-Rphson Method of Solvng Nonlner Equtons Summry Tet book notes of Newton-Rphson method of fndng roots of nonlner equton, ncludng convergence nd ptflls. Mjor Chemcl Engneerng Authors Autr Kw Dte November 8, Web Ste http://numerclmethods.eng.usf.edu