434 CHAP. 8 NUMERICAL OPTIMIZATION. Powell's Method. Powell s Method
|
|
- Samson Hawkins
- 6 years ago
- Views:
Transcription
1 434 CHAP. 8 NUMERICAL OPTIMIZATION Powell's Method Powell s Method Let X be an initial guess at the location of the minimum of the function z = f (x, x 2,...,x N ). Assume that the partial derivatives of the function are not available. An intuitively appealing approach to approximating a minimum of the function f is to generate the next approximation X by proceeding successively to a minimum of f along each of the N standard base vectors. The process generates the sequence of
2 SEC. 8.2 NELDER-MEAD AND POWELL S METHODS 435 y T 9 2 T 7 T T 8 T 6 T 5 T 4 T 2 T 3 T x 2 3 Figure 8. The sequence of triangles {T k } converging to the point (3, 2) for the Nelder-Mead method. points X = P, P, P 2,..., P N = X. Along each standard base vector the function f is a function of one variable. Thus the minimization of f requires the application of either the golden ratio or Fibonacci searches (Section 8.) on an interval over which the function is unimodal. The iteration is then repeated to generate a sequence of points {X k } k=. Unfortunately, the method is, in general, inefficient due to the geometry of multivariable functions. But the step from the point X to the point X is the first step of Powell s method. The essence of Powell s method is to add two steps to the process described in the preceding paragraph. The vector P N P represents, in some sense, the average direction moved during each iteration. Thus the point X is determined to be the point at which the minimum of the function f occurs along the vector P N P. As before, f is a function of one variable along this vector and the minimization requires an application of the golden ratio or Fibonacci searches. Finally, since the vector P N P was such a good direction, it replaces one of the direction vectors for the next iteration. The iteration is then repeated using the new set of direction vectors to generate a sequence of points {X k } k=. The process is outlined below. Let X be an initial guess at the location of the minimum of the function z = f (x, x 2,...,x N ), {E k =[ k ] :k =, 2,...,N} be the set of stan-
3 436 CHAP. 8 NUMERICAL OPTIMIZATION Table 8.6 Function Values at Various Triangles for Example 8.6 k Best point Good point Worst point f (.2,.) = 3.36 f (.,.8) =.6 f (.,.) =. 2 f (.8,.2) = 5.88 f (.2,.) = 3.36 f (.,.8) =.6 3 f (.8,.2) = 5.88 f (3.,.4) = 4.44 f (.2,.) = f (3.6,.6) = 6.24 f (I.8,.2) = 5.88 f (3.,.4) = f (3.6,.6) = 6.24 f (2.4, 2.4) = 6.24 f (.8,.2) = f (2.4,.6) = 6.72 f (3.6,.6) = 6.24 f (2.4, 2.4) = f (3.,.8) = 6.96 f (2.4,.6) = 6.72 f (2.4, 2.4) = f (3.,.8) = 6.96 f (2.55, 2.5) = f (2.4,.6) = f (3.,.8) = 6.96 f (3.5, 2.25) = f (2.55, 2.5) = f (3.,.8) = 6.96 f (2.825, 2.375) = f (3.5, 2.25) = dard base vectors, (9) U =[U U 2 U N ]=[E E 2 E N ], and i =. (i) Set P = X i. (ii) For k =, 2,...,N find the value of γ k that minimizes f (P k + γ k U k ) and set P k = P k + γ k U k. (iii) Set i = i +. (iv) Set U j = U j+ for j =, 2,...,N. Set U N = P N P. (v) Find the value of γ that minimizes f (P + γ U N ).SetX i = P + γ U N (vi) Repeat steps (i) through (v). Example 8.7. Use the process described in the preceding paragraph to find X and X 2 for the function [ f (x, y) ] = cos(x) + sin(y). Use the initial point X = (5.5, 2). Let U = and P = X = (5.5, 2). When i = the function f (P + γ U ) = f ((5.5, 2) + γ (, )) = f (5.5 + γ, 2) = cos(5.5 + γ ) + sin(2)
4 SEC. 8.2 NELDER-MEAD AND POWELL S METHODS 437 has a minimum at γ = Thus P = ( , 2). When i = 2 the function f (P + γ 2 U 2 ) = f (( , 2) + γ 2 (, )) = f ( , 2 + γ 2 ) = cos( ) + sin(2 + γ 2 ) has a minimum at γ 2 = Thus P 2 = ( , ). Set U 2 = (P 2 P ) and [ ] U = The function f (P + γ U 2 ) = f ((5.5, 2) + γ( , )) = f ( γ, γ) = cos( γ)+ sin( γ) has a minimum at γ = Thus X = ( , ). Set P = X. When i = the function f (P + γ U ) = f (( , ) + γ (, )) = f ( , γ ) = cos( ) + sin( γ ) has a minimum at γ = Thus P = ( , ). When i = 2the function f (P + γ 2 U 2 ) = f (( , ) + γ 2 ( , )) = f ( γ 2, γ 2 ) = cos( γ 2 ) + sin( γ 2 ) has a minimum at γ 2 = Thus P 2 = ( , ). Set U 2 = (P 2 P ) and [ ] U = The function f (P + γ U 2 ) = f (( , ) + γ(.85889,.796)) = f ( γ, γ) = cos( γ)+ sin( γ) has a minimum at γ = Thus X 2 = ( , ). The function f (x, y) = cos(x) + sin(y) has a relative minimum at the point P = (π, 3π/2). The graph of f is shown in Figure 8.. Figure 8.2 shows a contour plot of the function f and the relative positions of the points X, X, and X 2.
5 438 CHAP. 8 NUMERICAL OPTIMIZATION y x Figure 8. The graph of f (x, y) = cos(x) + sin(y) x 2 x y x Figure 8.2 The contour graph of f (x, y) = cos(x) + sin(y). x In step (iv) of the previous process the first vector U was discarded and the average direction vector P N P was added to the list of direction vectors. In fact, it would be better to discard the vector U r along which the greatest decrease in f occurred. It seems reasonable that the vector U r is a large component of the average direction vector U N = P N P. Thus, as the number of iterations increase, the set of direction vectors will tend to become linearly dependent. When the set becomes linearly dependent one or more of the directions will be lost and it is likely that the set of points {X} k= will not converge to the point at which the local minimum occurs. Furthermore, in step (iv) it was assumed that the average direction vector represented a good direction in which to continue the search. But that may not be the case. Outline of Powell s Method (i) Set P = X i. (ii) For k =, 2,...,N find the value of γ k that minimizes f (P k + γ k U k ) and set P k = P k + γ k U k. (iii) Set r and U r equal to the maximum decrease in f and the direction of the maximum decrease, respectively, over all the direction vectors in step (ii). (iv) Set i = i +. (v) If f (2P N P ) f (P ) or 2( f (P ) 2 f (P N )+ f (2P N P ))( f (P ) f (P N ) r) 2 r( f (P ) f (2P N P )) 2, then set X i = P N and return to step (i). Otherwise, go to step (vi).
6 SEC. 8.2 NELDER-MEAD AND POWELL S METHODS 439 (vi) Set U r = P N P. (vii) Find the value of γ that minimizes f (P + γ U r ).SetX i = P + γ U r. (viii) Repeat steps (i) through (vii). If the conditions in step (v) are satisfied, then the set of direction vectors is left unchanged. The first inequality in step (v) indicates that there is no further decrease in the value of f in the average direction P N P. The second inequality indicates that the decrease in the function f in the direction of greatest decrease U r was not a major part of the total decrease in f in step (ii). If the conditions in step (v) are not satisfied, then the direction of greatest decrease U r is replaced with the average direction from step (ii); P N P. In step (vii) the function is minimized in this direction. Stopping criteria based on the magnitudes X i X i or f (X i ) are typically found in steps (v) and (vii).
7 Numerical Methods Using Matlab, 4 th Edition, 24 John H. Mathews and Kurtis K. Fink ISBN: Prentice-Hall Inc. Upper Saddle River, New Jersey, USA
446 CHAP. 8 NUMERICAL OPTIMIZATION. Newton's Search for a Minimum of f(x,y) Newton s Method
446 CHAP. 8 NUMERICAL OPTIMIZATION Newton's Search for a Minimum of f(xy) Newton s Method The quadratic approximation method of Section 8.1 generated a sequence of seconddegree Lagrange polynomials. It
More informationSEC POWER METHOD Power Method
SEC..2 POWER METHOD 599.2 Power Method We now describe the power method for computing the dominant eigenpair. Its extension to the inverse power method is practical for finding any eigenvalue provided
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 information632 CHAP. 11 EIGENVALUES AND EIGENVECTORS. QR Method
632 CHAP 11 EIGENVALUES AND EIGENVECTORS QR Method Suppose that A is a real symmetric matrix In the preceding section we saw how Householder s method is used to construct a similar tridiagonal matrix The
More information9.6 Predictor-Corrector Methods
SEC. 9.6 PREDICTOR-CORRECTOR METHODS 505 Adams-Bashforth-Moulton Method 9.6 Predictor-Corrector Methods The methods of Euler, Heun, Taylor, and Runge-Kutta are called single-step methods because they use
More information5.1 Least-Squares Line
252 CHAP. 5 CURVE FITTING 5.1 Least-Squares Line In science and engineering it is often the case that an experiment produces a set of data points (x 1, y 1 ),...,(x N, y N ), where the abscissas {x k }
More information9.2 Euler s Method. (1) t k = a + kh for k = 0, 1,..., M where h = b a. The value h is called the step size. We now proceed to solve approximately
464 CHAP. 9 SOLUTION OF DIFFERENTIAL EQUATIONS 9. Euler s Method The reader should be convinced that not all initial value problems can be solved explicitly, and often it is impossible to find a formula
More information9.8 Boundary Value Problems. Another type of differential equation has the form. (1) x = f (t, x, x ) for a t b, with the boundary conditions
528 CHAP. 9 SOLUTION OF DIFFERENTIAL EQUATIONS Linear Shooting Method 9.8 Boundary Value Problems Another type of differential equation has the form (1) x = f (t, x, x ) for a t b, with the boundary conditions
More informationThe Tangent Parabola The AMATYC Review, Vol. 23, No. 1, Fall 2001, pp
The Tangent Parabola The AMATYC Review, Vol. 3, No., Fall, pp. 5-3. John H. Mathews California State University Fullerton Fullerton, CA 9834 By Russell W. Howell Westmont College Santa Barbara, CA 938
More informationBernstein polynomials of degree N are defined by
SEC. 5.5 BÉZIER CURVES 309 5.5 Bézier Curves Pierre Bézier at Renault and Paul de Casteljau at Citroën independently developed the Bézier curve for CAD/CAM operations, in the 1970s. These parametrically
More informationOptimization Concepts and Applications in Engineering
Optimization Concepts and Applications in Engineering Ashok D. Belegundu, Ph.D. Department of Mechanical Engineering The Pennsylvania State University University Park, Pennsylvania Tirupathi R. Chandrupatia,
More informationIteration & Fixed Point
Iteration & Fied Point As a method for finding the root of f this method is difficult, but it illustrates some important features of iterstion. We could write f as f g and solve g. Definition.1 (Fied Point)
More informationEAD 115. Numerical Solution of Engineering and Scientific Problems. David M. Rocke Department of Applied Science
EAD 115 Numerical Solution of Engineering and Scientific Problems David M. Rocke Department of Applied Science Multidimensional Unconstrained Optimization Suppose we have a function f() of more than one
More information1 Numerical optimization
Contents 1 Numerical optimization 5 1.1 Optimization of single-variable functions............ 5 1.1.1 Golden Section Search................... 6 1.1. Fibonacci Search...................... 8 1. Algorithms
More information1 Numerical optimization
Contents Numerical optimization 5. Optimization of single-variable functions.............................. 5.. Golden Section Search..................................... 6.. Fibonacci Search........................................
More informationOptimization. Totally not complete this is...don't use it yet...
Optimization Totally not complete this is...don't use it yet... Bisection? Doing a root method is akin to doing a optimization method, but bi-section would not be an effective method - can detect sign
More informationA First Course in Wavelets with Fourier Analysis
* A First Course in Wavelets with Fourier Analysis Albert Boggess Francis J. Narcowich Texas A& M University, Texas PRENTICE HALL, Upper Saddle River, NJ 07458 Contents Preface Acknowledgments xi xix 0
More informationX On record with the USOE.
Textbook Alignment to the Utah Core Algebra 1 Name of Company and Individual Conducting Alignment: Chris McHugh, McHugh Inc. A Credential Sheet has been completed on the above company/evaluator and is
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 informationSolutions of Equations in One Variable. Newton s Method
Solutions of Equations in One Variable Newton s Method Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011 Brooks/Cole,
More informationIntroduction to unconstrained optimization - direct search methods
Introduction to unconstrained optimization - direct search methods Jussi Hakanen Post-doctoral researcher jussi.hakanen@jyu.fi Structure of optimization methods Typically Constraint handling converts the
More informationNETWORK ANALYSIS WITH APPLICATIONS
NETWORK ANALYSIS WITH APPLICATIONS Third Edition William D. Stanley Old Dominion University Prentice Hall Upper Saddle River, New Jersey I Columbus, Ohio CONTENTS 1 BASIC CIRCUIT LAWS 1 1-1 General Plan
More informationNumerical solutions of nonlinear systems of equations
Numerical solutions of nonlinear systems of equations Tsung-Ming Huang Department of Mathematics National Taiwan Normal University, Taiwan E-mail: min@math.ntnu.edu.tw August 28, 2011 Outline 1 Fixed points
More informationMATHEMATICAL EXPOSITION
MATHEMATICAL EXPOSITION An Improved Newton's Method by John H. Mathews California State University, Fullerton, CA 92634 4(oif John earned his Ph.D. in mathematics from Michigan State University under the
More informationExample - Newton-Raphson Method
Eample - Newton-Raphson Method We now consider the following eample: minimize f( 3 3 + -- 4 4 Since f ( 3 2 + 3 3 and f ( 6 + 9 2 we form the following iteration: + n 3 ( n 3 3( n 2 ------------------------------------
More informationAlgebra I. Course Outline
Algebra I Course Outline I. The Language of Algebra A. Variables and Expressions B. Order of Operations C. Open Sentences D. Identity and Equality Properties E. The Distributive Property F. Commutative
More informationOptimization: Nonlinear Optimization without Constraints. Nonlinear Optimization without Constraints 1 / 23
Optimization: Nonlinear Optimization without Constraints Nonlinear Optimization without Constraints 1 / 23 Nonlinear optimization without constraints Unconstrained minimization min x f(x) where f(x) is
More informationA Three-Step Iterative Method to Solve A Nonlinear Equation via an Undetermined Coefficient Method
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 14, Number 11 (018), pp. 145-1435 Research India Publications http://www.ripublication.com/gjpam.htm A Three-Step Iterative Method
More informationStatistics 580 Optimization Methods
Statistics 580 Optimization Methods Introduction Let fx be a given real-valued function on R p. The general optimization problem is to find an x ɛ R p at which fx attain a maximum or a minimum. It is of
More informationBracketing an Optima in Univariate Optimization
Bracketing an Optima in Univariate Optimization Pritibhushan Sinha Quantitative Methods & Operations Management Area Indian Institute of Management Kozhikode Kozhikode 673570 Kerala India Email: pritibhushan.sinha@iimk.ac.in
More informationInvestigation of Tangent Polynomials with a Computer Algebra System The AMATYC Review, Vol. 14, No. 1, Fall 1992, pp
Investigation of Tangent Polynomials wit a Computer Algebra System Te AMATYC Review, Vol. 14, No. 1, Fall 199, pp. -7. Jon H. Matews California State University Fullerton Fullerton, CA 9834 By Russell
More informationOptimization Methods
Optimization Methods Decision making Examples: determining which ingredients and in what quantities to add to a mixture being made so that it will meet specifications on its composition allocating available
More informationStatic unconstrained optimization
Static unconstrained optimization 2 In unconstrained optimization an objective function is minimized without any additional restriction on the decision variables, i.e. min f(x) x X ad (2.) with X ad R
More informationApplied Numerical Analysis
Applied Numerical Analysis Using MATLAB Second Edition Laurene V. Fausett Texas A&M University-Commerce PEARSON Prentice Hall Upper Saddle River, NJ 07458 Contents Preface xi 1 Foundations 1 1.1 Introductory
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 informationEAD 115. Numerical Solution of Engineering and Scientific Problems. David M. Rocke Department of Applied Science
EAD 115 Numerical Solution of Engineering and Scientific Problems David M. Rocke Department of Applied Science Taylor s Theorem Can often approximate a function by a polynomial The error in the approximation
More informationRadical. Anthony J. Browne. April 23, 2016 ABSTRACT
Radical Anthony J. Browne April 23, 2016 ABSTRACT Approximations of square roots are discussed. A very close approximation to their decimal expansion is derived in the form of a simple fraction. Their
More informationTest3 Review. $ & Chap. 6. g(x) 6 6cosx. Name: Class: Date:
Class: Date: Test Review $5.-5.5 & Chap. 6 Multiple Choice Identify the choice that best completes the statement or answers the question.. Graph the function. g(x) 6 6cosx a. c. b. d. . Graph the function.
More informationx On record with the USOE.
Textbook Alignment to the Utah Core Algebra 1 Name of Company and Individual Conducting Alignment: Pete Barry A Credential Sheet has been completed on the above company/evaluator and is (Please check one
More informationNUMERICAL MATHEMATICS AND COMPUTING
NUMERICAL MATHEMATICS AND COMPUTING Fourth Edition Ward Cheney David Kincaid The University of Texas at Austin 9 Brooks/Cole Publishing Company I(T)P An International Thomson Publishing Company Pacific
More informationFIXED POINT ITERATION
FIXED POINT ITERATION The idea of the fixed point iteration methods is to first reformulate a equation to an equivalent fixed point problem: f (x) = 0 x = g(x) and then to use the iteration: with an initial
More informationLecture Notes on Metric Spaces
Lecture Notes on Metric Spaces Math 117: Summer 2007 John Douglas Moore Our goal of these notes is to explain a few facts regarding metric spaces not included in the first few chapters of the text [1],
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 informationUnconstrained Multivariate Optimization
Unconstrained Multivariate Optimization Multivariate optimization means optimization of a scalar function of a several variables: and has the general form: y = () min ( ) where () is a nonlinear scalar-valued
More informationSKMM 3023 Applied Numerical Methods
SKMM 3023 Applied Numerical Methods Solution of Nonlinear Equations ibn Abdullah Faculty of Mechanical Engineering Òº ÙÐÐ ÚºÒÙÐÐ ¾¼½ SKMM 3023 Applied Numerical Methods Solution of Nonlinear Equations
More informationMTH 122: Section 204. Plane Trigonometry. Test 1
MTH 122: Section 204. Plane Trigonometry. Test 1 Section A: No use of calculator is allowed. Show your work and clearly identify your answer. 1. a). Complete the following table. α 0 π/6 π/4 π/3 π/2 π
More informationBeautiful Images from Some Simple Formulas
Department of Mathematics and Computer Science Mount St. Mary s University Ordinary plot of f(x, y) = x 2 + y 2 Contour plot of f(x, y) = x 2 + y 2 Looking down from above Colored contour map Temperatures
More informationNumerical Methods. King Saud University
Numerical Methods King Saud University Aims In this lecture, we will... Introduce the topic of numerical methods Consider the Error analysis and sources of errors Introduction A numerical method which
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 informationLecture 3: Basics of set-constrained and unconstrained optimization
Lecture 3: Basics of set-constrained and unconstrained optimization (Chap 6 from textbook) Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 9, 2018 Optimization basics Outline Optimization
More informationAlgebraic Simplex Active Learning Module 4
Algebraic Simplex Active Learning Module 4 J. René Villalobos and Gary L. Hogg Arizona State University Paul M. Griffin Georgia Institute of Technology Time required for the module: 50 Min. Reading Most
More informationx The Credential Sheet is attached to this alignment.
Textbook Alignment to the Utah Core Algebra 2 This alignment has been completed using an Independent Alignment Vendor from the USOE approved list (www.schools.utah.gov/curr/imc/indvendor.html.) Yes N/A
More informationMcMaster University CS-4-6TE3/CES Assignment-1 Solution Set
McMaster University CS-4-6TE3/CES722-723 Assignment- Solution Set CS-4-6TE3/CES722-723 Assignment Solution Set Christopher Anand, Shefali Kulkarni-Thaker October 25, 20 Consider the so-called Rosenbrock
More informationLecture V. Numerical Optimization
Lecture V Numerical Optimization Gianluca Violante New York University Quantitative Macroeconomics G. Violante, Numerical Optimization p. 1 /19 Isomorphism I We describe minimization problems: to maximize
More informationNumerical optimization
THE UNIVERSITY OF WESTERN ONTARIO LONDON ONTARIO Paul Klein Office: SSC 408 Phone: 661-111 ext. 857 Email: paul.klein@uwo.ca URL: www.ssc.uwo.ca/economics/faculty/klein/ Numerical optimization In these
More informationSolutionbank Edexcel AS and A Level Modular Mathematics
Page of Exercise A, Question The curve C, with equation y = x ln x, x > 0, has a stationary point P. Find, in terms of e, the coordinates of P. (7) y = x ln x, x > 0 Differentiate as a product: = x + x
More informationSEVENTH EDITION and EXPANDED SEVENTH EDITION
SEVENTH EDITION and EXPANDED SEVENTH EDITION Slide 5-1 Chapter 5 Number Theory and the Real Number System 5.1 Number Theory Number Theory The study of numbers and their properties. The numbers we use to
More informationSolution of Helmholtz Equation Using Finite Differences Method in Wires Have Different Properties along X-Axis
Journal of Electrical Engineering 6 (218) 26-211 doi: 1.17265/2328-2223/218.4.2 D DAVID PUBLISHING Solution of Helmholtz Equation Using Finite Differences Method in Ayse Nihan Basmaci Filiz Corlu Vocational
More informationSpherical trigonometry
Spherical trigonometry 1 The spherical Pythagorean theorem Proposition 1.1 On a sphere of radius, any right triangle AC with C being the right angle satisfies cos(c/) = cos(a/) cos(b/). (1) Proof: Let
More informationFind all of the real numbers x that satisfy the algebraic equation:
Appendix C: Factoring Algebraic Expressions Factoring algebraic equations is the reverse of expanding algebraic expressions discussed in Appendix B. Factoring algebraic equations can be a great help when
More informationSongklanakarin Journal of Science and Technology SJST R1 KANYAMEE. Numerical methods for finding multiplicative inverses of a modulo N
Songklanakarin Journal of Science and Technology SJST-0-0.R KANYAMEE Numerical methods for finding multiplicative inverses of a modulo N Journal: Songklanakarin Journal of Science and Technology Manuscript
More informationUse a calculator to find the value of the expression in radian measure rounded to 2 decimal places. 1 8) cos-1 6
Math 180 - chapter 7 and 8.1-8. - New Edition - Spring 09 Name Find the value of the expression. 1) sin-1 0.5 ) tan-1-1 ) cos-1 (- ) 4) sin-1 Find the exact value of the expression. 5) sin [sin-1 (0.7)]
More informationCollege Prep Math Final Exam Review Packet
College Prep Math Final Exam Review Packet Name: Date of Exam: In Class 1 Directions: Complete each assignment using the due dates given by the calendar below. If you are absent from school, you are still
More informationCURRICULUM GUIDE Algebra II College-Prep Level
CURRICULUM GUIDE Algebra II College-Prep Level Revised Sept 2011 Course Description: This course builds upon the foundational concepts of Algebra I and Geometry, connects them with practical real world
More informationMultiple Choice Answers. MA 113 Calculus I Spring 2018 Exam 2 Tuesday, 6 March Question
MA 113 Calculus I Spring 2018 Exam 2 Tuesday, 6 March 2018 Name: Section: Last 4 digits of student ID #: This exam has 12 multiple choice questions (five points each) and 4 free response questions (ten
More informationSection 11.1: Sequences
Section 11.1: Sequences In this section, we shall study something of which is conceptually simple mathematically, but has far reaching results in so many different areas of mathematics - sequences. 1.
More informationChemical and Process Thermodynamics
Chemical and Process Thermodynamics Third Edition B. G. Kyle Emeritus Professor of Chemical Engineering Kansas State University Prentice Hall PTR Upper Saddle River, New Jersey 07458 CONTENTS Preface Notation
More informationApplied Nonlinear Control
Applied Nonlinear Control JEAN-JACQUES E. SLOTINE Massachusetts Institute of Technology WEIPING LI Massachusetts Institute of Technology Pearson Education Prentice Hall International Inc. Upper Saddle
More informationLogic and Discrete Mathematics. Section 6.7 Recurrence Relations and Their Solution
Logic and Discrete Mathematics Section 6.7 Recurrence Relations and Their Solution Slides version: January 2015 Definition A recurrence relation for a sequence a 0, a 1, a 2,... is a formula giving a n
More informationVectors, dot product, and cross product
MTH 201 Multivariable calculus and differential equations Practice problems Vectors, dot product, and cross product 1. Find the component form and length of vector P Q with the following initial point
More informationChapter 6: Derivative-Based. optimization 1
Chapter 6: Derivative-Based Optimization Introduction (6. Descent Methods (6. he Method of Steepest Descent (6.3 Newton s Methods (NM (6.4 Step Size Determination (6.5 Nonlinear Least-Squares Problems
More informationInverse Trig Functions
6.6i Inverse Trigonometric Functions Inverse Sine Function Does g(x) = sin(x) have an inverse? What restriction would we need to make so that at least a piece of this function has an inverse? Given f (x)
More informationMath 117: Infinite Sequences
Math 7: Infinite Sequences John Douglas Moore November, 008 The three main theorems in the theory of infinite sequences are the Monotone Convergence Theorem, the Cauchy Sequence Theorem and the Subsequence
More information1. Find and classify the extrema of h(x, y) = sin(x) sin(y) sin(x + y) on the square[0, π] [0, π]. (Keep in mind there is a boundary to check out).
. Find and classify the extrema of hx, y sinx siny sinx + y on the square[, π] [, π]. Keep in mind there is a boundary to check out. Solution: h x cos x sin y sinx + y + sin x sin y cosx + y h y sin x
More informationSection 10.1 Radical Expressions and Functions. f1-152 = = = 236 = 6. 2x 2-14x + 49 = 21x = ƒ x - 7 ƒ
78 CHAPTER 0 Radicals, Radical Functions, and Rational Exponents Chapter 0 Summary Section 0. Radical Expressions and Functions If b a, then b is a square root of a. The principal square root of a, designated
More informationIterative Methods for Eigenvalues of Symmetric Matrices as Fixed Point Theorems
Iterative Methods for Eigenvalues of Symmetric Matrices as Fixed Point Theorems Student: Amanda Schaeffer Sponsor: Wilfred M. Greenlee December 6, 007. The Power Method and the Contraction Mapping Theorem
More informationComputer Derivations of Numerical Differentiation Formulae. Int. J. of Math. Education in Sci. and Tech., V 34, No 2 (March-April 2003), pp
Computer Derivations o Numerical Dierentiation Formulae By Jon H. Matews Department o Matematics Caliornia State University Fullerton USA Int. J. o Mat. Education in Sci. and Tec. V No (Marc-April ) pp.8-87.
More informationAn Introduction to Multivariate Statistical Analysis
An Introduction to Multivariate Statistical Analysis Third Edition T. W. ANDERSON Stanford University Department of Statistics Stanford, CA WILEY- INTERSCIENCE A JOHN WILEY & SONS, INC., PUBLICATION Contents
More informationDo not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2013 14 CALCULUS AND MULTIVARIABLE CALCULUS MTHA4005Y Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.
More informationNumerical Optimization: Basic Concepts and Algorithms
May 27th 2015 Numerical Optimization: Basic Concepts and Algorithms R. Duvigneau R. Duvigneau - Numerical Optimization: Basic Concepts and Algorithms 1 Outline Some basic concepts in optimization Some
More informationMTH30 Review Sheet. y = g(x) BRONX COMMUNITY COLLEGE of the City University of New York DEPARTMENT OF MATHEMATICS & COMPUTER SCIENCE
BRONX COMMUNITY COLLEGE of the City University of New York DEPARTMENT OF MATHEMATICS & COMPUTER SCIENCE MTH0 Review Sheet. Given the functions f and g described by the graphs below: y = f(x) y = g(x) (a)
More information10. Trigonometric equations
0 EP-Program - Strisuksa School - Roi-et Math : Trigonometry () Dr.Wattana Toutip - Department of Mathematics Khon Kaen University 00 :Wattana Toutip wattou@kku.ac.th http://home.kku.ac.th/wattou 0. Trigonometric
More informationMath Spring 2014 Solutions to Assignment # 6 Completion Date: Friday May 23, 2014
Math 11 - Spring 014 Solutions to Assignment # 6 Completion Date: Friday May, 014 Question 1. [p 109, #9] With the aid of expressions 15) 16) in Sec. 4 for sin z cos z, namely, sin z = sin x + sinh y cos
More informationEquations Quadratic in Form NOT AVAILABLE FOR ELECTRONIC VIEWING. B x = 0 u = x 1 3
SECTION.4 Equations Quadratic in Form 785 In Eercises, without solving the equation, determine the number and type of solutions... In Eercises 3 4, write a quadratic equation in standard form with the
More informationLinear Independence. Stephen Boyd. EE103 Stanford University. October 9, 2017
Linear Independence Stephen Boyd EE103 Stanford University October 9, 2017 Outline Linear independence Basis Orthonormal vectors Gram-Schmidt algorithm Linear independence 2 Linear dependence set of n-vectors
More informationAP Calculus AB Syllabus
Introduction AP Calculus AB Syllabus Our study of calculus, the mathematics of motion and change, is divided into two major branches differential and integral calculus. Differential calculus allows us
More informationSection 3.7. Rolle s Theorem and the Mean Value Theorem
Section.7 Rolle s Theorem and the Mean Value Theorem The two theorems which are at the heart of this section draw connections between the instantaneous rate of change and the average rate of change of
More informationAP Calculus. Limits, Continuity, and Differentiability
AP Calculus Limits, Continuity, and Differentiability Student Handout 016 017 EDITION Click on the following link or scan the QR code to complete the evaluation for the Study Session https://www.surveymonkey.com/r/s_sss
More informationChapter 5 Notes. 5.1 Using Fundamental Identities
Chapter 5 Notes 5.1 Using Fundamental Identities 1. Simplify each expression to its lowest terms. Write the answer to part as the product of factors. (a) sin x csc x cot x ( 1+ sinσ + cosσ ) (c) 1 tanx
More informationUtah Math Standards for College Prep Mathematics
A Correlation of 8 th Edition 2016 To the A Correlation of, 8 th Edition to the Resource Title:, 8 th Edition Publisher: Pearson Education publishing as Prentice Hall ISBN: SE: 9780133941753/ 9780133969078/
More informationDiagnostic Tests. (c) (sa sb )(sa sb ) Diagnostic Test: Algebra
Diagnostic Tests Success in calculus depends to a large etent on knowledge of the mathematics that precedes calculus: algebra, analtic geometr, functions, and trigonometr. The following tests are intended
More informationUnit #9 - Definite Integral Properties, Fundamental Theorem of Calculus
Unit #9 - Definite Integral Properties, Fundamental Theorem of Calculus Definite Integrals in Modeling Some problems and solutions selected or adapted from Hughes-Hallett Calculus.. The rate at which the
More informationarxiv: v2 [math.gm] 3 Jan 2018
arxiv:1712.04414v2 [math.gm] 3 Jan 2018 Efficient computation of pi by the Newton Raphson iteration and a two-term Machin-like formula S. M. Abrarov and B. M. Quine January 3, 2018 Abstract In our recent
More informationSchool District of the Chathams
School District of the Chathams Curriculum Profile Program of Study: High School Mathematics Curriculum Course Title: Honors Precalculus Grade Level: Grade 11 I. Course Description Honors Precalculus is
More informationINSTRUCTOR SAMPLE E. Check that your exam contains 25 questions numbered sequentially. Answer Questions 1-25 on your scantron.
MATH 41 FINAL EXAM NAME SECTION NUMBER INSTRUCTOR SAMPLE E On your scantron, write and bubble your PSU ID, Section Number, and Test Version. Failure to correctly code these items may result in a loss of
More informationPoint Transformation. a ) + k. *see t-chart set-up* Given: + 1. T(x,y) = (x, -1y 4) T(x,y) = (3x + π, -2y + 1) Given: a = 1 h = 0 b = -1 k = -4 Thus,
Point Transformation T(x,y) = (ax + h, by + k) Given: y = cos x 4 y = bcos( x h a ) + k a = 1 h = 0 b = -1 k = -4 Thus, T(x,y) = (ax + h, by + k) T(x,y) = (1x + 0, -1y 4) T(x,y) = (x, -1y 4) Given: y =
More informationUse of Differential Equations In Modeling and Simulation of CSTR
Use of Differential Equations In Modeling and Simulation of CSTR JIRI VOJTESEK, PETR DOSTAL Department of Process Control, Faculty of Applied Informatics Tomas Bata University in Zlin nám. T. G. Masaryka
More informationHigh School Mathematics Honors PreCalculus
High School Mathematics Honors PreCalculus This is an accelerated course designed for the motivated math students with an above average interest in mathematics. It will cover all topics presented in Precalculus.
More informationToday. Introduction to optimization Definition and motivation 1-dimensional methods. Multi-dimensional methods. General strategies, value-only methods
Optimization Last time Root inding: deinition, motivation Algorithms: Bisection, alse position, secant, Newton-Raphson Convergence & tradeos Eample applications o Newton s method Root inding in > 1 dimension
More informationMath 117: Topology of the Real Numbers
Math 117: Topology of the Real Numbers John Douglas Moore November 10, 2008 The goal of these notes is to highlight the most important topics presented in Chapter 3 of the text [1] and to provide a few
More information