Yunfei duan Hui Pan.  A parabola through three points f(a) f(b) f(c)  for the derivation of this formula is from  denominator should not be zero.

Slides:



Advertisements
Similar presentations
Maxima and Minima of Functions Maxima and minima of functions occur where there is a change from increasing to decreasing, or vice versa.
Advertisements

Lecture 5 Newton-Raphson Method
Line Search.
Optimization.
What are you finding when you solve the quadratic formula? Where the graph crosses the x-axis Also known as: Zeros, Roots and X-intercepts.
1 Concavity and the Second Derivative Test Section 3.4.
ROOTS OF EQUATIONS Student Notes ENGR 351 Numerical Methods for Engineers Southern Illinois University Carbondale College of Engineering Dr. L.R. Chevalier.
Optimization Introduction & 1-D Unconstrained Optimization
2. Numerical differentiation. Approximate a derivative of a given function. Approximate a derivative of a function defined by discrete data at the discrete.
More on Functions and Their Graphs Section 1.3. Objectives Calculate and simplify the difference quotient for a given function. Calculate a function value.
Chapter 6 Open Methods.
Curve-Fitting Interpolation
Page 1 Page 1 Engineering Optimization Second Edition Authors: A. Rabindran, K. M. Ragsdell, and G. V. Reklaitis Chapter-2 (Functions of a Single Variable)
Engineering Optimization
Revision.
Chapter 3 Root Finding.
Relative Extrema.
Unit 11 – Derivative Graphs Section 11.1 – First Derivative Graphs First Derivative Slope of the Tangent Line.
Chapter 4 Roots of Polynomials.
Chapter 17 Boundary Value Problems. Standard Form of Two-Point Boundary Value Problem In total, there are n 1 +n 2 =N boundary conditions.
Polynomial inequalities Objective –To Solve polynomial inequalities.
Section 4.1 Using First and Second Derivatives. Let’s see what we remember about derivatives of a function and its graph –If f’ > 0 on an interval than.
Increasing / Decreasing Test
Review Taylor Series and Error Analysis Roots of Equations
Chapter 4 Interpolation and Approximation. 4.1 Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
Properties of Functions Section Even, Odd or Neither? 4.
1 Nonlinear Equations Jyun-Ming Chen. 2 Contents Bisection False Position Newton Quasi-Newton Inverse Interpolation Method Comparison.
Section 1.6 Polynomial and Rational Inequalities.
9-8 The Quadratic Formula Warm Up Warm Up Lesson Presentation Lesson Presentation California Standards California StandardsPreview.
Numerical Methods for Engineering MECN 3500
Section 5.9 Approximate Integration Practice HW from Stewart Textbook (not to hand in) p. 421 # 3 – 15 odd.
統計計算與模擬 政治大學統計系余清祥 2004 年 5 月 5~13 日 第十二、十三週:求根、極值.
Newton-Raphson Method. Figure 1 Geometrical illustration of the Newton-Raphson method. 2.
Copyright © 2016, 2012 Pearson Education, Inc
Solving Non-Linear Equations (Root Finding)
Copyright © 2016, 2012 Pearson Education, Inc
One Dimensional Search
SOLVING NONLINEAR EQUATIONS. SECANT METHOD MATH-415 Numerical Analysis 1.
Newton-Raphson Method Computer Engineering Majors Authors: Autar Kaw, Jai Paul Transforming Numerical Methods Education.
Yasser F. O. Mohammad Assiut University Egypt. Previously in NM Bracketing Methods Bisection False Position Fixed Point Iteration Local Convergence Methods.
INTRO TO OPTIMIZATION MATH-415 Numerical Analysis 1.
Exam 1 Oct 3, closed book Place ITE 119, Time:12:30-1:45pm One double-sided cheat sheet (8.5in x 11in) allowed Bring your calculator to the exam Chapters.
Section 2.2 More on Functions and Their Graphs. Increasing and Decreasing Functions.
Project on Newton’s Iteration Method Presented by Dol Nath Khanal Project Advisor- Professor Dexuan Xie 05/11/2015.
4.3 – Derivatives and the shapes of curves
MATH 175: Numerical Analysis II Lecturer: Jomar Fajardo Rabajante IMSP, UPLB 2 nd Sem AY
CSE 330: Numerical Methods. Introduction The bisection and false position method require bracketing of the root by two guesses Such methods are called.
Linear Approximations. In this section we’re going to take a look at an application not of derivatives but of the tangent line to a function. Of course,
MATH 175: Numerical Analysis II
Announcements Topics: Work On:
Lesson 1.3, page 154 More on Functions
CS B553: Algorithms for Optimization and Learning
6.5/6.8 Analyze Graphs of Polynomial Functions
4.2 Polynomial Functions and Models
Using First Derivatives to Find Maximum and Minimum Values and Sketch Graphs OBJECTIVE Find relative extrema of a continuous function using the First-Derivative.
Computers in Civil Engineering 53:081 Spring 2003
3.2 – Concavity and Points of Inflection
4.3 – Derivatives and the shapes of curves
MATH 175: Numerical Analysis II
Section 2.2 More on Functions and Their Graphs
Optimization Part II G.Anuradha.
“Why so serious?”.
Warm Up Cinco Chapter 3.4 Concavity and the Second Derivative Test
Bellwork: 2/13/18 Find each product.
4.2 Critical Points, Local Maxima and Local Minima
Copyright © Cengage Learning. All rights reserved.
MATH 1910 Chapter 3 Section 8 Newton’s Method.
Chapter 4 Graphing and Optimization
Chapter 4 Graphing and Optimization
Bracketing.
Presentation transcript:

