1 Newton’s Method.

Slides:



Advertisements
Similar presentations
Copyright © Cengage Learning. All rights reserved.
Advertisements

Lecture 5 Newton-Raphson Method
Numerical Solution of Nonlinear Equations
Section Differentials Tangent Line Approximations A tangent line approximation is a process that involves using the tangent line to approximate a.
CSE 330: Numerical Methods
Open Methods Chapter 6 The Islamic University of Gaza
Chapter 4 Roots of Equations
Lecture #18 EEE 574 Dr. Dan Tylavsky Nonlinear Problem Solvers.
Open Methods (Part 1) Fixed Point Iteration & Newton-Raphson Methods
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Martin Mendez UASLP Chapter 61 Unit II.
Open Methods Chapter 6 The Islamic University of Gaza
NUMERICAL METHODS WITH C++ PROGRAMMING
Roots of Equations Open Methods Second Term 05/06.
Derivative of an Inverse AB Free Response 3.
Secant Method Another Recursive Method. Secant Method The secant method is a recursive method used to find the solution to an equation like Newton’s Method.
Ch 8.1 Numerical Methods: The Euler or Tangent Line Method
Solving Non-Linear Equations (Root Finding)
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 2 Roots of Equations Why? But.
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
Lecture 6 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
Chapter 3 Roots of Equations. Objectives Understanding what roots problems are and where they occur in engineering and science Knowing how to determine.
4.5: Linear Approximations, Differentials and Newton’s Method.
Numerical Methods.
Newton’s Method, Root Finding with MATLAB and Excel
Dr. Jie Zou PHY Chapter 2 Solution of Nonlinear Equations: Lecture (II)
linear  2.3 Newton’s Method ( Newton-Raphson Method ) 1/12 Chapter 2 Solutions of Equations in One Variable – Newton’s Method Idea: Linearize a nonlinear.
Linearization and Newton’s Method. I. Linearization A.) Def. – If f is differentiable at x = a, then the approximating function is the LINEARIZATION of.
Numerical Methods Solution of Equation.
Iteration Methods “Mini-Lecture” on a method to solve problems by iteration Ch. 4: (Nonlinear Oscillations & Chaos). Some nonlinear problems are solved.
§3.6 Newton’s Method. The student will learn about
Linearization, Newton’s Method
SOLVING NONLINEAR EQUATIONS. SECANT METHOD MATH-415 Numerical Analysis 1.
Newton’s Method Problem: need to solve an equation of the form f(x)=0. Graphically, the solutions correspond to the points of intersection of the.
4.5: Linear Approximations, Differentials and Newton’s Method Greg Kelly, Hanford High School, Richland, Washington.
Lecture 4 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
Numerical Methods and Optimization C o u r s e 1 By Bharat R Chaudhari.
NUMERICAL ANALYSIS I. Introduction Numerical analysis is concerned with the process by which mathematical problems are solved by the operations.
CSE 330: Numerical Methods. Introduction The bisection and false position method require bracketing of the root by two guesses Such methods are called.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 2 / Chapter 5.
CHAPTER 3 NUMERICAL METHODS
4.5: Linear Approximations, Differentials and Newton’s Method
Numerical Methods and Analysis
Boyce/DiPrima 9th ed, Ch 2.7: Numerical Approximations: Euler’s Method Elementary Differential Equations and Boundary Value Problems, 9th edition, by.
4.5: Linear Approximations, Differentials and Newton’s Method
Sequences and Series of Functions
Multiplicity of a Root First Modified Newton’s Method
Computational Methods EML3041
Read Chapters 5 and 6 of the textbook
Chapter 6.
Solution of Equations by Iteration
Ch 5.2: Series Solutions Near an Ordinary Point, Part I
Computers in Civil Engineering 53:081 Spring 2003
Section 11.3 Power Series.
Further Sequences and Series
5.1 Power Series Method Section 5.1 p1.
SOLUTION OF NONLINEAR EQUATIONS
4 Numerical Methods Root Finding.
9.2 Arithmetic Sequences and Series
Section 4.8: Newton’s Method
Continuity Alex Karassev.
3.8 Newton’s Method How do you find a root of the following function without a graphing calculator? This is what Newton did.
3.8: Newton’s Method Greg Kelly, Hanford High School, Richland, Washington.
4.5: Linear Approximations, Differentials and Newton’s Method
3.8: Newton’s Method Greg Kelly, Hanford High School, Richland, Washington.
4.5: Linear Approximations, Differentials and Newton’s Method
Newton-Raphson Method
Some iterative methods free from second derivatives for nonlinear equation Muhammad Aslam Noor Dept. of Mathematics, COMSATS Institute of Information Technology,
Chapter 6.
Copyright © Cengage Learning. All rights reserved.
MATH 1910 Chapter 3 Section 8 Newton’s Method.
Presentation transcript:

