Determining the Roots of Non-Linear Equations Part I
|
|
- Anastasia Lester
- 6 years ago
- Views:
Transcription
1 Determining the Roots of Non-Linear Equations Part I Prof. Dr. Florian Rupp German University of Technology in Oman (GUtech) Introduction to Numerical Methods for ENG & CS (Mathematics IV) Spring Term 2016
2 Exercise Session
3 Reviewing the highlights from last time (1/ 2) Computer Exercise Computer exercise Use MATLAB s function parabolic to solve the heat equation heat equation u t (t,x,y) = u(t,x,y) on a square geometry 1 x,y 1 with discontinuous initial data u(0,x,y) = 1 on the disk x 2 +y 2 < 0.42, and u(0,x,y) = 0 otherwise as well as zero Dirichlet boundary conditions. Plot the solution at times 0,0.1,20. [p,e,t] = initmesh( squareg ); [p,e,t] = refinemesh( squareg,p,e,t); u0 = zeros(size(p,2),1); ix = find(sqrt(p(1,:). 2+p(2,:). 2)<0.4); u0(ix) = ones(size(ix)); tlist = linspace(0,0.1,20); u1 = parabolic(u0,tlist, squareb1,p,e,t,1,0,0,1); Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 3 / 44
4 Reviewing the highlights from last time (2/ 2) Reviewing the highlights from last time 1D Schrödinger Equation The 1D time dependent Schödinger Equation basically reads as iu t (t,z) = k u(t,z)+v(z) u(t,z). Give its FTCS approximation. 1D Finite Difference Approximation Use Taylor approximation to determine a 1D finite difference approximation of the derivative u(x) u x (x). Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 4 / 44
5 Introduction & Todays Scope
6 The Catenary The catenary models an idealized hanging chain or cable that is subject to its own weight when supported only at its ends. The catenary is described by ( x y(x) = a cosh, a) where the parameter a depends on the chain s or cable s material properties. Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 6 / 44
7 Determining the parameter a Assume, you we are interested in the material parameter a for a hanging cable between two supporting points that are 100 m apart from each other. By experiments we know that in this situation the maximal displacement is 10 m, as sketched on the previous slide. Plugged into the catenary equation we have ( ) 50 y(50) = a cosh = y(0)+10 = a+10, a such that we obtain a as a root of the non-linear function ( ) 50 g(a) = a cosh a 10. a Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 7 / 44
8 Determining the roots and the intermediate value theorem Determining the roots of a continuous nonlinear scalar function is actually an application of the intermediate value theorem: Intermediate Value Theorem Let f : [a,b] R be a real-valued continuous function on the interval [a,b], and y 0 is a number between f(a) and f(b), then there is a x 0 [a,b] such that f(x 0 ) = y 0. f(b) > 0 a f(x 0 ) = 0 b f(a) < 0 Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 8 / 44
9 Today, we will focus on algorithms for root determination Today s topics: Bisection method & regula falsi Convergence analysis of the bisection method Newton s method Corresponding textbook chapters: 3.1 and 3.2 Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 9 / 44
10 The Bisection Method
11 The key idea of the bisection method for root determination (1/ 3) f(b) > 0 a f(c) < 0 c b f(a) < 0 At each step we have an interval [a,b] and the values f(a) =: u and f(b) =: v such that uv < 0. I.e., at most one root lies in [a,b]. Next, we construct the midpoint c = 1 2 (a+b) of the interval [a,b] and compute f(c) = w. If w = 0 we have already found a root and the algorithm terminates. Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 11 / 44
12 The key idea of the bisection method for root determination (2/ 3) f(b) > 0 a f(c) < 0 c b f(a) < 0 If w 0 we compute wu and wv, and either wu < 0 (i.e. wv > 0) or wu > 0 (i.e. wv < 0). if wu < 0, a root lies in [a,c] and we define b := c and start again. if wu > 0, a root lies in [c,b] and we define a := c and start again. Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 12 / 44
13 The key idea of the bisection method for root determination (3/ 3) f(b) > 0 a b f(a) < 0 The algorithm terminates if the correct position of the root is found on one the halving points, or if the interval is sufficiently small, e.g. b a < In this case we take 1 2 (a+b) as the best approximation of the root. Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 13 / 44
14 An illustrative example: f(x) = x 3 2sin(x) on [0.5,2] Some computer results with the iterative steps of the bisection method for f(x) = x 3 2sin(x) on [0.5,2]: n c n f(c n ) error From these data we see, that the convergence towards the real solution seems to be rather slow for this example. How fast is the bisection method in general? Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 14 / 44
15 The convergence analysis of the bisection method (1/ 2)... (b 0 - a 0 )/2 r - c 0 a 0 r c 0 b0 Suppose, f is a continuous function that takes values of opposite sign at the ends of an interval [a 0,b 0 ]. Then there is a root r in [a 0,b 0 ] by the intermediate value theorem If we use the midpoint c 0 := 1 2 (a 0 +b 0 ) as our estimate of r, we have r c (b 0 a 0 ). Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 15 / 44
16 The convergence analysis of the bisection method (2/ 2)... (b 0 - a 0 )/2 r - c 0 a 0 r c 0 b0 Continuing to apply the bisection algorithm and denoting the computed quantities by a 0,b 0,c 0,a 1,b 1,c 1 etc., then by the same reasoning: r c n 1 2 (b n a n ) (for all n 0). Since the widths of the intervals are divided by 2 in each step, we conclude that r c n b 0 a 0 2 n+1. Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 16 / 44
17 ... leads to the following theorem Theorem (Convergence of the Bisection Method) If the bisection method is applied to a continuous function f : [a,b] R, where f(a)f(b) < 0, then after n steps, an approximate root will have been computed with error at most (b a)/2 n+1. If an error tolerance has been prescribed in advance, it is possible to determine the number n of steps required in the bisection method upfront. Suppose that we want ε > r c n = b a 2 n+1, then we can determine n by taking logarithms (with any convenient base): n > log(b a) log(2ε) log(2). Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 17 / 44
18 Applying the convergence theorem for the bisection method Example How many steps of the bisection algorithm are needed to compute a root of f to full machine single precision on a 32-bit word length computer if a = 16 and b = 17 (as well as f(a)f(b) < 0). The root is between the two binary numbers a = ( ) 2 and b = ( ) 2. Thus, we already know 5 of the binary digits in the answer. Since we can use only 24 bits altogether, that leaves 19 bits to determine. We want the last bit to be correct, so we want the error r c n to be less than ε = 2 19 or ε = 2 20 (to be conservative), i.e > r c n = b a 2 n+1 = 1 2 n+1 = 2 (n+1). Taking reciprocals gives 2 n+1 > 2 20, or n 20. Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 18 / 44
19 Introducing linear speed of convergence Definition (Linear Speed of Convergence) A sequence {x n } n N exhibits linear (speed of) convergence to a limit x, if there is a constant C [0,1) such that x n+1 x C x n x (for all n 1). If this inequality holds for all n N, then x n+1 x C x n x C 2 x n 1 x... C n x 1 x, and thus it is a consequence of linear (speed of) convergence that the following holds x n+1 x AC n (0 C < 1), for some finite number A > 0. Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 19 / 44
20 Linear convergence as upper bound for the bisection method Due to the convergence inequality ε > c n+1 r = b a 2 n+2, we see, that the bisection sequence of root estimates {c n } n N fulfills x n+1 x AC n (0 C < 1), (with equality) for A := 1 4 (b a) and C := 1 2 [0,1). Though, {c n } n N need not obey the defining inequality x n+1 x C x n x (for all n 1). of linear convergence. Thus, we can only say that the bisection method has at most linear speed of convergence. Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 20 / 44
21 Why may the bisection method not have linear speed of convergence? Classroom Problem Find an easy example such that the bisection sequence {c n } n N violates the linear speed inequality c n+1 r C c n r (for all n 1). Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 21 / 44
22 Some remarks about the bisection method The bisection method is the simplest way to solve a non-linear equation f(x) = 0 for x. It arrives at the root by constraining the interval in which the root lies, and it eventually makes the interval quite small. The bisection method halves the width of the interval at each step. This allows an exact prediction on how long it takes to find the root within any desired degree of accuracy. Root finding by the bisection method thus uses the same idea as the binary search method taught in data structures. In the bisection method, not every guess is closer to the root than the previous guess, because the bisection method does not use the nature of the function f. Often the bisection method is used to get close to one root before switching to a faster method. Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 22 / 44
23 The Regula Falsi
24 The key idea of the regula falsi (1/ 4) The bisection method does not use any information of the function itself (besides some evaluations of the function). The so called regula falsi (or false position method) is an example showing how to easily include additional information to an algorithm (here the bisection method) in order to build a better one. The key idea of the regula falsi is to use the point where the secant line between f(a) and f(b) intersects the x-axis rather than the midpoint of each interval. I.e., the new estimate c for the root is determined as ( c = b f(b) = af(b) bf(a) f(b) f(a). a b f(a) f(b) ) ( = a f(a) b a f(b) f(a) This still retains the main feature of the bisection method, namely to trap a root in a sequence of intervals of decreasing size. ) Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 24 / 44
25 The key idea of the regula falsi (2/ 4) Illustration of the update mechanism of the regula falsi (initial step): secant line f(b) > 0 a c b f(c) < 0 f(a) < 0 Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 25 / 44
26 The key idea of the regula falsi (3/ 4) Illustration of the update mechanism of the regula falsi (1st step): secant line f(b) > 0 a c b f(c) < 0 f(a) < 0 Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 26 / 44
27 The key idea of the regula falsi (4/ 4) Illustration of the update mechanism of the regula falsi (2nd step): secant line f(b) > 0 a b f(a) < 0 Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 27 / 44
28 Does the regula falsi really increase the bisection method s speed? For some functions, the regula falsi may repeatedly select the same endpoint (like in our example), and the whole process may degrade to linear convergence. This is always the case if f(x) is convex or concave in a subdivision interval [a k,b k ], i.e., if f (x) has the same sign in that whole interval. Here, one of the interval boundaries than stays the same for all consecutive times, whereas the other converges linearly towards the root. Theorem (Super-Linear Convergence Using the Regula Falsi) The bisection method with a variant of the regula falsi has super-linear convergence towards the root, as long as f is not strictly convex or strictly concave in one of the subdivision intervals (i.e., as long as it is provided that the second derivative has a sign change in any subdivision interval). We will see that later. Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 28 / 44
29 Modification of the regula falsi (1/ 3) For example, when the same endpoint is to be retained twice, a modified regula falsi may use a n f(b n ) b n f(a n ) if f(a n )f(b n ) < 0 f(b n ) f(a n ) c n := 2a n f(b n ) b n f(a n ) if f(a n )f(b n ) > 0 2f(b n ) f(a n ) So rather than selecting points on the same side of the root as the normal regula falsi this modified method changes the slope of the straight line. This produces estimates for the root that are closer to it than those obtained by the normal regula falsi method. Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 29 / 44
30 Modification of the regula falsi (2/ 3) Illustration of the modified regula falsi (normal initial step): secant line f(b) > 0 a c b f(c) < 0 f(a) < 0 Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 30 / 44
31 Modification of the regula falsi (3/ 3) Illustration of the modified regula falsi (modified 1st step): secant line f(b) > f(b) a c b f(a) < 0 Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 31 / 44
32 Newton s method
33 The key idea of Newton s method (1/ 2) In Newton s method, it is assumed that the function f is differentiable. This implies that the graph of f has a definite slope at each point and hence an unique tangent line. At a certain point (x 0,f(x 0 )) on the graph of f the tangent is a rather good approximation of the function in the vicinity of that point. Analytically, this means that the linear function l(x) = f (x 0 )(x x 0 )+f(x 0 ) is close to the given function f near x 0 ; at x 0 the two functions f and l agree. In Newton s method, we take the zero of the linear approximation l as an approximation of the root of the non-linear function f. This zero is easily found: x 1 = x 0 f(x 0) f (x 0 ). Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 33 / 44
34 The key idea of Newton s method (2/ 2) Thus, starting at a point x 0, we pass to a new point x 1 obtained from the preceding formula. Naturally, this procedure can be repeated (iterated) to produce a sequence of points: x 2 = x 1 f(x 1) f (x 1 ), x 3 = x 2 f(x 2) f (x 2 ), and so on. Under favorable conditions, the sequence of points approaches a root of f. Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 34 / 44
35 Illustration of Newton s method (1/ 4) Starting at the local minimum (a, f(a)) is an unfavorable condition: a b tangent line Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 35 / 44
36 Illustration of Newton s method (2/ 4) Perturbing the initial point gives a better starting step towards the root,... tangent line x 0 x 1 a b Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 36 / 44
37 Illustration of Newton s method (3/ 4)... but still in this case it leads to an unfavorable situation: tangent line x 2 x 0 x 1 a b tangent line Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 37 / 44
38 Illustration of Newton s method (4/ 4) Classroom Problem Find one or more starting points for Newton s method that lead to convergence towards the root in [a,b]. a b Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 38 / 44
39 Illustration of Newton s method with another function Classroom Problem Apply Newton s method graphically to the function f(x) = x 3 x + 1 with x 0 = 1. Compute the Newton iteration points x 1 and x 2 analytically, using the Newton update formula x n+1 = x n f(x n) f (x n ). Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 39 / 44
40 Summary & Outlook
41 Major concepts covered today (1/ 3): the bisection method For finding a root r of a given continuous function f in an interval [a,b], n steps of the bisection method produce a sequence of intervals [a,b] = [a 0,b 0 ],[a 1,b 1 ],[a 2,b 2 ],...,[a n,b n ], each containing the desired root of the function. The mid-points c 0,c 1,c 2,...,c n of these intervals form a sequence of approximations to the root, namely, c k = 1 2 (a i+b i ). On each interval [a k,b k ], the error e k := r c k obeys the inequality e k 1 2 (b i a i ) and after n steps we have e n 1 2 n+1 (b 0 a 0 ) For an error tolerance ε such that e n < ε, n steps are needed, where n satisfies the inequality n > log(b a) log(2ε) log(2). Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 41 / 44
42 Major concepts covered today (2/ 3): regula falsi For the k-th step of the regula falsi over the interval [a k,b k ], let c k := a kf(b k ) b k f(a k ) f(b k ) f(a k ). If f(a k )f(c k ) > 0, set a k+1 = c k and b k+1 = b k ; otherwise, set a k+1 = a k and b k+1 = c k. A modification of the regula fasli can be obtained by changing the slope of the secant, e.g., via using the update formula a k f(b k ) b k f(a k ) if f(a k )f(b k ) < 0 f(b k ) f(a k ) c k := 2a k f(b k ) b k f(a k ) if f(a k )f(b k ) > 0 2f(b k ) f(a k ) Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 42 / 44
43 Major concepts covered today (3/ 3): Newton s method For finding a root of a continuously differentiable function f, Newton s method is given by x n+1 = x n f(x n) f (x n ) (n 0). It requires a given initial value x 0 and two function evaluation (for f and f ) at each step. Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 43 / 44
44 Preparation for the next lecture Please, prepare these short exercises for the next lecture: 1. Page 123, exercise 1 Find where the graphs of y = 3x and y = exp(x) intersect by finding solutions of exp(x) 3x = 0 correct to four decimal digits with the bisection method. 2. Page 123, exercise 1 (reformulated) Find where the graphs of y = 3x and y = exp(x) intersect by finding solutions of exp(x) 3x = 0 correct to four decimal digits with Newton s method. 3. Computer exercise Write a MATLAB program that solves exp(x) 3x = 0 with Newton s method and plot the resulting error over the number of iterations (convergence plot). Prof. Dr. Florian Rupp GUtech 2016: Numerical Methods 44 / 44
SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS BISECTION METHOD
BISECTION METHOD If a function f(x) is continuous between a and b, and f(a) and f(b) are of opposite signs, then there exists at least one root between a and b. It is shown graphically as, Let f a be negative
More informationPolynomial Interpolation Part II
Polynomial Interpolation Part II Prof. Dr. Florian Rupp German University of Technology in Oman (GUtech) Introduction to Numerical Methods for ENG & CS (Mathematics IV) Spring Term 2016 Exercise Session
More informationSolution of Nonlinear Equations
Solution of Nonlinear Equations (Com S 477/577 Notes) Yan-Bin Jia Sep 14, 017 One of the most frequently occurring problems in scientific work is to find the roots of equations of the form f(x) = 0. (1)
More informationSolving Non-Linear Equations (Root Finding)
Solving Non-Linear Equations (Root Finding) Root finding Methods What are root finding methods? Methods for determining a solution of an equation. Essentially finding a root of a function, that is, a zero
More informationNumerical Methods Dr. Sanjeev Kumar Department of Mathematics Indian Institute of Technology Roorkee Lecture No 7 Regula Falsi and Secant Methods
Numerical Methods Dr. Sanjeev Kumar Department of Mathematics Indian Institute of Technology Roorkee Lecture No 7 Regula Falsi and Secant Methods So welcome to the next lecture of the 2 nd unit of this
More informationRoot Finding: Close Methods. Bisection and False Position Dr. Marco A. Arocha Aug, 2014
Root Finding: Close Methods Bisection and False Position Dr. Marco A. Arocha Aug, 2014 1 Roots Given function f(x), we seek x values for which f(x)=0 Solution x is the root of the equation or zero of the
More informationOutline. Math Numerical Analysis. Intermediate Value Theorem. Lecture Notes Zeros and Roots. Joseph M. Mahaffy,
Outline Math 541 - Numerical Analysis Lecture Notes Zeros and Roots Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research
More informationPART I Lecture Notes on Numerical Solution of Root Finding Problems MATH 435
PART I Lecture Notes on Numerical Solution of Root Finding Problems MATH 435 Professor Biswa Nath Datta Department of Mathematical Sciences Northern Illinois University DeKalb, IL. 60115 USA E mail: dattab@math.niu.edu
More informationBisection and False Position Dr. Marco A. Arocha Aug, 2014
Bisection and False Position Dr. Marco A. Arocha Aug, 2014 1 Given function f, we seek x values for which f(x)=0 Solution x is the root of the equation or zero of the function f Problem is known as root
More informationChapter 3: Root Finding. September 26, 2005
Chapter 3: Root Finding September 26, 2005 Outline 1 Root Finding 2 3.1 The Bisection Method 3 3.2 Newton s Method: Derivation and Examples 4 3.3 How To Stop Newton s Method 5 3.4 Application: Division
More informationPractical Numerical Analysis: Sheet 3 Solutions
Practical Numerical Analysis: Sheet 3 Solutions 1. We need to compute the roots of the function defined by f(x) = sin(x) + sin(x 2 ) on the interval [0, 3] using different numerical methods. First we consider
More informationCHAPTER-II ROOTS OF EQUATIONS
CHAPTER-II ROOTS OF EQUATIONS 2.1 Introduction The roots or zeros of equations can be simply defined as the values of x that makes f(x) =0. There are many ways to solve for roots of equations. For some
More informationMath Numerical Analysis
Math 541 - Numerical Analysis Lecture Notes Zeros and Roots Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research Center
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 5 Nonlinear Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction
More information15 Nonlinear Equations and Zero-Finders
15 Nonlinear Equations and Zero-Finders This lecture describes several methods for the solution of nonlinear equations. In particular, we will discuss the computation of zeros of nonlinear functions f(x).
More informationA Review of Bracketing Methods for Finding Zeros of Nonlinear Functions
Applied Mathematical Sciences, Vol 1, 018, no 3, 137-146 HIKARI Ltd, wwwm-hikaricom https://doiorg/101988/ams018811 A Review of Bracketing Methods for Finding Zeros of Nonlinear Functions Somkid Intep
More informationNonlinear Equations. Chapter The Bisection Method
Chapter 6 Nonlinear Equations Given a nonlinear function f(), a value r such that f(r) = 0, is called a root or a zero of f() For eample, for f() = e 016064, Fig?? gives the set of points satisfying y
More informationLecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 5. Nonlinear Equations
Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T Heath Chapter 5 Nonlinear Equations Copyright c 2001 Reproduction permitted only for noncommercial, educational
More informationQueens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane.
Queens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane c Sateesh R. Mane 2018 3 Lecture 3 3.1 General remarks March 4, 2018 This
More informationSolution of Algebric & Transcendental Equations
Page15 Solution of Algebric & Transcendental Equations Contents: o Introduction o Evaluation of Polynomials by Horner s Method o Methods of solving non linear equations o Bracketing Methods o Bisection
More informationCS 450 Numerical Analysis. Chapter 5: Nonlinear Equations
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationRoot Finding (and Optimisation)
Root Finding (and Optimisation) M.Sc. in Mathematical Modelling & Scientific Computing, Practical Numerical Analysis Michaelmas Term 2018, Lecture 4 Root Finding The idea of root finding is simple we want
More informationNUMERICAL AND STATISTICAL COMPUTING (MCA-202-CR)
NUMERICAL AND STATISTICAL COMPUTING (MCA-202-CR) Autumn Session UNIT 1 Numerical analysis is the study of algorithms that uses, creates and implements algorithms for obtaining numerical solutions to problems
More informationROOT FINDING REVIEW MICHELLE FENG
ROOT FINDING REVIEW MICHELLE FENG 1.1. Bisection Method. 1. Root Finding Methods (1) Very naive approach based on the Intermediate Value Theorem (2) You need to be looking in an interval with only one
More informationNumerical Analysis: Solving Nonlinear Equations
Numerical Analysis: Solving Nonlinear Equations Mirko Navara http://cmp.felk.cvut.cz/ navara/ Center for Machine Perception, Department of Cybernetics, FEE, CTU Karlovo náměstí, building G, office 104a
More informationChapter 1. Root Finding Methods. 1.1 Bisection method
Chapter 1 Root Finding Methods We begin by considering numerical solutions to the problem f(x) = 0 (1.1) Although the problem above is simple to state it is not always easy to solve analytically. This
More information3.1 Introduction. Solve non-linear real equation f(x) = 0 for real root or zero x. E.g. x x 1.5 =0, tan x x =0.
3.1 Introduction Solve non-linear real equation f(x) = 0 for real root or zero x. E.g. x 3 +1.5x 1.5 =0, tan x x =0. Practical existence test for roots: by intermediate value theorem, f C[a, b] & f(a)f(b)
More informationOutline. Scientific Computing: An Introductory Survey. Nonlinear Equations. Nonlinear Equations. Examples: Nonlinear Equations
Methods for Systems of Methods for Systems of Outline Scientific Computing: An Introductory Survey Chapter 5 1 Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign
More informationINTRODUCTION TO NUMERICAL ANALYSIS
INTRODUCTION TO NUMERICAL ANALYSIS Cho, Hyoung Kyu Department of Nuclear Engineering Seoul National University 3. SOLVING NONLINEAR EQUATIONS 3.1 Background 3.2 Estimation of errors in numerical solutions
More informationNumerical Methods. Root Finding
Numerical Methods Solving Non Linear 1-Dimensional Equations Root Finding Given a real valued function f of one variable (say ), the idea is to find an such that: f() 0 1 Root Finding Eamples Find real
More informationRoots of Equations. ITCS 4133/5133: Introduction to Numerical Methods 1 Roots of Equations
Roots of Equations Direct Search, Bisection Methods Regula Falsi, Secant Methods Newton-Raphson Method Zeros of Polynomials (Horner s, Muller s methods) EigenValue Analysis ITCS 4133/5133: Introduction
More informationChapter 6. Nonlinear Equations. 6.1 The Problem of Nonlinear Root-finding. 6.2 Rate of Convergence
Chapter 6 Nonlinear Equations 6. The Problem of Nonlinear Root-finding In this module we consider the problem of using numerical techniques to find the roots of nonlinear equations, f () =. Initially we
More informationChapter 4. Solution of Non-linear Equation. Module No. 1. Newton s Method to Solve Transcendental Equation
Numerical Analysis by Dr. Anita Pal Assistant Professor Department of Mathematics National Institute of Technology Durgapur Durgapur-713209 email: anita.buie@gmail.com 1 . Chapter 4 Solution of Non-linear
More informationMATH 3795 Lecture 12. Numerical Solution of Nonlinear Equations.
MATH 3795 Lecture 12. Numerical Solution of Nonlinear Equations. Dmitriy Leykekhman Fall 2008 Goals Learn about different methods for the solution of f(x) = 0, their advantages and disadvantages. Convergence
More informationLecture 8: Optimization
Lecture 8: Optimization This lecture describes methods for the optimization of a real-valued function f(x) on a bounded real interval [a, b]. We will describe methods for determining the maximum of f(x)
More information1. Method 1: bisection. The bisection methods starts from two points a 0 and b 0 such that
Chapter 4 Nonlinear equations 4.1 Root finding Consider the problem of solving any nonlinear relation g(x) = h(x) in the real variable x. We rephrase this problem as one of finding the zero (root) of a
More informationChapter 2 Solutions of Equations of One Variable
Chapter 2 Solutions of Equations of One Variable 2.1 Bisection Method In this chapter we consider one of the most basic problems of numerical approximation, the root-finding problem. This process involves
More informationNumerical Methods in Informatics
Numerical Methods in Informatics Lecture 2, 30.09.2016: Nonlinear Equations in One Variable http://www.math.uzh.ch/binf4232 Tulin Kaman Institute of Mathematics, University of Zurich E-mail: tulin.kaman@math.uzh.ch
More informationAnnouncements. Topics: Homework: - sections , 6.1 (extreme values) * Read these sections and study solved examples in your textbook!
Announcements Topics: - sections 5.2 5.7, 6.1 (extreme values) * Read these sections and study solved examples in your textbook! Homework: - review lecture notes thoroughly - work on practice problems
More informationNumerical mathematics with GeoGebra in high school
Herceg 2009/2/18 23:36 page 363 #1 6/2 (2008), 363 378 tmcs@inf.unideb.hu http://tmcs.math.klte.hu Numerical mathematics with GeoGebra in high school Dragoslav Herceg and Ðorđe Herceg Abstract. We have
More informationToday s class. Numerical differentiation Roots of equation Bracketing methods. Numerical Methods, Fall 2011 Lecture 4. Prof. Jinbo Bi CSE, UConn
Today s class Numerical differentiation Roots of equation Bracketing methods 1 Numerical Differentiation Finite divided difference First forward difference First backward difference Lecture 3 2 Numerical
More informationScientific Computing. Roots of Equations
ECE257 Numerical Methods and Scientific Computing Roots of Equations Today s s class: Roots of Equations Bracketing Methods Roots of Equations Given a function f(x), the roots are those values of x that
More informationFigure 1: Graph of y = x cos(x)
Chapter The Solution of Nonlinear Equations f(x) = 0 In this chapter we will study methods for find the solutions of functions of single variables, ie values of x such that f(x) = 0 For example, f(x) =
More informationNumerical Methods Lecture 3
Numerical Methods Lecture 3 Nonlinear Equations by Pavel Ludvík Introduction Definition (Root or zero of a function) A root (or a zero) of a function f is a solution of an equation f (x) = 0. We learn
More informationUnit 2: Solving Scalar Equations. Notes prepared by: Amos Ron, Yunpeng Li, Mark Cowlishaw, Steve Wright Instructor: Steve Wright
cs416: introduction to scientific computing 01/9/07 Unit : Solving Scalar Equations Notes prepared by: Amos Ron, Yunpeng Li, Mark Cowlishaw, Steve Wright Instructor: Steve Wright 1 Introduction We now
More information5 Finding roots of equations
Lecture notes for Numerical Analysis 5 Finding roots of equations Topics:. Problem statement. Bisection Method 3. Newton s Method 4. Fixed Point Iterations 5. Systems of equations 6. Notes and further
More informationSection 1.4 Tangents and Velocity
Math 132 Tangents and Velocity Section 1.4 Section 1.4 Tangents and Velocity Tangent Lines A tangent line to a curve is a line that just touches the curve. In terms of a circle, the definition is very
More informationComputational Methods CMSC/AMSC/MAPL 460. Solving nonlinear equations and zero finding. Finding zeroes of functions
Computational Methods CMSC/AMSC/MAPL 460 Solving nonlinear equations and zero finding Ramani Duraiswami, Dept. of Computer Science Where does it arise? Finding zeroes of functions Solving functional equations
More informationDue Date: Thursday, March 22, 2018
The Notebook Project AP Calculus AB This project is designed to improve study skills and organizational skills for a successful career in mathematics. You are to turn a composition notebook into a Go To
More informationSOLVING EQUATIONS OF ONE VARIABLE
1 SOLVING EQUATIONS OF ONE VARIABLE ELM1222 Numerical Analysis Some of the contents are adopted from Laurene V. Fausett, Applied Numerical Analysis using MATLAB. Prentice Hall Inc., 1999 2 Today s lecture
More informationLimit. Chapter Introduction
Chapter 9 Limit Limit is the foundation of calculus that it is so useful to understand more complicating chapters of calculus. Besides, Mathematics has black hole scenarios (dividing by zero, going to
More informationAPPROXIMATION OF ROOTS OF EQUATIONS WITH A HAND-HELD CALCULATOR. Jay Villanueva Florida Memorial University Miami, FL
APPROXIMATION OF ROOTS OF EQUATIONS WITH A HAND-HELD CALCULATOR Jay Villanueva Florida Memorial University Miami, FL jvillanu@fmunivedu I Introduction II III IV Classical methods A Bisection B Linear interpolation
More informationZeros of Functions. Chapter 10
Chapter 10 Zeros of Functions An important part of the mathematics syllabus in secondary school is equation solving. This is important for the simple reason that equations are important a wide range of
More informationMidterm Review. Igor Yanovsky (Math 151A TA)
Midterm Review Igor Yanovsky (Math 5A TA) Root-Finding Methods Rootfinding methods are designed to find a zero of a function f, that is, to find a value of x such that f(x) =0 Bisection Method To apply
More informationConsequences of Continuity and Differentiability
Consequences of Continuity and Differentiability We have seen how continuity of functions is an important condition for evaluating limits. It is also an important conceptual tool for guaranteeing the existence
More informationCHAPTER 10 Zeros of Functions
CHAPTER 10 Zeros of Functions An important part of the maths syllabus in secondary school is equation solving. This is important for the simple reason that equations are important a wide range of problems
More informationApplied Mathematics Letters. Combined bracketing methods for solving nonlinear equations
Applied Mathematics Letters 5 (01) 1755 1760 Contents lists available at SciVerse ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Combined bracketing methods for
More informationHence a root lies between 1 and 2. Since f a is negative and f(x 0 ) is positive The root lies between a and x 0 i.e. 1 and 1.
The Bisection method or BOLZANO s method or Interval halving method: Find the positive root of x 3 x = 1 correct to four decimal places by bisection method Let f x = x 3 x 1 Here f 0 = 1 = ve, f 1 = ve,
More informationLecture 5. September 4, 2018 Math/CS 471: Introduction to Scientific Computing University of New Mexico
Lecture 5 September 4, 2018 Math/CS 471: Introduction to Scientific Computing University of New Mexico 1 Review: Office hours at regularly scheduled times this week Tuesday: 9:30am-11am Wed: 2:30pm-4:00pm
More informationp 1 p 0 (p 1, f(p 1 )) (p 0, f(p 0 )) The geometric construction of p 2 for the se- cant method.
80 CHAP. 2 SOLUTION OF NONLINEAR EQUATIONS f (x) = 0 y y = f(x) (p, 0) p 2 p 1 p 0 x (p 1, f(p 1 )) (p 0, f(p 0 )) The geometric construction of p 2 for the se- Figure 2.16 cant method. Secant Method The
More informationNonlinearity Root-finding Bisection Fixed Point Iteration Newton s Method Secant Method Conclusion. Nonlinear Systems
Nonlinear Systems CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Doug James (and Justin Solomon) CS 205A: Mathematical Methods Nonlinear Systems 1 / 27 Part III: Nonlinear Problems Not
More informationCLASS NOTES Models, Algorithms and Data: Introduction to computing 2018
CLASS NOTES Models, Algorithms and Data: Introduction to computing 2018 Petros Koumoutsakos, Jens Honore Walther (Last update: April 16, 2018) IMPORTANT DISCLAIMERS 1. REFERENCES: Much of the material
More informationIntroductory Numerical Analysis
Introductory Numerical Analysis Lecture Notes December 16, 017 Contents 1 Introduction to 1 11 Floating Point Numbers 1 1 Computational Errors 13 Algorithm 3 14 Calculus Review 3 Root Finding 5 1 Bisection
More informationLine Search Methods. Shefali Kulkarni-Thaker
1 BISECTION METHOD Line Search Methods Shefali Kulkarni-Thaker Consider the following unconstrained optimization problem min f(x) x R Any optimization algorithm starts by an initial point x 0 and performs
More information1. Nonlinear Equations. This lecture note excerpted parts from Michael Heath and Max Gunzburger. f(x) = 0
Numerical Analysis 1 1. Nonlinear Equations This lecture note excerpted parts from Michael Heath and Max Gunzburger. Given function f, we seek value x for which where f : D R n R n is nonlinear. f(x) =
More informationCalculus. Weijiu Liu. Department of Mathematics University of Central Arkansas 201 Donaghey Avenue, Conway, AR 72035, USA
Calculus Weijiu Liu Department of Mathematics University of Central Arkansas 201 Donaghey Avenue, Conway, AR 72035, USA 1 Opening Welcome to your Calculus I class! My name is Weijiu Liu. I will guide you
More informationMath 221 Exam II Tuesday Mar 23 5:30-7:00 PM Answers
Math 221 Exam II Tuesday Mar 23 5:30-7:00 PM Answers I. (25 points.) Find. Note: The book sometimes writes D xy for. (a) y = (x 2 x + 1) 7 Answer: Let u = x 2 x + 1. Then y = (x 2 x + 1) 7 = u 7 so = d
More informationExact and Approximate Numbers:
Eact and Approimate Numbers: The numbers that arise in technical applications are better described as eact numbers because there is not the sort of uncertainty in their values that was described above.
More informationMATH 2053 Calculus I Review for the Final Exam
MATH 05 Calculus I Review for the Final Exam (x+ x) 9 x 9 1. Find the limit: lim x 0. x. Find the limit: lim x + x x (x ).. Find lim x (x 5) = L, find such that f(x) L < 0.01 whenever 0 < x
More informationMotivation: We have already seen an example of a system of nonlinear equations when we studied Gaussian integration (p.8 of integration notes)
AMSC/CMSC 460 Computational Methods, Fall 2007 UNIT 5: Nonlinear Equations Dianne P. O Leary c 2001, 2002, 2007 Solving Nonlinear Equations and Optimization Problems Read Chapter 8. Skip Section 8.1.1.
More informationAP Calculus AB. Introduction. Slide 1 / 233 Slide 2 / 233. Slide 4 / 233. Slide 3 / 233. Slide 6 / 233. Slide 5 / 233. Limits & Continuity
Slide 1 / 233 Slide 2 / 233 AP Calculus AB Limits & Continuity 2015-10-20 www.njctl.org Slide 3 / 233 Slide 4 / 233 Table of Contents click on the topic to go to that section Introduction The Tangent Line
More informationCHAPTER 4 ROOTS OF EQUATIONS
CHAPTER 4 ROOTS OF EQUATIONS Chapter 3 : TOPIC COVERS (ROOTS OF EQUATIONS) Definition of Root of Equations Bracketing Method Graphical Method Bisection Method False Position Method Open Method One-Point
More informationA Primer on Multidimensional Optimization
A Primer on Multidimensional Optimization Prof. Dr. Florian Rupp German University of Technology in Oman (GUtech) Introduction to Numerical Methods for ENG & CS (Mathematics IV) Spring Term 2016 Eercise
More informationComputational Methods. Solving Equations
Computational Methods Solving Equations Manfred Huber 2010 1 Solving Equations Solving scalar equations is an elemental task that arises in a wide range of applications Corresponds to finding parameters
More informationAP Calculus AB. Slide 1 / 233. Slide 2 / 233. Slide 3 / 233. Limits & Continuity. Table of Contents
Slide 1 / 233 Slide 2 / 233 AP Calculus AB Limits & Continuity 2015-10-20 www.njctl.org Table of Contents click on the topic to go to that section Slide 3 / 233 Introduction The Tangent Line Problem Definition
More informationTHE SECANT METHOD. q(x) = a 0 + a 1 x. with
THE SECANT METHOD Newton s method was based on using the line tangent to the curve of y = f (x), with the point of tangency (x 0, f (x 0 )). When x 0 α, the graph of the tangent line is approximately the
More informationMath Practice Exam 3 - solutions
Math 181 - Practice Exam 3 - solutions Problem 1 Consider the function h(x) = (9x 2 33x 25)e 3x+1. a) Find h (x). b) Find all values of x where h (x) is zero ( critical values ). c) Using the sign pattern
More informationCaculus 221. Possible questions for Exam II. March 19, 2002
Caculus 221 Possible questions for Exam II March 19, 2002 These notes cover the recent material in a style more like the lecture than the book. The proofs in the book are in section 1-11. At the end there
More informationWEEK 8. CURVE SKETCHING. 1. Concavity
WEEK 8. CURVE SKETCHING. Concavity Definition. (Concavity). The graph of a function y = f(x) is () concave up on an interval I if for any two points a, b I, the straight line connecting two points (a,
More informationCLASS NOTES Computational Methods for Engineering Applications I Spring 2015
CLASS NOTES Computational Methods for Engineering Applications I Spring 2015 Petros Koumoutsakos Gerardo Tauriello (Last update: July 2, 2015) IMPORTANT DISCLAIMERS 1. REFERENCES: Much of the material
More informationMath 2413 General Review for Calculus Last Updated 02/23/2016
Math 243 General Review for Calculus Last Updated 02/23/206 Find the average velocity of the function over the given interval.. y = 6x 3-5x 2-8, [-8, ] Find the slope of the curve for the given value of
More informationReview for Final. The final will be about 20% from chapter 2, 30% from chapter 3, and 50% from chapter 4. Below are the topics to study:
Review for Final The final will be about 20% from chapter 2, 30% from chapter 3, and 50% from chapter 4. Below are the topics to study: Chapter 2 Find the exact answer to a limit question by using the
More informationCalculus I. 1. Limits and Continuity
2301107 Calculus I 1. Limits and Continuity Outline 1.1. Limits 1.1.1 Motivation:Tangent 1.1.2 Limit of a function 1.1.3 Limit laws 1.1.4 Mathematical definition of a it 1.1.5 Infinite it 1.1. Continuity
More informationChapter 2: Functions, Limits and Continuity
Chapter 2: Functions, Limits and Continuity Functions Limits Continuity Chapter 2: Functions, Limits and Continuity 1 Functions Functions are the major tools for describing the real world in mathematical
More informationNumerical Analysis. EE, NCKU Tien-Hao Chang (Darby Chang)
Numerical Analysis EE, NCKU Tien-Hao Chang (Darby Chang) 1 In the previous slide Error (motivation) Floating point number system difference to real number system problem of roundoff Introduced/propagated
More informationUniversity of Houston, Department of Mathematics Numerical Analysis, Fall 2005
3 Numerical Solution of Nonlinear Equations and Systems 3.1 Fixed point iteration Reamrk 3.1 Problem Given a function F : lr n lr n, compute x lr n such that ( ) F(x ) = 0. In this chapter, we consider
More informationLecture 7: Minimization or maximization of functions (Recipes Chapter 10)
Lecture 7: Minimization or maximization of functions (Recipes Chapter 10) Actively studied subject for several reasons: Commonly encountered problem: e.g. Hamilton s and Lagrange s principles, economics
More informationNon-linear Equations. Chapter Particle in a Box Potential. h2 d 2 u. dx 2. 0 x>a. d 2 u(x) + 2m h 2 (V 0+ E)u(x)=0 x<a, (4.
Chapter 4 Non-linear Equations Abstract In physics we often encounter the problem of determining the root of a function f(x). Especially, we may need to solve non-linear equations of one variable. Such
More informationMath 471. Numerical methods Root-finding algorithms for nonlinear equations
Math 471. Numerical methods Root-finding algorithms for nonlinear equations overlap Section.1.5 of Bradie Our goal in this chapter is to find the root(s) for f(x) = 0..1 Bisection Method Intermediate value
More informationAP Calculus Summer Prep
AP Calculus Summer Prep Topics from Algebra and Pre-Calculus (Solutions are on the Answer Key on the Last Pages) The purpose of this packet is to give you a review of basic skills. You are asked to have
More informationMath 261 Calculus I. Test 1 Study Guide. Name. Decide whether the limit exists. If it exists, find its value. 1) lim x 1. f(x) 2) lim x -1/2 f(x)
Math 261 Calculus I Test 1 Study Guide Name Decide whether the it exists. If it exists, find its value. 1) x 1 f(x) 2) x -1/2 f(x) Complete the table and use the result to find the indicated it. 3) If
More informationby Martin Mendez, UASLP Copyright 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Chapter 5 by Martin Mendez, 1 Roots of Equations Part Why? b m b a + b + c = 0 = aa 4ac But a 5 4 3 + b + c + d + e + f = 0 sin + = 0 =? =? by Martin Mendez, Nonlinear Equation Solvers Bracketing Graphical
More informationMAE 107 Homework 7 Solutions
MAE 107 Homework 7 Solutions 1. Tridiagonal system for u xx (x) + u(x) = 1 + sin(πx/4), for x [0, ], where u(0) =, u() = 4, with step size h = 1/. The total number of segments are: n = 0 1/ =. The nodes
More informationThe iteration formula for to find the root of the equation
SRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY, COIMBATORE- 10 DEPARTMENT OF SCIENCE AND HUMANITIES SUBJECT: NUMERICAL METHODS & LINEAR PROGRAMMING UNIT II SOLUTIONS OF EQUATION 1. If is continuous in then under
More informationCalculus AB Topics Limits Continuity, Asymptotes
Calculus AB Topics Limits Continuity, Asymptotes Consider f x 2x 1 x 3 1 x 3 x 3 Is there a vertical asymptote at x = 3? Do not give a Precalculus answer on a Calculus exam. Consider f x 2x 1 x 3 1 x 3
More informationAP Calculus AB. Limits & Continuity.
1 AP Calculus AB Limits & Continuity 2015 10 20 www.njctl.org 2 Table of Contents click on the topic to go to that section Introduction The Tangent Line Problem Definition of a Limit and Graphical Approach
More information4. We accept without proofs that the following functions are differentiable: (e x ) = e x, sin x = cos x, cos x = sin x, log (x) = 1 sin x
4 We accept without proofs that the following functions are differentiable: (e x ) = e x, sin x = cos x, cos x = sin x, log (x) = 1 sin x x, x > 0 Since tan x = cos x, from the quotient rule, tan x = sin
More informationModified Bracketing Method for Solving Nonlinear Problems With Second Order of Convergence
Punjab University Journal of Mathematics (ISSN 1016-2526) Vol. 51(3)(2018) pp. 145-151 Modified Bracketing Method for Solving Nonlinear Problems With Second Order of Convergence Umair Khalid Qureshi 1,
More informationChapter 3: The Derivative in Graphing and Applications
Chapter 3: The Derivative in Graphing and Applications Summary: The main purpose of this chapter is to use the derivative as a tool to assist in the graphing of functions and for solving optimization problems.
More informationMATH 350: Introduction to Computational Mathematics
MATH 350: Introduction to Computational Mathematics Chapter IV: Locating Roots of Equations Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Spring 2011 fasshauer@iit.edu
More information