#include <stdio.h>
#include <math.h>
#include <stdlib.h>
double xi[100];
double yi[100];
/*double f(double x,double y)
{
double z;
z=-x*(y*y);
return z;
}*/
/*
double f(double x,double y)
{
double z;
z=y-2.0*x/y;
return z;
}
*/
/*double f(double x,double y)
{
double z=-y+x+1;
return z;
}*/
double f(double x,double y)
{
double z=(-y+x*x+4*x-1)*0.5;
return z;
}
void Runge_Kutta(double x0,double y0,double h,double xn)
{
int i=0,n;
double k1,k2,k3,k4;
n=(int)((xn-x0)/h+0.0000001);
xi[0]=x0;
yi[0]=y0;
for(i=1;i<n;i++)
xi[i]=xi[i-1]+h;
for(i=1;i<n;i++)
{
k1=f(xi[i-1],yi[i-1]);
k2=f(xi[i-1]+h*0.5,yi[i-1]+k1*h*0.5);
k3=f(xi[i-1]+h*0.5,yi[i-1]+k2*h*0.5);
k4=f(xi[i-1]+h,yi[i-1]+k3*h);
yi[i]=yi[i-1]+h*(k1+2*k2+2*k3+k4)/6;
}
}
int main()
{
int i;
Runge_Kutta(0.0,0.0,0.05,0.5);
for(i=0;i<10;i++)
printf("%.8lf\n",yi[i]);
return 0;
}
算法——Runge_Kutta算法
最新推荐文章于 2023-03-21 23:00:31 发布