1 Newton’s Method

2 The Newton’s Method is one of the most popular and powerful iterative method for finding roots of the nonlinear equation f(x) = 0 . It is also known as the method of tangents because after estimated the actual root, the zero of the tangent to the function at that point is determined. It always converges if the initial approximation is sufficiently close to the exact solution.

and the derivative of the function at arbitrary point x. 3 This method is distinguished from the methods of previous sections by the fact that it requires the evaluation of both the function f(x) and the derivative of the function at arbitrary point x.

4 The Newton’s method consists geometrically of expanding the tangent line at a current point _______until it crosses zero, then setting the next guess ____________ to the abscissa of that zero crossing, This method is also called the Newton-Raphson method.

Graphical Solution of Newton’s Method. 5

Let and let be the nth approximation to the root α such that and 6 There are many description of the Newton’s method. We shall derive the method from the familiar Taylor’s series expansion of a function in the neighborhood of a point. Let and let be the nth approximation to the root α such that and is small.

Since f(α) = 0, then , with x = α , gives Consider the first Taylor polynomial for f(x) expanded about , so we have 7  where lies between x and . Since f(α) = 0, then , with x = α , gives 

Since is small, then we neglect the term involving and so 8 Since is small, then we neglect the term involving and so Solving for α, we get which should be better approximation to α than is .

We call this approximation as , then we get 9 () The iterative method () is called the Newton’s method. Usually the Newton’s method converges well and quickly but its convergence cannot, however guaranteed and it may sometime converge to a different root from the one expected.

10 In particular, there may be difficulties if initial approximation is not sufficiently close to the actual root. The most serious problem of the Newton’s method is that some functions are difficult to differentiate analytically, and some functions cannot be differentiated analytically at all.

The Newton’s method is not restricted to one- dimension only. 11 The Newton’s method is not restricted to one- dimension only. The method readily generalizes to multiple dimensions. It should be noted that this method is suitable for finding real as well as imaginary roots of the polynomials.

12

13

14

15

16

17

18 Lemma Assume that and there exists a number α ∈ [a, b], where f(α) = 0. If , then there exists a number δ > 0 such that the sequence defined by the iteration will converges to α for any initial approximation

The Newton’s method uses the iteration function 19 The Newton’s method uses the iteration function is called the Newton’s iteration function. Since f(α) = 0, it is easy to see that g(α) = α. Thus the Newton’s iteration for finding the root of the equation f(x) = 0 is accomplished by finding a fixed-point of the equation g(x) = x.

Procedure (Newton’s Method) 20 Procedure (Newton’s Method) 1. Find the initial approximation for the root by sketching the graph of the function. 2. Evaluate function f(x) and the derivative at initial approximation. Check: if f(x0) = 0 then is the desire approximation to a root. But if , then go back to step 1. to choose new approximation. 3. Establish Tolerance (ϵ > 0) value for the function. 4. Compute new approximation for the root by using the iterative formula 5. Check Tolerance. If , for n ≥ 0, then end; otherwise, go back to step 4., and repeat the process.

Example Use the Newton’s method to find the root of that is located in the interval accurate to , take an initial approximation .

Solution: Given and so Now evaluating f(x) and ________________at the give approximation , gives

() الخوارزمية The algorithm 