| 释义 |
false position (rule of false position, regula falsi) An iterative method which usually converges faster than the bisection method. Say that f(a) > 0 > f(b) and we wish to approximate a root of f. The first iterate is x1 = (af(b)−bf(a))/(f(b)−f(a)); this is the x-value where the line connecting (a,f(a)) and (b,f(b)) crosses the x-axis. Depending on the sign of f(x1) this process is repeated on the interval [a, x1] or [x1,b] to find x2 and so on.
|