Yunfei duan Hui Pan

 A parabola through three points f(a) f(b) f(c)  for the derivation of this formula is from  denominator should not be zero

 six function points  a, b, u, v, w and x,  The minimum is bracketed between a and b;  x is the point with the very least function value found  w is the point with the second least function value; v u is the previous value of w;  Xm is the value of the f

 Brent's Method:  This method takes advantage of the fact that, near a minimum, the function is approximately quadratic. It conisists of the following steps  Find the minimum of the 2nd order polynomial defined by the three bracket points  Use this minimum to define the new point x  Re-define the bracket  Of course, there also need to be checks on this algorithm, when it is implemented in practice, to ensure that:

 function f interpolating parabola and a bracketing triplet of abscissas (a b c)  a f(b) <f(c)  (1 2 3) (1 2 4) (1 2 5)

 one dimensional search – what’s the problem?  determine the minimizer of a function f : R ->R  typically over a closed interval [a0,b0]  assumption: function is unimodal (at least over this interval) typical approaches: 1 bisection method 2 golden section search 3 Newton’s method 4 secant method

basic idea start with interval [a0,b0] (1st derivative not available)  split the interval into three subintervals:  pick two new values a1 and b1 and a0 < a1 < b1 < b0  there are two possible outcomes:  f(a0) >f(a1) > f(b1)< f(b0)  f(a0) > f(a1) < f(b1) < f(b0)

 F ( x )=3 x^ 4−4 x^ 3−12 x^ 2+3  We cannot find regions of which f is increasing or decreasing, relative maxima or minima.  Graphing by hand is tedious and imprecise. Even the use of a graphing program will only give us an approximation for the locations and values of maxima and minima. We can use the first derivative of f, however, to find all these things quickly and easily.

F ( x )=3 x^ 4−4 x^ 3−12 x^ 2+3 has first derivative F’ ( x ) = 12 x^ 3−12 x^ 2−24 x = 12 x ( x^ 2− x −2) =12 x ( x +1)( x −2)  f ( x ) is increasing on (−1,0) ∪ (2 , ∞) and decreasing on(− ∞ , −1) ∪ (0 , 2).

 use derivative information only as follows  The sign of the derivative at the central point of the bracketing triplet ( a b c )  the next test point should be taken in the interval [a b] or [a c]  The value of this derivative and of the derivative at the second-best-so-far point are extrapolated to zero by the secant method  We impose the same sort of restrictions on this new trial point as in Brent’s method.  If the trial point must be rejected, we bisect the interval under scrutiny.