Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Write a Java program that has the following inputs and outputs: Bisection To find a solution to f(x)0 given the continuous function f on the

Write a Java program that has the following inputs and outputs:

image text in transcribed

Bisection To find a solution to f(x)0 given the continuous function f on the interval [a, b], where f(a) and f (b) have opposite signs: INPUT endpoints a, b; tolerance TOL; maximum number of iterations No OUTPUT approximate solution p or message of failure. Step 1 Seti FA= f(a). Step 2 While i No do Steps 3-6. Step 3 Set p a(b - a/2: (Compute p.) FP = f(p). Step 4 If FP = 0 or (b-a)/2 0 then set a = p; (Compute ai, bi.) else set b p. (FA is unchanged.) Step 7 OUTPUT ('Method failed after No iterations, No ' No: FA = FP (The procedure was unsuccessful.) STOP Bisection To find a solution to f(x)0 given the continuous function f on the interval [a, b], where f(a) and f (b) have opposite signs: INPUT endpoints a, b; tolerance TOL; maximum number of iterations No OUTPUT approximate solution p or message of failure. Step 1 Seti FA= f(a). Step 2 While i No do Steps 3-6. Step 3 Set p a(b - a/2: (Compute p.) FP = f(p). Step 4 If FP = 0 or (b-a)/2 0 then set a = p; (Compute ai, bi.) else set b p. (FA is unchanged.) Step 7 OUTPUT ('Method failed after No iterations, No ' No: FA = FP (The procedure was unsuccessful.) STOP

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Intelligent Information And Database Systems Asian Conference Aciids 2012 Kaohsiung Taiwan March 2012 Proceedings Part 2 Lnai 7197

Authors: Jeng-Shyang Pan ,Shyi-Ming Chen ,Ngoc-Thanh Nguyen

2012th Edition

3642284892, 978-3642284892

More Books

Students also viewed these Databases questions

Question

List the nodes in decision trees.

Answered: 1 week ago