#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;
}
void GJEuler(double x0,double y0,double h,double xn)
{
int i=0,n;
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++)
{
yi[i]=yi[i-1]+h*0.5*(f(xi[i-1],yi[i-1])+f(xi[i],yi[i-1]+h*f(xi[i-1],yi[i-1])));
}
}
int main()
{
int i;
GJEuler(0.0,1,0.1,1.0);
for(i=0;i<10;i++)
printf("%.4lf\n",yi[i]);
return 0;
}
算法——改进欧拉算法
最新推荐文章于 2022-05-05 14:25:15 发布