Download Solving x = tan x Using Fixed Point Iteration

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts
no text concepts found
Transcript
Solving x = tan x Using Fixed Point Iteration
MATH 3338 Numerical Analysis
Spring 2017
Teach 1, Part I due Feb. 7, 2017, Part II due Feb. 14, 2017
• In this problem we are asked to find the smallest positive root of
f (x) = tan x − x,
i.e., where x > 0 (as this excludes the trivial solution x = 0). We have several choices on
how to approach this problem. The solution can be obtained using any of several fixed point
iteration schemes, or it can be obtained by Newton’s method. Both of these approaches should
be examined.
• To obtain full marks for this project the writeup must include a discussion of the interval of
convergence of the method, and it must include a detailed report on the method or methods
used, the software, and all other pertinent information, i.e., it must be a full report (much like a
lab report). Part I is your first attempt, i.e., it is a draft submission, and this will be reviewed,
corrected, and returned for an opportunity to submit Part II which is due Feb. 14, 2017, i.e.,
the following week. It is Part II that will be graded as a group project.
• Reports may be done by groups of 3 to 4 students. The report must have a title page, and must
list the authors (the students who participated in the analysis and writing of the report), as well
as a bibliography.