Graphics Graphics Korea University kucg.korea.ac.kr 2. Solving Equations of One Variable Korea University Computer Graphics Lab. Lee Seung Ho / Shin.

Slides:



Advertisements
Similar presentations
Chapter 6: Roots: Open Methods
Advertisements

Part 2 Chapter 6 Roots: Open Methods
Numerical Solution of Nonlinear Equations
Mathematics1 Mathematics 1 Applied Informatics Štefan BEREŽNÝ.
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.
Bisection Method (Midpoint Method for Equations).
Unit-I Roots of Equation
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 7 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.
Lectures on Numerical Methods 1 Numerical Methods Charudatt Kadolkar Copyright 2000 © Charudatt Kadolkar.
The Derivative. Objectives Students will be able to Use the “Newton’s Quotient and limits” process to calculate the derivative of a function. Determine.
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
Bracketing Methods Chapter 5 The Islamic University of Gaza
Fin500J: Mathematical Foundations in Finance Topic 3: Numerical Methods for Solving Non-linear Equations Philip H. Dybvig Reference: Numerical Methods.
Numerical Analysis 1 EE, NCKU Tien-Hao Chang (Darby Chang)
Roots of Equations Chapter 3. Roots of Equations Also called “zeroes” of the equation –A value x such that f(x) = 0 Extremely important in applications.
Scientific Computing Algorithm Convergence and Root Finding Methods.
8/30/ Secant Method Major: All Engineering Majors Authors: Autar Kaw, Jai Paul
Chapter 14: Numerical Methods
Solving Non-Linear Equations (Root Finding)
Newton-Raphson Method
Numerical Methods Applications of Loops: The power of MATLAB Mathematics + Coding 1.
10/21/ Bisection Method Major: All Engineering Majors Authors: Autar Kaw, Jai Paul
1 Nonlinear Equations Jyun-Ming Chen. 2 Contents Bisection False Position Newton Quasi-Newton Inverse Interpolation Method Comparison.
Lecture 6 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
1 Solution of Nonlinear Equation Dr. Asaf Varol
Numerical Methods for Engineering MECN 3500
EE:211 Computational Techniques in Electrical Engineering Lecture#2
Numerical Methods.
CHAPTER 3 NUMERICAL METHODS
Newton’s Method, Root Finding with MATLAB and Excel
Newton-Raphson Method. Figure 1 Geometrical illustration of the Newton-Raphson method. 2.
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.
By: Kaitlyn Shelton. Solving by Graphing  F(x) = x 2 + 5x - 3 XY Create an X and Y table and graph by hand. Or you can type it in.
The Islamic University of Gaza Faculty of Engineering Civil Engineering Department Numerical Analysis ECIV 3306 Chapter 5 Bracketing Methods.
Solving Non-Linear Equations (Root Finding)
Applications of Loops: The power of MATLAB Mathematics + Coding
Solution of Nonlinear Equations Topic: Bisection method
Numerical Methods Solution of Equation.
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
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.
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.
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.
Solution of Nonlinear Equations ( Root Finding Problems ) Definitions Classification of Methods  Analytical Solutions  Graphical Methods  Numerical.
7/11/ Bisection Method Major: All Engineering Majors Authors: Autar Kaw, Jai Paul
CSE 330: Numerical Methods. Introduction The bisection and false position method require bracketing of the root by two guesses Such methods are called.
Solution of Nonlinear Equations ( Root Finding Problems )
CHAPTER 3 NUMERICAL METHODS
3.2 Rolle’s Theorem and the
Numerical Analysis Lecture 5.
Numerical Methods and Analysis
Secant Method.
MATH 2140 Numerical Methods
3.2 Rolle’s Theorem and the
Secant Method – Derivation
Numerical Analysis Lecture 7.
Computers in Civil Engineering 53:081 Spring 2003
SOLUTION OF NONLINEAR EQUATIONS
Newton-Raphson Method
Copyright © Cengage Learning. All rights reserved.
MATH 1910 Chapter 3 Section 8 Newton’s Method.
Solutions for Nonlinear Equations
Presentation transcript:

Graphics Graphics Korea University kucg.korea.ac.kr 2. Solving Equations of One Variable Korea University Computer Graphics Lab. Lee Seung Ho / Shin Seung Ho Roh Byeong Seok / Jeong So Hyeon

KUCG Graphics Korea University kucg.korea.ac.kr Contents Bisection Method Regula Falsi and Secant Method Newton’s Method Muller’s Method Fixed-Point Iteration Matlab’s Method

Graphics Graphics Korea University kucg.korea.ac.kr Bisection Method

KUCG Graphics Korea University kucg.korea.ac.kr Bisection Method

KUCG Graphics Korea University kucg.korea.ac.kr Finding the Square Root of 3 Using Bisection How can we get ?

KUCG Graphics Korea University kucg.korea.ac.kr Approximating the Floating Depth for a Cork Ball by Bisection(1/2) Cork ball Radius : 1 Density : 0.25

