一阶常微分返慕程的初值问题.pptVIP

Ordinary Differential Equations;一阶常微分方程的初值问题： 节点：x1x2 … xn 步长 为常数;一 欧拉方法（折线法） yi+1=yi+h f(xi,yi) (i =0,1, …, n-1) 优点：计算简单。 缺点：一阶精度。 二 改进的欧拉方法;改进的欧拉公式可改写为 它每一步计算f(x,y)两次，截断误差为O(h3);精确解：;三 龙格—库塔法(Runge-Kutta) 欧拉公式可改写为 它每一步计算 f (xi,yi) 一次，截断误差为O(h2) ;标准四阶龙格—库塔公式 每一步计算 f (x, y) 四次，截断误差为O(h5);对于两个分量的一阶常微分方程组;n 级显式Runge-Kutta 方法的一般计算格式：;#include stdio.h #include stdlib.h #include math.h #define TRUE 1 main() { int nstep_pr, j, k; float h, hh, k1, k2, k3, k4, t_old, t_limit, t_mid, t_new, t_pr, y, ya, yn; double fun(); printf( \n Fourth-Order Runge-Kutta Scheme \n ); while(TRUE){ printf( Interval of t for printing ?\n ); scanf( %f, t_pr ); printf( Number of steps in one printing interval?\n ); scanf( %d, nstep_pr ); printf( Maximum t?\n ); scanf( %f, t_limit ); y = 1.0; /* Setting the initial value of the solution */ h = t_pr/nstep_pr; printf( h=%g \n, h ); t_new = 0; /* Time is initialized. */ hh = h/2; printf( --------------------------------------\n ); printf( t y\n ); printf( --------------------------------------\n ); printf( %12.5f %15.6e \n, t_new, y );; do{ for( j = 1; j = nstep_pr; j++ ){ t_old = t_new; t_new = t_new + h; yn = y; t_mid = t_old + hh; yn = y; k1 = h*fun( yn, t_old ); ya = yn + k1/2; k2 = h*fun( ya, t_mid ); ya = yn + k2/2; k3 = h*fun( ya, t_mid ); ya = yn + k3 ; k4 = h*fun( ya, t_new ); y = yn + (k1 + k2*2 + k3*2 + k4)/6; } printf( %12.5f %15.6e \n, t_new, y ); } while( t_new = t_limit ); printf( --------------------------------------\n ); printf( Maximum t limit exceeded \n ); printf( Type 1 to continue, or 0 to stop.\n ); scanf( %d, k ); if(