Chapter 6.

Slides:



Advertisements
Similar presentations
Part 2 Chapter 6 Roots: Open Methods
Advertisements

Chapter 6: Roots: Open Methods
Lecture 5 Newton-Raphson Method
Part 2 Chapter 6 Roots: Open Methods
Numerical Solution of Nonlinear Equations
Roundoff and truncation errors
Open Methods Chapter 6 The Islamic University of Gaza
ROOTS OF EQUATIONS Student Notes ENGR 351 Numerical Methods for Engineers Southern Illinois University Carbondale College of Engineering Dr. L.R. Chevalier.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 61.
Open Methods Chapter 6 The Islamic University of Gaza
Open Methods Chapter 6 The Islamic University of Gaza
Chapter 4 Roots of Equations
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 51.
Roots of Equations Open Methods (Part 2).
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
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Martin Mendez UASLP Chapter 61 Unit II.
Systems of Non-Linear Equations
Open Methods Chapter 6 The Islamic University of Gaza
Newton's Method for Functions of Several Variables
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 8 Roots of Equations Open Methods.
Roots of Equations Open Methods Second Term 05/06.
Chapter 3 Root Finding.
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.
Chapter 4 Roots of Polynomials.
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
Newton's Method for Functions of Several Variables Joe Castle & Megan Grywalski.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 ~ Roots of Equations ~ Open Methods Chapter 6 Credit:
Lecture 6 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 7.
1 Solution of Nonlinear Equation Dr. Asaf Varol
Chapter 3 Roots of Equations. Objectives Understanding what roots problems are and where they occur in engineering and science Knowing how to determine.
Numerical Methods for Engineering MECN 3500
Newton’s Method, Root Finding with MATLAB and Excel
Today’s class Roots of equation Finish up incremental search
MECN 3500 Inter - Bayamon Lecture 6 Numerical Methods for Engineering MECN 3500 Professor: Dr. Omar E. Meza Castillo
Lecture 5 - Single Variable Problems CVEN 302 June 12, 2002.
The Islamic University of Gaza Faculty of Engineering Civil Engineering Department Numerical Analysis ECIV 3306 Chapter 7 Roots of Polynomials.
Solving Non-Linear Equations (Root Finding)
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 27.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 2 / Chapter 5.
Rearranging the equation f(x)=0 into the form x=g(x)
CHAPTER 3 NUMERICAL METHODS
Chapter 4 Quadratic Equations
Numerical Methods and Analysis
Solving Linear Equations and Inequalities
Newton’s Method for Systems of Non Linear Equations
Multiplicity of a Root First Modified Newton’s Method
Computational Methods EML3041
Part 2 Chapter 6 Roots: Open Methods
Chapter 6.
Solution of Equations by Iteration
Chapter 27.
Computers in Civil Engineering 53:081 Spring 2003
Lecture 10 Root Finding using Open Methods
4 Numerical Methods Root Finding.
ROOTS OF EQUATIONS.
Newton’s Method and Its Extensions
Chapter 6 Section 5.
Ch. 1.3 Solving Linear Equations
Some Comments on Root finding
Fixed- Point Iteration
Comp 208 Computers in Engineering Yi Lin Winter, 2007
Copyright © Cengage Learning. All rights reserved.
Part 2 Chapter 6 Roots: Open Methods
MATH 1910 Chapter 3 Section 8 Newton’s Method.
1 Newton’s Method.
Pivoting, Perturbation Analysis, Scaling and Equilibration
Presentation transcript:

Chapter 6

Open Methods Chapter 6 Figure 6.1 Open methods are based on formulas that require only a single starting value of x or two starting values that do not necessarily bracket the root.

Simple Fixed-point Iteration Rearrange the function so that x is on the left side of the equation: Bracketing methods are “convergent”. Fixed-point methods may sometime “diverge”, depending on the stating point (initial guess) and how the function behaves.

Example:

Convergence x=g(x) can be expressed as a pair of equations: y1=x Figure 6.2 x=g(x) can be expressed as a pair of equations: y1=x y2=g(x) (component equations) Plot them separately.

Conclusion Fixed-point iteration converges if When the method converges, the error is roughly proportional to or less than the error of the previous step, therefore it is called “linearly convergent.”

Newton-Raphson Method Most widely used method. Based on Taylor series expansion: Solve for Newton-Raphson formula

Fig. 6.5 A convenient method for functions whose derivatives can be evaluated analytically. It may not be convenient for functions whose derivatives cannot be evaluated analytically.

Fig. 6.6

The Secant Method A slight variation of Newton’s method for functions whose derivatives are difficult to evaluate. For these cases the derivative can be approximated by a backward finite divided difference.

Fig. 6.7 Requires two initial estimates of x , e.g, xo, x1. However, because f(x) is not required to change signs between estimates, it is not classified as a “bracketing” method. The scant method has the same properties as Newton’s method. Convergence is not guaranteed for all xo, f(x).

Fig. 6.8

Multiple Roots None of the methods deal with multiple roots efficiently, however, one way to deal with problems is as follows: This function has roots at all the same locations as the original function

Fig. 6.13

“Multiple root” corresponds to a point where a function is tangent to the x axis. Difficulties Function does not change sign at the multiple root, therefore, cannot use bracketing methods. Both f(x) and f′(x)=0, division by zero with Newton’s and Secant methods.

Systems of Linear Equations

Taylor series expansion of a function of more than one variable The root of the equation occurs at the value of x and y where ui+1 and vi+1 equal to zero.

A set of two linear equations with two unknowns that can be solved for.

Determinant of the Jacobian of the system.