用定点迭代求解这个等式

bbn*_*bnn 9 python equation nonlinear-functions numerical-analysis fixed-point-iteration

我怎样才能解决这个等式

x 3 + x - 1 = 0

使用定点迭代?

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

unu*_*tbu 12

使用scipy.optimize.fixed_point:

import scipy.optimize as optimize

def func(x):
    return -x**3+1

# This finds the value of x such that func(x) = x, that is, where
# -x**3 + 1 = x
print(optimize.fixed_point(func,0))
# 0.682327803828
Run Code Online (Sandbox Code Playgroud)

Python代码定义fixed_point在scipy/optimize/minpack.py中.确切位置取决于scipy安装位置.你可以通过输入找到它

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'>
Run Code Online (Sandbox Code Playgroud)

fixed_point通过转到文档页面并单击[source]链接,可以在线找到当前源代码.