Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

As an optional assignment in a Numerical Analysis class I have the task of creating a hybrid root finding algorithm that uses both the Secant and Bisection method. I have only started learning about numerical methods so I am unsure of what is the deciding factor that makes me switch from Bisection to Secant and vice versa while the program is running? What is the condition(s) I should be looking for?

share|cite|improve this question
up vote 2 down vote accepted

You could try something similar to Dekker's method by doing both secant and bisection and then choosing the better one for the next iteration.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.