用定点迭代法求解该方程 [英] Solve this equation with fixed point iteration

问题描述

我怎么解决这个方程式

x ³ + x-1 = 0

x³ + x - 1 = 0

使用定点迭代吗?

我可以在网上找到任何定点迭代代码(尤其是在Python中)吗?

Is there any fixed-point iteration code (especially in Python) I can find online?

推荐答案

使用定义fixed_point的Python代码在scipy/optimize/minpack.py中.确切位置取决于scipy的安装位置.您可以通过输入

The Python code defining fixed_point is in scipy/optimize/minpack.py. The exact location depends on where scipy is installed. You can find that out by typing

In [63]: import scipy.optimize

In [64]: scipy.optimize
Out[64]: <module 'scipy.optimize' from '/usr/lib/python2.6/dist-packages/scipy/optimize/__init__.pyc'>

当前的fixed_point源代码可以通过转到

The current fixed_point source code can be found online by going to the documentation page and clicking the [source] link.

这篇关于用定点迭代法求解该方程的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！