本实例计算结果为
计算次数1 x= 0.05 y = 1.04881
计算次数2 x= 0.1 y = 1.09545
计算次数3 x= 0.15 y = 1.14018
计算次数4 x= 0.2 y = 1.18322
计算次数5 x= 0.25 y = 1.22474
计算次数6 x= 0.3 y = 1.26491
计算次数7 x= 0.35 y = 1.30384
计算次数8 x= 0.4 y = 1.34164
计算次数9 x= 0.45 y = 1.3784
计算次数10 x= 0.5 y = 1.41421
计算次数11 x= 0.55 y = 1.44914
计算次数12 x= 0.6 y = 1.48324
计算次数13 x= 0.65 y = 1.51658
计算次数14 x= 0.7 y = 1.54919
计算次数15 x= 0.75 y = 1.58114
计算次数16 x= 0.8 y = 1.61245
计算次数17 x= 0.85 y = 1.64317
计算次数18 x= 0.9 y = 1.67332
计算次数19 x= 0.95 y = 1.70294
计算次数20 x= 1 y = 1.73205
可见 基本吻合
代码如下
#include <iostream>
#include <fstream>
#define Count 100 //计算次数
//#define ITEM 0.001 //计算精度
class Longkuta
{
public :
std::fstream fileopen;
Longkuta(double initx,double inity ,double inith ); // 初始计算点 步长
//~Longkuta();
void progess( );
bool write();
double fun(double x0,double y0); //此处定义函数
double x0 , y0, h ;
};
Longkuta::Longkuta(double initx,double inity ,double inith )
{
x0=initx;
y0=inity;
h=inith;
}
bool Longkuta::write( )
{
fileopen.open("data.txt",std::ios::app);
if (fileopen.is_open())
{
return true;
}
else
{
std::cout<<"文件打开失败\n";
return false;
}
}
void Longkuta::progess( )
{
int i = 1;
double K1,K2,K3,K4,y1,x1;
while ( i<Count)
{
x1 = x0+h;
K1=fun(x0,y0);
K2=fun(x0+h/2,y0+K1*h/2);
K3=fun(x0+h/2,y0+K2*h/2);
K4=fun(x1,y0+h*K3);
y1=y0+h*(K1+2*K2+2*K3+K4)/6.0;
fileopen<<"计算次数"<<i<<" " <<"x= "<<x1<<" y = "<<y1<<"\n";
x0=x1;
y0=y1;
i++;
//if ((y0-y1)>ITEM)
// break;
}
fileopen.close();
std::cout<<"计算结果为"<<y0;
}
double Longkuta::fun(double x0 ,double y0) //函数表达式
{
double dy;
dy = y0-(2*x0)/y0;
return dy;
}
int main()
{
Longkuta longkuta(0,1,0.05);
if (longkuta.write())
{
longkuta.progess();
}
else
std::cout<<"数据写入失败"<<std::endl;
return 0;
}