ECE580 Solution to Problem Set 4
|
|
- Karin Todd
- 5 years ago
- Views:
Transcription
1 ECE580 Fall 05 Solution to Problem Set 4 December 8, 05 ECE580 Solution to Problem Set 4 These problems are from the textbook by Chong and Zak, 4th edition, which is the textbook for the ECE580 Fall 05 semester. As such, many of the problem statements are taken verbatim from the text; however, others have been reworded for reasons of efficiency or instruction. Solutions are mine. Any errors are mine and should be reported to me, skoskie@iupui.edu, rather than to the textbook authors. Please note that in the interest of time, I have neglected the appropriate checks and algorithm terminations in the Matlab scripts. These have been presented in other homework solutions. 9. Let f : R R be given by f(x) = (x x 0 ) 4, where x 0 R is a constant. Apply Newton s method to identify a minimizer of f. (a) Determine the update equation. Solution: The update equation for Newton s algorithm is x (k+) = x (k) F(x (k) ) (x x (k) ). Thus, for this problem, the update equation is x (k+) = x (k) ((x (k) x 0 ) ) 4(x k x 0 ) 3, () = x (k) x(k) x 0, () 3 = (x (k) + x 0 )/3. (3) (b) Let y (k) = x (k) x 0. Show that integer k 0, y (k+) = y (k) /3. Solution: For arbitrary integer k y (k+) = x (k+) x 0 (4) = x (k) /3 + x 0 /3 x 0 = y (k) /3. (5) (c) Show that the sequence of x (k) values converges to x 0 for any x (0). Solution: The expression derived in part (b) for y (k) implies that the error at iteration k, y (k) = ( 3) k y (0), which goes to zero as k goes to infinity. (d) Show that the order of convergence of the sequence {x k } in part (b) is. Solution: Actually the sequence in part (b) is {y k }, which has convergence of order by Theorem 8.5. (e) Why does Theorem 9. not imply that convergence the sequence {x k } is of order? Solution: The theorem applies only when f C 3, f(x ) = 0 and F(x ) is invertible. While f(x ) = 0, F(x ) is zero, so not invertible.
2 ECE580 Fall 05 Solution to Problem Set 4 December 8, Application of Newton s Method Given (a) Determine the update equation. Solution: f(x) = x 4/3. Thus Newton s algorithm gives the update f (x) = 4 3 x/3 (6) F (x) = 4 9 x /3. (7) x (k+) = x (k) 9 4 (xk ) /3 4 3 (x(k) ) /3 = x (k) 3x (k) = x (k). (b) Show that unless x (0) = 0, the algorithm does not converge to the minimizer x = 0. Solution: Applying the algorithm repeatedly, we obtain x (k) = ( ) k k x (0), so the magnitude of x (k) increases without bound as k goes to infinity. 0.0 Given f(x) = 5 x + x + x x 3x x. (a) Express f(x) in terms of a quadratic matrix equation. Solution: f(x) = [ ] [ ] [ ] 5 x x x [ ] [ 3 x x x (b) Find the minimizer using the conjugate gradient algorithm with x (0) = 0. Solution: Using the Matlab script x0 = [0 0] ; Q = [5 ; ]; b = [3 ] ; xk = x0; Q*xk -b dk = -gk for index = :0, disp([ Index,numstr(index)]) ak = -(gk *dk)/(dk *Q*dk) xk = xk+ak*dk Q*xk - b bk = (gk *Q*dk)/(dk *Q*dk) dk = -gk+bk*dk end; ].
3 ECE580 Fall 05 Solution to Problem Set 4 December 8, 05 3 we obtain the following results, which we have truncated at the point that the gradient becomes small. >> p0p0-3 - dk = 3 Index ak = 0.74 xk = bk = dk =
4 ECE580 Fall 05 Solution to Problem Set 4 December 8, Index ak = xk = e-5 * Note that the minimizer has been found on the second iteration. (c) Find the minimizer analytically. Solution: The minimizer is simply [ x = Q b = 5 ] [ 3 ] = [.5 Use the rank-one correction algorithm to minimize the function f(x) == [ ] [ ] [ ] 0 x x x [ ] [ ] x 0 x x + 7, starting with x (0) = 0. Solution The Matlab script x0 = [0 0] ; Q = [ 0;0 ]; b = [ -] ; xk = x0; ].
5 ECE580 Fall 05 Solution to Problem Set 4 December 8, 05 5 H0 = eye(); Hk = H0; Q*xk -b for index = :3, disp([ Index,numstr(index)]) dk = -Hk*gk ak = -(gk *dk)/(dk *Q*dk) xk = xk+ak*dk dxk = ak*dk d Q*xk - b - gk Q*xk - b Hk = Hk + (dxk - Hk*dgk)*(dxk - Hk*dgk) /(dgk *(dxk - Hk*dgk)) end; yields the result >> pp5 - Index dk = - ak = xk =
6 ECE580 Fall 05 Solution to Problem Set 4 December 8, 05 6 dxk = d Hk = Index dk = ak = xk = dxk =
7 ECE580 Fall 05 Solution to Problem Set 4 December 8, d Again, the minimizer was found on the second iteration..8 Consider the function f(x) = x 4 /4 + x / x x + x x. (a) Plot the level sets of f at the levels 0.7, 0.6, 0., 0.5, and locate the minimizers from the plot. Solution: Using the Matlab commands >> [X,Y] = meshgrid(-:0.:, -:0.:3); >> Z = X.^4/4+Y.^/ -X.*Y +X-Y; >> V = [-0.7, -0.6, -0., 0.5, ]; >> contour(x, Y, Z, V) >> text(-.5,, c = ) >> text(-.5,, c = 0.5 ) >> text(-0.5,.5, c = -0. ) >> text(-,.5, c = -0.6 ) >> text(-,0, c = -0.7 ) >> title( Problem -8 ECE580 Fall 05 ) >> ylabel( f(x) ) >> ylabel( x_ ) >> xlabel( x_ ) >> text(-.7,.7, Level Sets of f(x) ) >> print -depsc pp8a >>
8 ECE580 Fall 05 Solution to Problem Set 4 December 8, 05 8 generates the plot shown in Figure. From these, I surmise that the minimizers are near (, 0), and (, ). 3 Problem 8 ECE580 Fall 05.5 Level Sets of f(x) c =.5 c = 0. x c = c = c = x Figure : Level Sets for Problem.8 (b) Use the DFP algorithm to minimize the function. A bare bones script that implements the DFP algorithm to solve this problem is given below: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% %%%%% ECE569 Fall 05, IUPUI %%%%% Comparison of DFP algorithm performance for two initial %%%%% condiitons Problem.8 of Chong and Zak 4th ed. %%%%% c. 05 S. Koskie %%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% clear all x0 = [0;0]; % initial condition H0 = eye(); alpk = 0.5; xk = x0; Hk = H0; x = xk(); x = xk(); [4*x^3/4 - x + ;... x - x - ]
9 ECE580 Fall 05 Solution to Problem Set 4 December 8, 05 9 index = 0 while norm(gk) > 0^(-5), index = index + ; disp([ Index,numstr(index)]) dk = -Hk*gk alpk = 0.5; d = dk(); d = dk(); for iindex = :5, % Newton s method used to find optimizal alpha disp([ Iindex,numstr(iindex)]) f = d - d + d*(x + alpk*d)^3 - d*(x + alpk*d)... - d*(x + alpk*d) + d*(x + alpk*d) F = 3*d^*(x + alpk*d)^ - *d*d + d^ alpk = alpk - f/f end; if alpk < 0, alpk = 0; end; xk = xk+alpk*dk x = xk(); x = xk(); dxk = alpk*dk d [4*x^3/4 - x + ;... x - x - ]-gk [4*x^3/4 - x + ;... x - x - ] Hk = Hk + (dxk*dxk )/(dxk *dgk) - ((Hk*dgk)*(Hk*dgk) )/(dgk *Hk*dgk) end; f = d - d + d*(x + alpk*d)^3 - d*(x + alpk*d)... - d*(x + alpk*d) + d*(x + alpk*d) disp([ alpha(k) =,numstr(alpk)]) disp([ (x*,x*) = (,numstr(x),,,numstr(x), ) ]) disp([ f(x) =,numstr(f)]) (i) Case x 0 = 0. Solution: The matlab script finds the miminizer (, 0). f(, 0) = 6.934e 09. [ ].5 (ii) Case x 0 =. Solution: The matlab script finds the miminizer (, ). f(, ) = 5.659e 0. c 05 S. Koskie
ECE580 Partial Solution to Problem Set 3
ECE580 Fall 2015 Solution to Problem Set 3 October 23, 2015 1 ECE580 Partial Solution to Problem Set 3 These problems are from the textbook by Chong and Zak, 4th edition, which is the textbook for the
More informationECE580 Solution to Problem Set 3: Applications of the FONC, SONC, and SOSC
ECE580 Spring 2016 Solution to Problem Set 3 February 8, 2016 1 ECE580 Solution to Problem Set 3: Applications of the FONC, SONC, and SOSC These problems are from the textbook by Chong and Zak, 4th edition,
More informationECE580 Solution to Problem Set 6
ECE580 Fall 2015 Solution to Problem Set 6 December 23 2015 1 ECE580 Solution to Problem Set 6 These problems are from the textbook by Chong and Zak 4th edition which is the textbook for the ECE580 Fall
More informationECE 680 Modern Automatic Control. Gradient and Newton s Methods A Review
ECE 680Modern Automatic Control p. 1/1 ECE 680 Modern Automatic Control Gradient and Newton s Methods A Review Stan Żak October 25, 2011 ECE 680Modern Automatic Control p. 2/1 Review of the Gradient Properties
More informationHomework Assignment 3
ECE382/ME482 Fall 2008 Homework 3 Solution October 20, 2008 1 Homework Assignment 3 Assigned September 30, 2008. Due in lecture October 7, 2008. Note that you must include all of your work to obtain full
More informationQuasi-Newton Methods
Newton s Method Pros and Cons Quasi-Newton Methods MA 348 Kurt Bryan Newton s method has some very nice properties: It s extremely fast, at least once it gets near the minimum, and with the simple modifications
More informationECE580 Exam 2 November 01, Name: Score: / (20 points) You are given a two data sets
ECE580 Exam 2 November 01, 2011 1 Name: Score: /100 You must show ALL of your work for full credit. This exam is closed-book. Calculators may NOT be used. Please leave fractions as fractions, etc. I do
More informationMATH 4211/6211 Optimization Quasi-Newton Method
MATH 4211/6211 Optimization Quasi-Newton Method Xiaojing Ye Department of Mathematics & Statistics Georgia State University Xiaojing Ye, Math & Stat, Georgia State University 0 Quasi-Newton Method Motivation:
More informationMA/OR/ST 706: Nonlinear Programming Midterm Exam Instructor: Dr. Kartik Sivaramakrishnan INSTRUCTIONS
MA/OR/ST 706: Nonlinear Programming Midterm Exam Instructor: Dr. Kartik Sivaramakrishnan INSTRUCTIONS 1. Please write your name and student number clearly on the front page of the exam. 2. The exam is
More informationEE363 homework 2 solutions
EE363 Prof. S. Boyd EE363 homework 2 solutions. Derivative of matrix inverse. Suppose that X : R R n n, and that X(t is invertible. Show that ( d d dt X(t = X(t dt X(t X(t. Hint: differentiate X(tX(t =
More informationGUIDED NOTES 2.5 QUADRATIC EQUATIONS
GUIDED NOTES 5 QUADRATIC EQUATIONS LEARNING OBJECTIVES In this section, you will: Solve quadratic equations by factoring. Solve quadratic equations by the square root property. Solve quadratic equations
More informationLecture 5b: Starting Matlab
Lecture 5b: Starting Matlab James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University August 7, 2013 Outline 1 Resources 2 Starting Matlab 3 Homework
More informationFALL 2018 MATH 4211/6211 Optimization Homework 4
FALL 2018 MATH 4211/6211 Optimization Homework 4 This homework assignment is open to textbook, reference books, slides, and online resources, excluding any direct solution to the problem (such as solution
More informationJanuary 18, 2008 Steve Gu. Reference: Eta Kappa Nu, UCLA Iota Gamma Chapter, Introduction to MATLAB,
Introduction to MATLAB January 18, 2008 Steve Gu Reference: Eta Kappa Nu, UCLA Iota Gamma Chapter, Introduction to MATLAB, Part I: Basics MATLAB Environment Getting Help Variables Vectors, Matrices, and
More information2D Plotting with Matlab
GEEN 1300 Introduction to Engineering Computing Class Meeting #22 Monday, Nov. 9 th Engineering Computing and Problem Solving with Matlab 2-D plotting with Matlab Script files User-defined functions Matlab
More informationGUIDED NOTES 5.6 RATIONAL FUNCTIONS
GUIDED NOTES 5.6 RATIONAL FUNCTIONS LEARNING OBJECTIVES In this section, you will: Use arrow notation. Solve applied problems involving rational functions. Find the domains of rational functions. Identify
More informationSF2822 Applied nonlinear optimization, final exam Saturday December
SF2822 Applied nonlinear optimization, final exam Saturday December 5 27 8. 3. Examiner: Anders Forsgren, tel. 79 7 27. Allowed tools: Pen/pencil, ruler and rubber; plus a calculator provided by the department.
More informationMATH 235/W08: Orthogonality; Least-Squares; & Best Approximation SOLUTIONS to Assignment 6
MATH 235/W08: Orthogonality; Least-Squares; & Best Approximation SOLUTIONS to Assignment 6 Solutions to questions 1,2,6,8. Contents 1 Least Squares and the Normal Equations*** 2 1.1 Solution...........................................
More informationNATIONAL UNIVERSITY OF SINGAPORE PC5215 NUMERICAL RECIPES WITH APPLICATIONS. (Semester I: AY ) Time Allowed: 2 Hours
NATIONAL UNIVERSITY OF SINGAPORE PC55 NUMERICAL RECIPES WITH APPLICATIONS (Semester I: AY 0-) Time Allowed: Hours INSTRUCTIONS TO CANDIDATES. This examination paper contains FIVE questions and comprises
More information446 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 informationHomework 3 Conjugate Gradient Descent, Accelerated Gradient Descent Newton, Quasi Newton and Projected Gradient Descent
Homework 3 Conjugate Gradient Descent, Accelerated Gradient Descent Newton, Quasi Newton and Projected Gradient Descent CMU 10-725/36-725: Convex Optimization (Fall 2017) OUT: Sep 29 DUE: Oct 13, 5:00
More informationNonlinear Programming
Nonlinear Programming Kees Roos e-mail: C.Roos@ewi.tudelft.nl URL: http://www.isa.ewi.tudelft.nl/ roos LNMB Course De Uithof, Utrecht February 6 - May 8, A.D. 2006 Optimization Group 1 Outline for week
More informationIntegration - Past Edexcel Exam Questions
Integration - Past Edexcel Exam Questions 1. (a) Given that y = 5x 2 + 7x + 3, find i. - ii. - (b) ( 1 + 3 ) x 1 x dx. [4] 2. Question 2b - January 2005 2. The gradient of the curve C is given by The point
More informationSOLUTIONS to Exercises from Optimization
SOLUTIONS to Exercises from Optimization. Use the bisection method to find the root correct to 6 decimal places: 3x 3 + x 2 = x + 5 SOLUTION: For the root finding algorithm, we need to rewrite the equation
More informationS(c)/ c = 2 J T r = 2v, (2)
M. Balda LMFnlsq Nonlinear least squares 2008-01-11 Let us have a measured values (column vector) y depent on operational variables x. We try to make a regression of y(x) by some function f(x, c), where
More informationSolutions to Homework 8 - Continuous-Time Markov Chains
Solutions to Homework 8 - Continuous-Time Markov Chains 1) Insurance cash flow. A) CTMC states. Since we assume that c, d and X max are integers, while the premiums that the customers pay are worth 1,
More informationMethods that avoid calculating the Hessian. Nonlinear Optimization; Steepest Descent, Quasi-Newton. Steepest Descent
Nonlinear Optimization Steepest Descent and Niclas Börlin Department of Computing Science Umeå University niclas.borlin@cs.umu.se A disadvantage with the Newton method is that the Hessian has to be derived
More informationNumerical Methods I Solving Nonlinear Equations
Numerical Methods I Solving Nonlinear Equations Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 October 16th, 2014 A. Donev (Courant Institute)
More information18.085, PROBLEM SET 1 SOLUTIONS
18.085, PROBLEM SET 1 SOLUTIONS Question 1. (20 pts.) Using odd values of n, the error is on the order of machine precision, about 10 16, for smaller values of n. We expect this because we are doing finite
More informationHomework 1 Solutions
18-9 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 18 Homework 1 Solutions Part One 1. (8 points) Consider the DT signal given by the algorithm: x[] = 1 x[1] = x[n] = x[n 1] x[n ] (a) Plot
More informationLecture 44. Better and successive approximations x2, x3,, xn to the root are obtained from
Lecture 44 Solution of Non-Linear Equations Regula-Falsi Method Method of iteration Newton - Raphson Method Muller s Method Graeffe s Root Squaring Method Newton -Raphson Method An approximation to the
More informationD(f/g)(P ) = D(f)(P )g(p ) f(p )D(g)(P ). g 2 (P )
We first record a very useful: 11. Higher derivatives Theorem 11.1. Let A R n be an open subset. Let f : A R m and g : A R m be two functions and suppose that P A. Let λ A be a scalar. If f and g are differentiable
More informationECE580 Exam 1 October 4, Please do not write on the back of the exam pages. Extra paper is available from the instructor.
ECE580 Exam 1 October 4, 2012 1 Name: Solution Score: /100 You must show ALL of your work for full credit. This exam is closed-book. Calculators may NOT be used. Please leave fractions as fractions, etc.
More information5 Quasi-Newton Methods
Unconstrained Convex Optimization 26 5 Quasi-Newton Methods If the Hessian is unavailable... Notation: H = Hessian matrix. B is the approximation of H. C is the approximation of H 1. Problem: Solve min
More information1. Background: The SVD and the best basis (questions selected from Ch. 6- Can you fill in the exercises?)
Math 35 Exam Review SOLUTIONS Overview In this third of the course we focused on linear learning algorithms to model data. summarize: To. Background: The SVD and the best basis (questions selected from
More informationTrust Regions. Charles J. Geyer. March 27, 2013
Trust Regions Charles J. Geyer March 27, 2013 1 Trust Region Theory We follow Nocedal and Wright (1999, Chapter 4), using their notation. Fletcher (1987, Section 5.1) discusses the same algorithm, but
More informationNumerical Analysis Preliminary Exam 10 am to 1 pm, August 20, 2018
Numerical Analysis Preliminary Exam 1 am to 1 pm, August 2, 218 Instructions. You have three hours to complete this exam. Submit solutions to four (and no more) of the following six problems. Please start
More informationMEI STRUCTURED MATHEMATICS CONCEPTS FOR ADVANCED MATHEMATICS, C2. Practice Paper C2-C
MEI Mathematics in Education and Industry MEI STRUCTURED MATHEMATICS CONCEPTS FOR ADVANCED MATHEMATICS, C Practice Paper C-C Additional materials: Answer booklet/paper Graph paper MEI Examination formulae
More informationMath 551 Homework Assignment 3 Page 1 of 6
Math 551 Homework Assignment 3 Page 1 of 6 Name and section: ID number: E-mail: 1. Consider Newton s method for finding + α with α > 0 by finding the positive root of f(x) = x 2 α = 0. Assuming that x
More informationECE580 Fall 2015 Solution to Midterm Exam 1 October 23, Please leave fractions as fractions, but simplify them, etc.
ECE580 Fall 2015 Solution to Midterm Exam 1 October 23, 2015 1 Name: Solution Score: /100 This exam is closed-book. You must show ALL of your work for full credit. Please read the questions carefully.
More informationFast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding
Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding Fourier Series & Transform Summary x[n] = X[k] = 1 N k= n= X[k]e jkω
More informationVector Fields and Solutions to Ordinary Differential Equations using MATLAB/Octave
Vector Fields and Solutions to Ordinary Differential Equations using MATLAB/Octave Andreas Stahel 5th December 27 Contents Vector field for the logistic equation 2 Solutions of ordinary differential equations
More informationAn Iterative Descent Method
Conjugate Gradient: An Iterative Descent Method The Plan Review Iterative Descent Conjugate Gradient Review : Iterative Descent Iterative Descent is an unconstrained optimization process x (k+1) = x (k)
More informationFast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding
Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding J. McNames Portland State University ECE 223 FFT Ver. 1.03 1 Fourier Series
More informationComputer Labs for. Differential Equations & Linear Algebra
Computer Labs for Differential Equations & Linear Algebra Contents Preface............................... i Lab 1: Slope Fields and Solution Curves................. 1 Lab 2: Numerical Methods of Euler...................
More informationBME I5000: Biomedical Imaging
1 BME I5000: Biomedical Imaging Lecture FT Fourier Transform Review Lucas C. Parra, parra@ccny.cuny.edu Blackboard: http://cityonline.ccny.cuny.edu/ Fourier Transform (1D) The Fourier Transform (FT) is
More informationSecond Order Optimization Algorithms I
Second Order Optimization Algorithms I Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye Chapters 7, 8, 9 and 10 1 The
More information(6.2) -The Shooting Method for Nonlinear Problems
(6.2) -The Shooting Method for Nonlinear Problems Consider the boundary value problems (BVPs) for the second order differential equation of the form (*) y f x,y,y, a x b, y a and y b. When f x,y,y is linear
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 informationLecture 11. Advanced Dividers
Lecture 11 Advanced Dividers Required Reading Behrooz Parhami, Computer Arithmetic: Algorithms and Hardware Design Chapter 15 Variation in Dividers 15.3, Combinational and Array Dividers Chapter 16, Division
More informationChapter 1: Introduction
Chapter 1: Introduction Definition: A differential equation is an equation involving the derivative of a function. If the function depends on a single variable, then only ordinary derivatives appear and
More informationMATHEMATICS FOR COMPUTER VISION WEEK 8 OPTIMISATION PART 2. Dr Fabio Cuzzolin MSc in Computer Vision Oxford Brookes University Year
MATHEMATICS FOR COMPUTER VISION WEEK 8 OPTIMISATION PART 2 1 Dr Fabio Cuzzolin MSc in Computer Vision Oxford Brookes University Year 2013-14 OUTLINE OF WEEK 8 topics: quadratic optimisation, least squares,
More informationHomework 3 Solutions
18-290 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 2018 Homework 3 Solutions Part One 1. (25 points) The following systems have x(t) or x[n] as input and y(t) or y[n] as output. For each
More informationMath Introduction to Numerical Methods - Winter 2011 Homework 2 Assigned: Friday, January 14, Due: Thursday, January 27,
Math 371 - Introduction to Numerical Methods - Winter 2011 Homework 2 Assigned: Friday, January 14, 2011. Due: Thursday, January 27, 2011.. Include a cover page. You do not need to hand in a problem sheet.
More informationChapter 4. Unconstrained optimization
Chapter 4. Unconstrained optimization Version: 28-10-2012 Material: (for details see) Chapter 11 in [FKS] (pp.251-276) A reference e.g. L.11.2 refers to the corresponding Lemma in the book [FKS] PDF-file
More informationThursday 14 June 2012 Morning
Thursday 14 June 01 Morning A GCE MATHEMATICS (MEI) 4757 Further Applications of Advanced Mathematics (FP3) QUESTION PAPER *471575061* Candidates answer on the Printed Answer Book. OCR supplied materials:
More informationBACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES
No. of Printed Pages : 5 BCS-054 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 058b9 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES Time : 3 hours Maximum Marks
More informationThe Conjugate Gradient Method
The Conjugate Gradient Method Jason E. Hicken Aerospace Design Lab Department of Aeronautics & Astronautics Stanford University 14 July 2011 Lecture Objectives describe when CG can be used to solve Ax
More informationEE 3025 S2010 Demo 10 Apr 19-20, Reading Assignment: Read Sections 9.5 and of the EE 3025 Matlab Notes.
EE 3025 S2010 Demo 10 Apr 19-20, 2010 Reading Assignment: Read Sections 9.5 and 10.1-10.5 of the EE 3025 Matlab Notes. Part I(25 min): Matlab Part II(25 min): Worked Problems on Chap 10 1 Matlab 1.1 Estimating
More informationMath Numerical Analysis Mid-Term Test Solutions
Math 400 - Numerical Analysis Mid-Term Test Solutions. Short Answers (a) A sufficient and necessary condition for the bisection method to find a root of f(x) on the interval [a,b] is f(a)f(b) < 0 or f(a)
More informationHomework 6 MA/CS 375, Fall 2005 Due December 15
Homework 6 MA/CS 375, Fall 25 Due December 5 This homework will count as part of your grade so you must work independently. It is permissible to discuss it with your instructor, the TA, fellow students,
More informationCSE 250a. Assignment Noisy-OR model. Out: Tue Oct 26 Due: Tue Nov 2
CSE 250a. Assignment 4 Out: Tue Oct 26 Due: Tue Nov 2 4.1 Noisy-OR model X 1 X 2 X 3... X d Y For the belief network of binary random variables shown above, consider the noisy-or conditional probability
More informationLOWELL WEEKLY JOURNAL. ^Jberxy and (Jmott Oao M d Ccmsparftble. %m >ai ruv GEEAT INDUSTRIES
? (») /»» 9 F ( ) / ) /»F»»»»»# F??»»» Q ( ( »»» < 3»» /» > > } > Q ( Q > Z F 5
More informationCOMP 558 lecture 18 Nov. 15, 2010
Least squares We have seen several least squares problems thus far, and we will see more in the upcoming lectures. For this reason it is good to have a more general picture of these problems and how to
More informationMath 263 Assignment #4 Solutions. 0 = f 1 (x,y,z) = 2x 1 0 = f 2 (x,y,z) = z 2 0 = f 3 (x,y,z) = y 1
Math 263 Assignment #4 Solutions 1. Find and classify the critical points of each of the following functions: (a) f(x,y,z) = x 2 + yz x 2y z + 7 (c) f(x,y) = e x2 y 2 (1 e x2 ) (b) f(x,y) = (x + y) 3 (x
More informationChapter 8 Linear Algebraic Equations
PowerPoint to accompany Introduction to MATLAB for Engineers, Third Edition William J. Palm III Chapter 8 Linear Algebraic Equations Copyright 2010. The McGraw-Hill Companies, Inc. This work is only for
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 informationQuasi-Newton methods for minimization
Quasi-Newton methods for minimization Lectures for PHD course on Numerical optimization Enrico Bertolazzi DIMS Universitá di Trento November 21 December 14, 2011 Quasi-Newton methods for minimization 1
More informationContraction Mappings Consider the equation
Contraction Mappings Consider the equation x = cos x. If we plot the graphs of y = cos x and y = x, we see that they intersect at a unique point for x 0.7. This point is called a fixed point of the function
More informationHomework 2. Matthew Jin. April 10, 2014
Homework Matthew Jin April 10, 014 1a) The relative error is given by ŷ y y, where ŷ represents the observed output value, and y represents the theoretical output value. In this case, the observed output
More informationME451 Kinematics and Dynamics of Machine Systems
ME451 Kinematics and Dynamics of Machine Systems Introduction to Dynamics Newmark Integration Formula [not in the textbook] December 9, 2014 Dan Negrut ME451, Fall 2014 University of Wisconsin-Madison
More informationLinear Models in Machine Learning
CS540 Intro to AI Linear Models in Machine Learning Lecturer: Xiaojin Zhu jerryzhu@cs.wisc.edu We briefly go over two linear models frequently used in machine learning: linear regression for, well, regression,
More informationComputational Foundations of Cognitive Science
Computational Foundations of Cognitive Science Lecture 14: Inverses and Eigenvectors in Matlab; Plotting and Graphics Frank Keller School of Informatics University of Edinburgh keller@inf.ed.ac.uk February
More informationBOUNDARY VALUE PROBLEMS
BOUNDARY VALUE PROBLEMS School of Mathematics Semester 1 2008 OUTLINE 1 REVIEW 2 BOUNDARY VALUE PROBLEMS 3 NEWTONS SHOOTING METHOD 4 SUMMARY OUTLINE 1 REVIEW 2 BOUNDARY VALUE PROBLEMS 3 NEWTONS SHOOTING
More informationLecture Note 7: Iterative methods for solving linear systems. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 7: Iterative methods for solving linear systems Xiaoqun Zhang Shanghai Jiao Tong University Last updated: December 24, 2014 1.1 Review on linear algebra Norms of vectors and matrices vector
More informationLecture 7 Unconstrained nonlinear programming
Lecture 7 Unconstrained nonlinear programming Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University,
More informationEE364a Homework 8 solutions
EE364a, Winter 2007-08 Prof. S. Boyd EE364a Homework 8 solutions 9.8 Steepest descent method in l -norm. Explain how to find a steepest descent direction in the l -norm, and give a simple interpretation.
More informationMatrix Derivatives and Descent Optimization Methods
Matrix Derivatives and Descent Optimization Methods 1 Qiang Ning Department of Electrical and Computer Engineering Beckman Institute for Advanced Science and Techonology University of Illinois at Urbana-Champaign
More information10725/36725 Optimization Homework 4
10725/36725 Optimization Homework 4 Due November 27, 2012 at beginning of class Instructions: There are four questions in this assignment. Please submit your homework as (up to) 4 separate sets of pages
More informationMatlab Instruction Primer; Chem 691, Spring 2016
1 Matlab Instruction Primer; Chem 691, Spring 2016 This version dated February 10, 2017 CONTENTS I. Help: To obtain information about any instruction in Matlab 1 II. Scripting 1 III. Loops, determine an
More informationReview all the activities leading to Midterm 3. Review all the problems in the previous online homework sets (8+9+10).
MA109, Activity 34: Review (Sections 3.6+3.7+4.1+4.2+4.3) Date: Objective: Additional Assignments: To prepare for Midterm 3, make sure that you can solve the types of problems listed in Activities 33 and
More information16.31 Homework 2 Solution
16.31 Homework Solution Prof. S. R. Hall Issued: September, 6 Due: September 9, 6 Problem 1. (Dominant Pole Locations) [FPE 3.36 (a),(c),(d), page 161]. Consider the second order system ωn H(s) = (s/p
More informationNumerical Analysis Comprehensive Exam Questions
Numerical Analysis Comprehensive Exam Questions 1. Let f(x) = (x α) m g(x) where m is an integer and g(x) C (R), g(α). Write down the Newton s method for finding the root α of f(x), and study the order
More informationTwo hours. To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER. 29 May :45 11:45
Two hours MATH20602 To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER NUMERICAL ANALYSIS 1 29 May 2015 9:45 11:45 Answer THREE of the FOUR questions. If more
More informationTu: 9/3/13 Math 471, Fall 2013, Section 001 Lecture 1
Tu: 9/3/13 Math 71, Fall 2013, Section 001 Lecture 1 1 Course intro Notes : Take attendance. Instructor introduction. Handout : Course description. Note the exam days (and don t be absent). Bookmark the
More informationName: Instructor: 1. a b c d e. 15. a b c d e. 2. a b c d e a b c d e. 16. a b c d e a b c d e. 4. a b c d e... 5.
Name: Instructor: Math 155, Practice Final Exam, December The Honor Code is in effect for this examination. All work is to be your own. No calculators. The exam lasts for 2 hours. Be sure that your name
More informationHomework 2 - Solutions MA/CS 375, Fall 2005
Homework 2 - Solutions MA/CS 375, Fall 2005 1. Use the bisection method, Newton s method, and the Matlab R function fzero to compute a positive real number x satisfying: sinh x = cos x. For each of the
More informationNotes on floating point number, numerical computations and pitfalls
Notes on floating point number, numerical computations and pitfalls November 6, 212 1 Floating point numbers An n-digit floating point number in base β has the form x = ±(.d 1 d 2 d n ) β β e where.d 1
More informationSolving nonlinear equations (See online notes and lecture notes for full details) 1.3: Newton s Method
Solving nonlinear equations (See online notes and lecture notes for full details) 1.3: Newton s Method MA385 Numerical Analysis September 2018 (1/16) Sir Isaac Newton, 1643-1727, England. Easily one of
More informationExponential of a nonnormal matrix
Exponential of a nonnormal matrix Mario Berljafa Stefan Güttel February 2015 Contents 1 Introduction 1 2 Running RKFIT with real data 1 3 Evaluating the rational approximant 3 4 Some other choices for
More informationL bor y nnd Union One nnd Inseparable. LOW I'LL, MICHIGAN. WLDNHSDA Y. JULY ), I8T. liuwkll NATIdiNAI, liank
G k y $5 y / >/ k «««# ) /% < # «/» Y»««««?# «< >«>» y k»» «k F 5 8 Y Y F G k F >«y y
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 informationMATH 552 Spectral Methods Spring Homework Set 5 - SOLUTIONS
MATH 55 Spectral Methods Spring 9 Homework Set 5 - SOLUTIONS. Suppose you are given an n n linear system Ax = f where the matrix A is tridiagonal b c a b c. A =.........,. a n b n c n a n b n with x =
More informationContents. % Abdulmalik Almeheini % MATH246 extracredit HW % problems 6 and 8 from sec 9.3
Contents First (stationary/critical point locations) : Second: now we solve for the eigen values for the systems to show how the stability of these points change as alpha change % Abdulmalik Almeheini
More informationINTRODUCTION, FOUNDATIONS
1 INTRODUCTION, FOUNDATIONS 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 Information
More informationIowa State University. Instructor: Alex Roitershtein Summer Homework #1. Solutions
Math 501 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 015 EXERCISES FROM CHAPTER 1 Homework #1 Solutions The following version of the
More informationECE531 Homework Assignment Number 2
ECE53 Homework Assignment Number 2 Due by 8:5pm on Thursday 5-Feb-29 Make sure your reasoning and work are clear to receive full credit for each problem 3 points A city has two taxi companies distinguished
More informationQuadratic Optimization over a Polyhedral Set
International Mathematical Forum, Vol. 9, 2014, no. 13, 621-629 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2014.4234 Quadratic Optimization over a Polyhedral Set T. Bayartugs, Ch. Battuvshin
More informationCS 323: Numerical Analysis and Computing
CS 323: Numerical Analysis and Computing MIDTERM #2 Instructions: This is an open notes exam, i.e., you are allowed to consult any textbook, your class notes, homeworks, or any of the handouts from us.
More informationIMPACT OF PLANT COUPLING ON DECENTRALIZED PI CONTROL LAW. Date: 08/30/2016
IMPACT OF PLANT COUPLING ON DECENTRALIZED PI CONTROL LAW Date: 8/3/216 1 / 37 Standard Negative Feedback System With Pre-Filter d i input disturbance d o output disturbance r reference command W Pre-Filter
More information