KUCG Graphics Korea University kucg.korea.ac.kr Approximating the Floating Depth for a Cork Ball by Bisection(2/2)

KUCG Graphics Korea University kucg.korea.ac.kr Discussion of Bisection Method

KUCG Graphics Korea University kucg.korea.ac.kr Fixed-Point Iteration Solution of equation Convergence Theorem of fixed-point iteration

KUCG Graphics Korea University kucg.korea.ac.kr Fixed-Point Iteration to Find a Zero of a Cubic Function

KUCG Graphics Korea University kucg.korea.ac.kr Matlab’s Methods(1/2) roots(p) p : vector Example EDU> r = roots(p); (p=[ ]) r =

KUCG Graphics Korea University kucg.korea.ac.kr Matlab’s Methods(2/2) fzero( ‘function name’,x0 ) function name: string x0 : initial estimate of the root Example function y = flat10(x) y = x.^10 – 0.5; z = fzero(‘flat10’,0.5) z =

Graphics Graphics Korea University kucg.korea.ac.kr Regular Falsi and Secant Methods Byungseok Roh

KUCG Graphics Korea University kucg.korea.ac.kr Regula Falsi Method The regula falsi method start with two point, (a, f(a)) and (b,f(b)), satisfying the condition that f(a)f(b)<0. The straight line through the two points (a, f(a)), (b, f(b)) is The next approximation to the zero is the value of x where the straight line through the initial points crosses the x-axis.

KUCG Graphics Korea University kucg.korea.ac.kr Regula Falsi Method (cont.) If there is a zero in the interval [a, c], we leave the value of a unchanged and set b = c. On the other hand, if there is no zero in [a, c], the zero must be in the interval [c, b]; so we set a = c and leave b unchanged. The stopping condition may test the size of y, the amount by which the approximate solution x has changed on the last iteration, or whether the process has continued too long. Typically, a combination of these conditions is used.

KUCG Graphics Korea University kucg.korea.ac.kr Example Finding the Cube Root of 2 Using Regula Falsi Since f(1)= -1, f(2)=6, we take as our starting bounds on the zero a=1 and b=2. Our first approximation to the zero is We then find the value of the function: Since f(a) and y are both negative, but y and f(b) have opposite signs

KUCG Graphics Korea University kucg.korea.ac.kr Example (cont.) Calculation of using regula falsi.

KUCG Graphics Korea University kucg.korea.ac.kr Secant Method Instead of choosing the subinterval that must contain the zero, we form the next approximation from the two most recently generated points: At the k-th stage, the new approximation to the zero is The secant method, closely related to the regula falsi method, results from a slight modification of the latter. The secant method has converged with a tolerance of.

KUCG Graphics Korea University kucg.korea.ac.kr Example Finding the Square Root of 3 by Secant Method To find a numerical approximation to, we seek the zero of. Since f(1)=-2 and f(2)=1, we take as our starting bounds on the zero and. Our first approximation to the zero is Calculation of using secant method.

Graphics Graphics Korea University kucg.korea.ac.kr NEWTON’S METHOD

KUCG Graphics Korea University kucg.korea.ac.kr Newton’s Method Newton’s method uses straight-line approximation which is the tangent to curve.. Intersection point

KUCG Graphics Korea University kucg.korea.ac.kr Example Finding Square Root of ¾ approximate the zero of using the fact that. Continuing for one more step

KUCG Graphics Korea University kucg.korea.ac.kr Finding Floating Depth for a Wooden Ball Volume of submerged segment of the Sphere To find depth at which the ball float, volume of submerged segment is time. Simplifies to

KUCG Graphics Korea University kucg.korea.ac.kr Finding Floating Depth for a Wooden Ball (cont.) To find depth a ball, density is one-third of water float. Calculation f(x) using Newton’s Method

KUCG Graphics Korea University kucg.korea.ac.kr Oscillations in Newton Method Newton’s method give Oscillatory result for some funtions & initial estimates. Ex)

Graphics Graphics Korea University kucg.korea.ac.kr Muller’s Method

KUCG Graphics Korea University kucg.korea.ac.kr Muller’s Method based on a quadratic approximation procedure 1. Decide the parabola passing through (x1,y1), (x2, y2) and (x3,y3) 2. Solve the zero(x4) that is closest to x3 3. Repeat 1,2 until x converge to predefined tolerance advantage Requires only function values; Derivative need not be calculated X can be an imaginary number.

KUCG Graphics Korea University kucg.korea.ac.kr Muller’s Method (Cont’)

KUCG Graphics Korea University kucg.korea.ac.kr Example Finding the sixth root of 2 using Muller’s method,,,

KUCG Graphics Korea University kucg.korea.ac.kr Example (Cont’) ixy e-07 converge Calculation of using Muller’s method

KUCG Graphics Korea University kucg.korea.ac.kr Another Challenging Problem stepxY e e-10 Tolerance =

KUCG Graphics Korea University kucg.korea.ac.kr MATLAB function for Muller’s Method P.65~66 code