Numerical Methods and Computational Techniques Solution of Transcendental and Polynomial Equations.

Slides:



Advertisements
Similar presentations
Numerical Methods: Finding Roots Department of Mathematics University of Leicester.
Advertisements

Part 2 Chapter 6 Roots: Open Methods
Chapter 6: Roots: Open Methods
Lecture 5 Newton-Raphson Method
Numerical Solution of Nonlinear Equations
CSE 330: Numerical Methods
Newton’s Method finds Zeros Efficiently finds Zeros of an equation: –Solves f(x)=0 Why do we care?
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.
Regula-Falsi Method. Type of Algorithm (Equation Solver) The Regula-Falsi Method (sometimes called the False Position Method) is a method used to find.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 51.
Second Term 05/061 Roots of Equations Bracketing Methods.
Open Methods (Part 1) Fixed Point Iteration & Newton-Raphson Methods
Roots of Equations Bracketing Methods.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 9 Roots of Equations Open Methods.
Notes, part 5. L’Hospital Another useful technique for computing limits is L'Hospital's rule: Basic version: If, then provided the latter exists. This.
Dr. Marco A. Arocha Aug,  “Roots” problems occur when some function f can be written in terms of one or more dependent variables x, where the.
NUMERICAL METHODS WITH C++ PROGRAMMING
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 8 Roots of Equations Open Methods.
Bracketing Methods Chapter 5 The Islamic University of Gaza
Roots of Equations Open Methods Second Term 05/06.
Fin500J: Mathematical Foundations in Finance Topic 3: Numerical Methods for Solving Non-linear Equations Philip H. Dybvig Reference: Numerical Methods.
1 5.6 Complex Zeros; Fundamental Theorem of Algebra In this section, we will study the following topics: Conjugate Pairs Theorem Finding a polynomial function.
Numerical Analysis 1 EE, NCKU Tien-Hao Chang (Darby Chang)
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 8 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
Polynomials Expressions like 3x 4 + 2x 3 – 6x and m 6 – 4m 2 +3 are called polynomials. (5x – 2)(2x+3) is also a polynomial as it can be written.
Lecture 3 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
Lecture 6 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
Page 224 Ex 2A Questions 1 to 7, 10, 12 & 13 Page 224 Ex 2A Questions 1 to 7, 10, 12 & 13.
Newton’s Method Other Recursive Methods Modified Fixed Point Method.
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
Numerical Methods.
Numerical Methods Root Finding 4. Fixed-Point Iteration---- Successive Approximation Many problems also take on the specialized form: g(x)=x, where we.
ROOTS OF EQUATIONS. Bracketing Methods The Bisection Method The False-Position Method Open Methods Simple Fixed-Point Iteration The Secant Method.
Lecture 5 - Single Variable Problems CVEN 302 June 12, 2002.
ME 142 Engineering Computation I Root Finding & Iterative Solutions.
The Islamic University of Gaza Faculty of Engineering Civil Engineering Department Numerical Analysis ECIV 3306 Chapter 5 Bracketing Methods.
Numerical Methods Solution of Equation.
Theorems About Roots of Polynomial Equations. Find all zeros: f(x)= x +x –x Synthetic Division one zero…need 2 more use (x – k), where.
4 Numerical Methods Root Finding Secant Method Modified Secant
Linearization, Newton’s Method
SOLVING NONLINEAR EQUATIONS. SECANT METHOD MATH-415 Numerical Analysis 1.
4 Numerical Methods Root Finding.
LECTURE 2 OF NUMERICAL METHODS 7.2 Solutions of Non-Linear Equations.
CSE 330: Numerical Methods. What is true error? True error is the difference between the true value (also called the exact value) and the approximate.
Lecture 4 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 2 / Chapter 5.
Numerical Analysis Lecture 5.
LECTURE 4 OF SOLUTIONS OF NON-LINEAR EQUATIONS OBJECTIVES
Numerical Methods and Analysis
HW: Worksheet Aim: What are the higher degree function and equation?
Secant Method.
HW: Worksheet Aim: What are the higher degree function and equation?
Solution of Nonlinear Equations
Some problems for your consideration
MATH 2140 Numerical Methods
Numerical Analysis Lecture 7.
Computers in Civil Engineering 53:081 Spring 2003
SOLUTION OF NONLINEAR EQUATIONS
4 Numerical Methods Root Finding.
ROOTS OF EQUATIONS.
3.8 Newton’s Method How do you find a root of the following function without a graphing calculator? This is what Newton did.
Some Comments on Root finding
Copyright © Cengage Learning. All rights reserved.
Presentation transcript:

