EE:211 Computational Techniques in Electrical Engineering Lecture#2

Slides:



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

Numerical Computation Lecture 4: Root Finding Methods - II United International College.
Numerical Solution of Nonlinear Equations
Dr. Mubashir Alam King Saud University. Course Information Course Instructors: Dr. Mubashir Alam Contact Information: Office: 2C-98 Phone:
Nonlinear Equations Your nonlinearity confuses me “The problem of not knowing what we missed is that we believe we haven't missed anything” – Stephen Chew.
Dr. Jie Zou PHY Chapter 2 Solution of Nonlinear Equations: Lecture (III)
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.
Curve Fitting and Interpolation: Lecture (II)
NUMERICAL METHODS WITH C++ PROGRAMMING
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 8 Roots of Equations Open Methods.
FP1: Chapter 2 Numerical Solutions of Equations
Fin500J: Mathematical Foundations in Finance Topic 3: Numerical Methods for Solving Non-linear Equations Philip H. Dybvig Reference: Numerical Methods.
Chapter 3 Root Finding.
Numerical Analysis 1 EE, NCKU Tien-Hao Chang (Darby Chang)
Theorems on continuous functions. Weierstrass’ theorem Let f(x) be a continuous function over a closed bounded interval [a,b] Then f(x) has at least one.
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.
Dr. Mubashir Alam King Saud University. Outline Numerical Integration Trapezoidal and Simpson’s Rules (5.1)
Curve Fitting and Interpolation: Lecture (I)
Lecture 6 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
Graphics Graphics Korea University kucg.korea.ac.kr 2. Solving Equations of One Variable Korea University Computer Graphics Lab. Lee Seung Ho / Shin.
Numerical Methods for Engineering MECN 3500
Numerical Methods.
CHAPTER 3 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.
Newton’s Method, Root Finding with MATLAB and Excel
Lecture 5 - Single Variable Problems CVEN 302 June 12, 2002.
Notes Over 2.1 Graphing a Linear Equation Graph the equation.
Numerical Methods Solution of Equation.
Lecture 11 Rootfinding – Newton’s and secant methods 1 Lecture 11  More root finding methods  Newton’s method  Very fast way to find roots  Requires.
Today’s class Numerical differentiation Roots of equation Bracketing methods Numerical Methods, Lecture 4 1 Prof. Jinbo Bi CSE, UConn.
4 Numerical Methods Root Finding Secant Method Modified Secant
SOLVING NONLINEAR EQUATIONS. SECANT METHOD MATH-415 Numerical Analysis 1.
Ms. Battaglia AP Calculus. Estimate y(4) with a step size h=1, where y(x) is the solution to the initial value problem: y’ – y = 0 ; y(0) = 1.
4 Numerical Methods Root Finding.
Root Finding UC Berkeley Fall 2004, E77 Copyright 2005, Andy Packard. This work is licensed under the Creative.
Chapter 2 Review Equations of Lines
Unit 2 Calculating Derivatives From first principles!
Local Linear Approximation Objective: To estimate values using a local linear approximation.
Dr. Mubashir Alam King Saud University. Outline Ordinary Differential Equations (ODE) ODE: An Introduction (8.1) ODE Solution: Euler’s Method (8.2) ODE.
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.
Finding zeros (also called roots) of a function Overview: Define the problem Methods of solution Graphical Newton’s Bisection Secant.
6/13/ Secant Method Computer Engineering Majors Authors: Autar Kaw, Jai Paul
 The equation with one variable. At P(atm) equals 0.5 atm, What is T ? ? ?
MATH342: Numerical Analysis Sunjae Kim.
CSE 330: Numerical Methods. Introduction The bisection and false position method require bracketing of the root by two guesses Such methods are called.
Calculating Derivatives From first principles!. 2.1 The Derivative as a Limit See the gsp demo demodemo Let P be any point on the graph of the function.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 2 / Chapter 5.
Linear Functions January 11, 2017.
Tangent Lines (Sections 2.1 and 3.1 )
Solution of Nonlinear Equations (Root finding Problems
Newton’s Method for Systems of Non Linear Equations
LECTURE 3 OF SOLUTIONS OF NON -LINEAR EQUATIONS.
Derivatives by Definition
Secant Method – Derivation
Chapter 1: False-Position Method of Solving a Nonlinear Equation
Computers in Civil Engineering 53:081 Spring 2003
Roots of equations Class IX.
Sec 3.10: Linear approximation and Differentials
MATH 175: Numerical Analysis II
SOLUTION OF NONLINEAR EQUATIONS
Section 2.7.
4 Numerical Methods Root Finding.
3.8 Newton’s Method How do you find a root of the following function without a graphing calculator? This is what Newton did.
Newton’s Method and Its Extensions
Assignment 1: due 1/17/19 Estimate all of the zero of x3-x2-2x+1 graphically. Write a MatLab code for Newton’s method. Use your code to refine the graphical.
CPE 332 Computer Engineering Mathematics II
Slope Fields (6.1) January 10th, 2017.
WARM UP Find the equation of the line that passes through (3, 4), (6,8)? Find the slope of the line that passes through (-4,-8), (12,16)? Find the equation.
Chapter 4 Review.
Presentation transcript:

EE:211 Computational Techniques in Electrical Engineering Lecture#2 Dr. Mubashir Alam King Saud University

Outline Chapter#3 Rootfinding Bisection Method Newton's Algorithm Secant Method

Introduction

The Bisection Method

Example: 3.1.1

Error Bounds α is the true root and cn is its estimate Error: |α-cn|

Newton’s Algorithm

If x1 is the root of p(x) then p(x1)=0 Repeat the next with x1 as the initial estimate and determine x2 And so on

Newton’s Method

Example: 3.2.1

Stopping criteria

Example n xn f(xn) xn-xn-1 1.5 8.890625 ------------------ 1 1.5 8.890625 ------------------ 1 1.30049088 2.537264 -0.199950912 2 1.18148042 0.53845863 -0.11901046 3 1.13945559 0.04923525 -0.042025 4 1.13477763 5.50373 x 10-3 -4.678 x 10-3 Stopping criteria, ε = 1 x 10-2

Example: 3.2.1

Example: 3.2.2

Secant Method From this perspective, other straight-line approximation to y=f(x) would also lead to methods for approximating a root of f(x). One such straight-line approximation leads to SECANT METHOD

The two pints (x0,f(x0)) and (x1,f(x1)) , on the graph of y=f(x), determine a straight line , called a secant line. This line is an approximation to the graph of y=f(x), and its root x2 is an approximation to true root α.

Equation of lines Equation of line with slope = m and passing through a point (x1,y1): y-y1 = m(x-x1) y = y1+ m(x-x1) Slope of the line between points (x1,y1) and (x2,y2) Slope = m = (y2- y1) / (x2- x1)

Secant Method Find the equation of the line and then its root x2 Having found x2, we can drop x0, and use x1,x2 as a new set of approximate values for α. This will lead to an improved value x3. Continue this process …..

Secant Method General Formula: Two point method, since two approximate values are needed to obtain the next improved value.

Example: 3.3.1

Matlab Function: fzero This function uses ideas involved in the bisection and the secant method. Use: root=fzero(f_name, [a,b]) Produces a root within [a,b], assume f(a)f(b) <= 0 Use: root=fzero(f_name, xo) Find a root near x0.

Matlab Function: fzero Define function for: f(x)=x6-x-1 function f = myfun(x) f = x.^6-x-1; x=fzero(@myfun,[1,2]) x=1.134724138401519 x=fzero(@myfun,1.9)