Question: Please need help with c++ project. I not good at computer science. Please give clear and correct solutions to all parts. There are four pictures

Please need help with c++ project. I not good at computer science. Please give clear and correct solutions to all parts. There are four pictures total. If you are confused please ask me what exaclty you need to know. Please who ever helps is greatly appreciated thank you.  Please need help with c++ project. I not good at computer
science. Please give clear and correct solutions to all parts. There are
four pictures total. If you are confused please ask me what exaclty
you need to know. Please who ever helps is greatly appreciated thank

EEEE-346: ProjectI Halley's Method for Root Finding Fall 2017 Due: 10/25/2017 11.30 PM In this project we will be implementing the Halley's Method using C++ to find approximations of roots of functions. Recursive and iterative implementations of the Halley's Method will be explored and applied to simple functions. L. Background for Halley's Method In numerical analysis, Halley's method is a root-finding algorithm used for fiunctions of one real variable with a contimmous second derivative, ie., C functions. It is named after its inventor Edmond Halley. The algorithm is second in the class of Householder's methods, right after Halley's method. Like the latter, it produces iteratively a sequence of approximations to the root: their rate of couvergence to the root is cubic. Multidimensional versions of this method exist For the focus of this project we will only consider fimctions with respect to one variable. The basic concept of the Halley's method is outlined below 1. User generates an initial guess of the root. Should be reasonably close to the true root. 2The function is approximated by its tangent line and second derivative at the guess. 3. The x-intercept of the tangent line is computed by (1). to be used as a better approximation for the root 4. Steps 2 and 3 are repeated with the gness updated with the x-intercept value of the tangent. 5The method is terminated when the previous guess and new guess are considered nonchanging The recursive root finding function for Halley's mcthod is defined as The Halley's method is au iterative process that by description is recusive The recursion occurs by the method updating its guess at the root then re-calling the sanie niethod to better the gess. However. it is possible to convert this recursive method to an iterative loopinz) process. There are benefits of both implemeutatious recursive method is casict implement based ou descziptiou aud iterative if implaucnted conmectly can be faster II. Project Requirements

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!