We study the efficiency of the multisection method for univariate nonlinear equations, relative to that for the well-known bisection method. We show that there is a minimal effort algorithm that uses more sections than the bisection method, although this optimal algorithm is problem dependent. The number of sections required for optimality is determined by means of a Lambert W function.

翻译：本文研究了单变量非线性方程求解中多段法相较于经典二分法的效率。研究表明，存在一种使用比二分法更多分段的最小计算量算法，尽管该最优算法依赖于具体问题。最优分段数可通过朗伯W函数确定。