False Position Program

Procedure

  1. Modify an existing program (or write a new program) to apply the False Position algorithm to the equation:
            cox x - x = 0
  2. Choice of programming language is yours.
  3. Organize the program as:
    1. Input Prompt the user for:
      • The two initial X values
      • The acceptable tolerance
      • The maximum number of iterations
    2. Processing: Apply the False Position algorithm.
    3. Output: Report to the user
      • Success or failure
      • The number of steps used
      • The final X value
      • The final Y value
  4. Use the program to find a root of the equation in the interval (.5, π/4).
  5. Use a calculator to verify the root.
  6. Compare your output to Table 2.6, page 71. 
  7. Submit the source code and an executable file as discussed in class.

Reference Links

C Now Bisection Algorithm in C
C++ Now Bisection Algorithm in C++
FORTRAN Now Bisection Algorithm in FORTRAN
Java Now Bisection Algorithm in Java