我怎样才能找到一个数的立方根以有效的方式？ 我觉得可以用牛顿迭代法，但我不知道怎么去猜测最初的解决方案编程，以尽量减少迭代次数。

How can I find the cube root of a number in an efficient way? I think Newton-Raphson method can be used, but I don't know how to guess the initial solution programmatically to minimize the number of iterations.

推荐答案

这是一个看似复杂的问题。 这里是一些很好的调查可行的办法。

This is a deceptively complex question. Here is a nice survey of some possible approaches.