Question

write an algorithm by using java code to find the approximate roots of the function using the fixed-point method

Answer 1

First, Define a function F(P0) that takes in a single input. This function will return the value of the mathematical function.

Then, Define the Main function as follows:

INPUTS GIVEN:

P0 = Initial approximation

T = Tolerance

N = Number of iterations

OUTPUT:

P = approximate root of the function

ALGORITHM:

Step 1: Set i = 1.

Step 2: While i < N, Follow Steps 3 through 6.

Step 3: Set P = F(P0).

Step 4: IF (|P - P0| < T), THEN break and PRINT P (P is the final answer).

Step 5: Set i = i + 1.

Step 6: Set P0 = P.

Step 7: IF (i > N), THEN PRINT "Method Failed"