Numerical Methods and Computational Techniques Solution of Transcendental and Polynomial Equations

Dictionary meaning of Transcendent: More than ordinary, Supernatural, Superlative Transcendental Number: A number which is not ordinary. For example : Pi (π) = … approximately Or e Hence f (x) involving e x or ln (x) are transcendental functions. Further Sin (x) = Cos (x) = Hence f (x) involving sin (x), cos (x) etc are also transcendental functions.

Root of transcendental or polynomial function is the value of x for which f (x) = 0 In graphical form it is point of intersection of graph of f (x) with X – axis. f (x) roots

Numerical Methods to determine the roots: 1.Birge – Vieta Method 2.Bairstow Method 3.Bisection Method 4.False Position Method 5.Simple Fixed Point Iteration Method 6.Newton Raphson (Tangent) Method 7.Secant Method

b 1 =a 1 +p 0 b 0 1.Birge – Vieta Method: Used for finding roots of polynomial functions. Uses “synthetic division” of polynomial to extract factor of the given polynomial in the form of (x – p). Problem: Find roots of f (x) = 2x³ – 5x + 1 using Birge – Vieta Method. Solution: Assume that x = 1 is root of the equation. Hence initial approximation of the solution is p 0 = 1. Synthetic Division will be performed as below: Let f (x) = a 0 x 3 + a 1 x 2 + a 2 x + a 3 p0p0 a0a0 a1a1 a2a2 a3a3 b0b0 b1b1 b2b2 b3b3 c0c0 c1c1 c2c2 c3c3 p0b0p0b0 p1b1p1b1 p2b2p2b2 p0p0 s i m i l a r l y p 1 = p 0 – b 3 /c 2 Repeat synthetic division using p 1

Iteration No. 1: Iteration No. 2: p 1 = p 0 – b 3 /c 2 = 1 – (-2)/1 = 3 Not required p 2 = p 1 – b 3 /c 2 = 3 – 40/49 =

Iteration No. 3: Iteration No. 4: p 3 = p 2 – b 3 /c 2 = – / = p 4 = p 3 – b 3 /c 2 = – / =

Iteration No. 5: Iteration No. 6: p 5 = p 4 – b 3 /c 2 = – / = p 6 = p 5 – b 3 /c 2 = – / =

Click here to download Excel sheet for performing synthetic division and find p n.here Thus one of the roots of given f (x) is x = To verify: f ( ) = 2* – 5* = ≈ ≈ Performing further division by x = , we get the deflated polynomial as; Therefore f (x) = (2x x – ) * (x – ) If (2x x – ) = 0 then x = or x = To verify: f (0.2008) = ≈ 0 and f ( ) = ≈ 0 Thus f (x) has three roots as x = , x = and x =

3. Bisection Method: Used for finding roots of polynomial functions or transcendental functions. Uses two guess points which are on either sides of the root. Problem: Find roots of f (x) = 2.5x³ – 17x² + 22x + 11 using Bisection Method. Solution: Let x a = 2 and x b = 4 so that f(x a ) * f(x b ) is negative. Hence the required root lies between the initial two guesses. Now x r = (x a + x b ) / 2If f(x r )*f(x a ) is negative then x b =x r else x a =x r R e p e a t Graphically: xaxa xbxb xrxr xbxb xrxr

Iterationxaxa xbxb XrXr Hence x = is root of the equation. f( ) = ≈ 0

4. False Position Method: Used for finding roots of polynomial functions or transcendental functions. Uses two guess points which are on either sides of the root. Normally, Faster than Bisection Method. Problem: Find roots of f (x) = 3x³ – 20x² + 25x + 15 using False Position Method. Solution: Let x a = 3 and x b = 6 so that f(x a ) * f(x b ) is negative. Hence the required root lies between the initial two guesses. If f(x r )*f(x a ) is negative then x b =x r else x a =x r R e p e a t Graphically: xaxa xbxb xrxr xbxb xrxr

Iterationxaxa xbxb xrxr Hence x = is root of the equation. f( ) = ******* ≈ 0