代码搜索：Steffensen
找到约 21 项符合「Steffensen」的源代码
代码结果 21
www.eeworm.com/read/373458/9455000
m steffensen.m
%斯蒂芬森迭代法求解
%令x=(x^2+exp(x)+2)/3
x=1.5;
y=fun(x);
z=fun(y);
x1=x-(y-x)^2/(z-2*y+x);
while(abs(x1-x)>1e-6)
x=x1;
y=fun(x);
z=fun(y);
x1=x-(y-x)^2/(z-2*y+x);
end
b=x1;
fpr
www.eeworm.com/read/358192/10194118
m steffensen.m
%------------init------------------
x0=input('近似值：');
delta1=input('精度要求：');
delta2=3*delta1;
%---------------begin-------------
i=1;
while abs(x0-f(x0))>delta1
printf('这是第%d个解\n',i)
y
www.eeworm.com/read/146253/12662002
m steffensen.m
%斯蒂芬森迭代法求解
%令x=(x^2+exp(x)+2)/3
x=1.5;
y=fun(x);
z=fun(y);
x1=x-(y-x)^2/(z-2*y+x);
while(abs(x1-x)>1e-6)
x=x1;
y=fun(x);
z=fun(y);
x1=x-(y-x)^2/(z-2*y+x);
end
b=x1;
fpr
www.eeworm.com/read/320829/13417577
m steffensen.m
function X=steffensen(f,x0,n)
i=0;
X=x0;
y=feval(f,X);
z=feval(f,y);
x0=X-(y-X).^2/(z-2.*y+X);
while abs(X-x0)>0.1^(n+1)
X=x0;
y=feval(f,X);
z=feval(f,y);
x0=X-(y-X).^2/(z-2.*y+X
www.eeworm.com/read/483183/6611043
m steffensen.m
function x=Steffensen(f,x0,eps)
% Steffensen迭代方法，为加速迭代收敛的方法
% 比Picard的收敛要快
if nargin==2
eps=1e-5;
end
y1=f(x0);
z1=f(y1);
x1=x0-((y1-x0)^2)/(z1-2*y1+x0);
while abs((x1-x0))>eps
x0=x1
www.eeworm.com/read/213097/15142648
cpp steffensen加速.cpp
#include
#include
#include
using namespace std;
const double EPS=0.1e-16;
const int MN=50;
double f(double x)
{return x*x*x+4*x*x-10;}
double T(double x)
{return
www.eeworm.com/read/305001/13780593
txt steffensen迭代法.txt
Steffensen迭代法：
#include
#include
#include
double Steffensen(double);
int main()
{
cout
www.eeworm.com/read/483139/6610848
txt steffensen加速迭代法.txt
#include//Steffensen加速迭代法
#include
double f(double x);
double g(double x);
double ABS(double x);
double power(double x,int n);
void main()
{
double x,y;
cout
www.eeworm.com/read/434325/7874837
m steff.m
function [p,yp,err,Q] = steff(f,df,p0,delta,epsilon,max1)
%---------------------------------------------------------------------------
%STEFF Steffensen's method is used to locate a root.
% Sampl
www.eeworm.com/read/483183/6611050
m newtonsteffensen.m
function [x,n]=NewtonSteffensen(f,x0,eps)
% 比Newton迭代法，更快
% 利用了Steffensen加快收敛的方法
if nargin ==2
eps=1e-5;
end
g=inline(diff(sym(f))); % f 的导函数
y1=x0-f(x0)/g(x0);
z1=y1-f(y1)/g(y1);
x1=x0-(