next up previous contents index
suivant: fsolve or nSolve with monter: Solve equations with fsolve précédent: fsolve or nSolve with   Table des matières   Index

fsolve or nSolve with the option falsepos_solver

The "false position" algorithm is an iterative algorithm based on linear interpolation : we compute the value of f at the intersection of the line (a, f (a)), (b, f (b)) with the x axis. This value gives us the part of the interval containing the root, and on which a new iteration is performed.
The convergence is linear but generically faster than bisection.
Input :
Output :

giac documentation written by Renée De Graeve and Bernard Parisse