False Position Program in Calculator Ti84

The false position method, also known as the regula falsi algorithm, is an iterative technique for finding successively better approximations to the root of a real-valued function. This guide explains how to implement this method on your TI-84 calculator using a custom program.

What is the False Position Method?

The false position method is a root-finding algorithm that uses linear interpolation to find successively better approximations to the root of a function. Unlike the bisection method, it uses the function values at the endpoints to determine the next approximation.

Formula

The false position method uses the following formula to estimate the next approximation:

x_n+1 = x_n - f(x_n) * (x_n - x_n-1) / (f(x_n) - f(x_n-1))

The method requires an initial interval [a, b] where f(a) and f(b) have opposite signs (i.e., f(a) * f(b) < 0). The algorithm then iteratively narrows down the interval until the root is found within a specified tolerance.

Programming the False Position Method on TI-84

To implement the false position method on your TI-84 calculator, you'll need to create a custom program. Here's a step-by-step guide to programming this method:

Press the PRGM key and select NEW to create a new program.
Name the program (e.g., FALSEPOS).
Enter the following code:

:Prompt X1
:Prompt X2
:Prompt TOL
:Prompt N
:ClrDraw
:0->I
:Lbl 1
:I+1->I
:If I>N
:Disp "MAX ITERATIONS"
:Stop
:End
:f(X1)->Y1
:f(X2)->Y2
:If Y1*Y2>0
:Disp "NO ROOT IN INTERVAL"
:Stop
:End
:X2-Y2*(X2-X1)/(Y2-Y1)->X3
:f(X3)->Y3
:Disp "ITERATION:",I
:Disp "X:",X3
:Disp "F(X):",Y3
:If abs(Y3)<TOL
:Disp "ROOT FOUND:",X3
:Stop
:End
:If Y1*Y3<0
:X3->X2
:Else
:X3->X1
:End
:Goto 1

This program prompts you to enter the initial interval [X1, X2], the tolerance (TOL), and the maximum number of iterations (N). It then iteratively applies the false position method to find the root of the function f(x).

Customizing the Function

Before running the program, you need to define the function f(x) that you want to find the root for. You can do this by creating a separate program or by entering the function directly in the home screen.

For example, to find the root of f(x) = x² - 4, you would first define the function:

:Func
:Define Y1=X^2-4

Example Calculation

Let's walk through an example of using the false position method to find the root of f(x) = x² - 4 between x = 1 and x = 3 with a tolerance of 0.0001 and a maximum of 10 iterations.

Enter the program FALSEPOS and press ENTER.
When prompted, enter 1 for X1 and 3 for X2.
Enter 0.0001 for TOL and 10 for N.
The calculator will display the iterations and the current approximation of the root.
After a few iterations, the calculator will display "ROOT FOUND: 2.0000" (the actual root is √4 = 2).

This example demonstrates how the false position method efficiently narrows down the interval to find the root of the function.

FAQ

What is the difference between the false position method and the bisection method?: The false position method uses linear interpolation to estimate the next approximation, while the bisection method simply bisects the interval. The false position method typically converges faster but may not always converge to the root.
When should I use the false position method?: The false position method is useful when you have a continuous function and you know an interval that contains the root. It's particularly effective when the function is not too complex and the root is not too close to one of the endpoints.
What happens if the function does not have a root in the given interval?: The program will display "NO ROOT IN INTERVAL" if the function values at the endpoints have the same sign. This indicates that there is no root in the interval or that the function is not continuous in the interval.
How can I modify the program to work with different functions?: You can modify the program by changing the function definition. Simply replace the function f(x) in the program with the function you want to find the root for. Make sure the function is defined before running the program.