MATH 175: Numerical Analysis II Lecturer: Jomar Fajardo Rabajante IMSP, UPLB 2 nd Sem AY 2012-2013.

Slides:



Advertisements
Similar presentations
Numerical Computation Lecture 4: Root Finding Methods - II United International College.
Advertisements

Lecture 5 Newton-Raphson Method
Regula-Falsi Method. Type of Algorithm (Equation Solver) The Regula-Falsi Method (sometimes called the False Position Method) is a method used to find.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 7 Roots of Equations Bracketing Methods.
Roots of Equations Open Methods (Part 2).
Second Term 05/061 Roots of Equations Bracketing Methods.
A few words about convergence We have been looking at e a as our measure of convergence A more technical means of differentiating the speed of convergence.
Open Methods (Part 1) Fixed Point Iteration & Newton-Raphson Methods
Roots of Equations Bracketing Methods.
NUMERICAL METHODS WITH C++ PROGRAMMING
Roots of Equations Open Methods Second Term 05/06.
Chapter 3 Root Finding.
MATH 175: NUMERICAL ANALYSIS II CHAPTER 3: Differential Equations Lecturer: Jomar Fajardo Rabajante 2nd Sem AY IMSP, UPLB.
MATH 175: NUMERICAL ANALYSIS II Lecturer: Jomar Fajardo Rabajante IMSP, UPLB 2 nd Semester AY
8/30/ Secant Method Major: All Engineering Majors Authors: Autar Kaw, Jai Paul
Solving Non-Linear Equations (Root Finding)
9/20/ Secant Method Civil Engineering Majors Authors: Autar Kaw, Jai Paul
MATH 175: Numerical Analysis II Lecturer: Jomar Fajardo Rabajante 2 nd Sem AY IMSP, UPLB.
Lecture 6 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
Numerical Methods for Engineering MECN 3500
Problem of the Day No calculator! What is the instantaneous rate of change at x = 2 of f(x) = x2 - 2 ? x - 1 A) -2 C) 1/2 E) 6 B) 1/6 D) 2.
Numerical Methods.
11/30/ Secant Method Industrial Engineering Majors Authors: Autar Kaw, Jai Paul
CHAPTER 3 NUMERICAL METHODS
Lecture 5 - Single Variable Problems CVEN 302 June 12, 2002.
Solving Non-Linear Equations (Root Finding)
For any function f (x), the tangent is a close approximation of the function for some small distance from the tangent point. We call the equation of the.
4.8 Newton’s Method Mon Nov 9 Do Now Find the equation of a tangent line to f(x) = x^5 – x – 1 at x = 1.
Linearization, Newton’s Method
SOLVING NONLINEAR EQUATIONS. SECANT METHOD MATH-415 Numerical Analysis 1.
Warm Up Write an equation of the tangent line to the curve at the given point. 1)f(x)= x 3 – x + 1 where x = -1 2)g(x) = 3sin(x/2) where x = π/2 3)h(x)
6/13/ Secant Method Computer Engineering Majors Authors: Autar Kaw, Jai Paul
Numerical Methods and Optimization C o u r s e 1 By Bharat R Chaudhari.
CSE 330: Numerical Methods. Introduction The bisection and false position method require bracketing of the root by two guesses Such methods are called.
1 Approximating functions, polynomial interpolation (Lagrange and Newton’s divided differences) formulas, error approximations.
Solution of Nonlinear Equations ( Root Finding Problems )
MATH 175: Numerical Analysis II
CHAPTER 3 NUMERICAL METHODS
Secant Method.
LECTURE 3 OF SOLUTIONS OF NON -LINEAR EQUATIONS.
CS B553: Algorithms for Optimization and Learning
Lecture 4: Numerical Methods
Read Chapters 5 and 6 of the textbook
Secant Method – Derivation
Chapter 6.
MATH 2140 Numerical Methods
Numerical Analysis Lecture 7.
Numerical Analysis Lecture 45.
Roots of equations Class VII.
Computers in Civil Engineering 53:081 Spring 2003
MATH 175: Numerical Analysis II
MATH 175: NUMERICAL ANALYSIS II
POLYNOMIAL INTERPOLATION
MATH 174: Numerical Analysis I
ROOTS OF EQUATIONS.
MATH 174: NUMERICAL ANALYSIS I
3.8 Newton’s Method How do you find a root of the following function without a graphing calculator? This is what Newton did.
MATH 174: NUMERICAL ANALYSIS I
Newton’s Method and Its Extensions
Math 175: Numerical Analysis II
FP1: Chapter 2 Numerical Solutions of Equations
MATH 175: Numerical Analysis II
MATH 175: NUMERICAL ANALYSIS II
MATH 175: Numerical Analysis II
MATH 175: Numerical Analysis II
MATH 175: NUMERICAL ANALYSIS II
Chapter 6.
Copyright © Cengage Learning. All rights reserved.
MATH 1910 Chapter 3 Section 8 Newton’s Method.
EE, NCKU Tien-Hao Chang (Darby Chang)
Presentation transcript:

MATH 175: Numerical Analysis II Lecturer: Jomar Fajardo Rabajante IMSP, UPLB 2 nd Sem AY

Question: What if we do not have means of getting an initial bracket? Let’s start with SECANT METHOD… Suppose that f is a continuous function. Pick two initial points (not necessarily forming a bracket), then do linear interpolation (not inverse).

4 th Method: SECANT METHOD Initial points: Interpolating line: Use x-intercept:

4 th Method: SECANT METHOD Approximate: -Same as the formula for Regula Falsi -In an iteration, if the points form a bracket, then the method is similar to Regula Falsi; else the method uses extrapolation. In whatever case, the new points will be Old x 2

4 th Method: SECANT METHOD In short: Pick any two distinct points, draw the secant through them, and use the x-intercept (x 3 ) of that secant line as the new estimate of the zero of the function. For the next iteration, discard the oldest point and add (x 3, f(x 3 )) as the new point. WE DO NOT NEED IZT (IVT) ANYMORE!

4 th Method: SECANT METHOD Secant method can be considerably faster than the previous methods. However, it may fail to converge. Example: if f(x 1 )=f(x 2 ), then what would happen?

4 th Method: SECANT METHOD Notice that can be written as

and can also be written as You can use any of these formulas for Regula Falsi and Secant Method 4 th Method: SECANT METHOD

For Secant Method (not for Regula Falsi), we can generalize the formulas as follows (k=1,2,3,…)

4 th Method: SECANT METHOD Example: Find a zero of Use 0 & 1 as initial values =(A1*(A2^3+A2-1)- A2*(A1^3+A1- 1))/((A2^3+A2-1)-(A1^3+A1- 1)) =B2

4 th Method: SECANT METHOD Assuming that the secant method converges to the root, the order of convergence of the method is SUPERLINEAR!!! (but not yet quadratic)

4 th Method: SECANT METHOD Stopping criterion: You can use tol=10^(-m): accurate at least up to m decimal places

5 th Method: Newton’s Method/Newton-Raphson Iteration What if we make the secant line is a tangent line? Hence, we only need one initial point. But we add another assumption: f should be differentiable!

5 th Method: Newton’s Method/Newton-Raphson Iteration From Secant Method: If we use tangent lines: as x k-2 approaches x k-1

5 th Method: Newton’s Method/Newton-Raphson Iteration Hence:

Newton’s Method: To be continued… Assignment: List the advantages and disadvantages of the discussed methods. Research other disadvantages that we did not mention in the class.