Allows one to solve root finding approximation problems using various methods: Newton, secants, bisection, "regula falsi" (known as "false position") and successive approximations. The peculiarity of this program is that it display all the iterations (not just the solution!) with the number of significant digits chosen by the user. |