logo Hurry, Grab up to 30% discount on the entire course
Order Now logo
684 Times Downloaded

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Vishal SindhwalComputer science
(5/5)

978 Answers

Hire Me
expert
Alejandro PerryyTechnical writing
(5/5)

510 Answers

Hire Me
expert
Clifford BillmanBusiness
(5/5)

878 Answers

Hire Me
expert
Debra StephensonBusiness
(5/5)

528 Answers

Hire Me
MATLAB
(5/5)

need help with coding

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

need help with coding

 

 

1 Methods The problem is from the given function f(x), determine the root x ∗ such that f(x ∗ ) = 0 (1) Numerically, this equation may be approximated using a stopping tolerance . f(x ∗ ) <  (2) where  is close enough to zero. 1.1 Bisection Method The simplest method in root finding uses an interval [a, b] in the domain of the function where the bounds of the interval satisfy: f(a)f(b) < 0 (3) or in other words, f(a) and f(b) have opposing signs. The successive process finds the midpoint c bisecting the interval: c = a + b 2 (4) and tests if on that iteration, f(c) <  which implies that c is a root of f. On the other hand, if f(c) ≮ , then the bounds are reassigned. If f(c) has the similar sign with f(a), the next iteration uses the interval [c, b] and if f(c) has the similar sign with f(b), the next iteration uses the interval [a, c]. Note that this method requires that the function is continuous on the interval [a, b]. 1.2 Newton’s Method This method requires continuity as well since the derivative of the function is needed. Additionally, it also requires an initial guess x0 and repetitively determines the root using the formula xi+1 = xi − f(xi) f 0(xi) (5) and tests if on that iteration, f(xi+1) <  which implies that xi+1 is a root of f. 1.3 Secant Method Regarded as a quasi-Newton technique, this method is related to the previous one since f 0 (xi) ≈ f(xi) − f(xi−1) xi − xi−1 (6) and the difference between the two methods is that the secant method requires two initial guesses. Substitute this to the previous equation, xi+1 ≈ xi − f(xi)  f(xi)−f(xi−1) xi−xi−1  (7) which can be rewritten as xi+1 ≈ xi − f(xi)  xi − xi−1 f(xi) − f(xi−1)  (8) If on that iteration, f(xi+1) < , then xi+1 is a root of f.

(5/5)
Attachments:

Expert's Answer

684 Times Downloaded

Related Questions

. The fundamental operations of create, read, update, and delete (CRUD) in either Python or Java

CS 340 Milestone One Guidelines and Rubric  Overview: For this assignment, you will implement the fundamental operations of create, read, update,

. Develop a program to emulate a purchase transaction at a retail store. This  program will have two classes, a LineItem class and a Transaction class

Retail Transaction Programming Project  Project Requirements:  Develop a program to emulate a purchase transaction at a retail store. This

. The following program contains five errors. Identify the errors and fix them

7COM1028   Secure Systems Programming   Referral Coursework: Secure

. Accepts the following from a user: Item Name Item Quantity Item Price Allows the user to create a file to store the sales receipt contents

Create a GUI program that:Accepts the following from a user:Item NameItem QuantityItem PriceAllows the user to create a file to store the sales receip

. The final project will encompass developing a web service using a software stack and implementing an industry-standard interface. Regardless of whether you choose to pursue application development goals as a pure developer or as a software engineer

CS 340 Final Project Guidelines and Rubric  Overview The final project will encompass developing a web service using a software stack and impleme