AOE_2074_Computer_Lab_6.pdf

AOE_2074_Computer_Lab_6.pdf

Info icon This preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Computer Lab #6 Objectives Review of Midterm Exam Part 2: Problem 3 (Root-Finding) Root-Finding and Optimization Understand how an optimization problem can be converted into a root-finding problem. You should have read Chapters 7.1 and 8 of the textbook. Reminder: In-Class Quiz Next Tuesday on Linear Algebra (read Chap. 8!)
Image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
2 Example Problem Description Apply (1) the fixed point iteration method and (2) the Newton-Raphson method for 2 iterations to find the root of Specifically, your MATLAB function should take as input: x0 : initial guess (for both methods) and output root_fixedpoint : the approximate root given by the fixed point iteration after 2 iterations . root_newton : the approximate root given by the Newton-Raphson method after 2 iterations .
Image of page 2