中点公式.pptVIP

* * Quadrature 二阶: 中点公式: 梯形公式: 四阶公式: Simpson’s 1/3rd Rule Boole’s rule,The 6-th Newton-Cotes rule (the first step of Romberg integration) The extrapolated Simpson’s rule. #include stdio.h #include stdlib.h #include math.h #define TRUE 1 struct t_bc{float a, b, h;} bc; void main() { int isimp, k, n; float s; void simps(), trapz(); printf( \nComputer Soft/C7-1 Trapezoidal/Simpsons Rule \n\n ); while( TRUE ){ printf( Type 0 for trapezoidal, or 1 for Simpsons\n ); scanf( %d, isimp ); printf( Number of intervals ? ); scanf( %d, n ); printf( Lower limit of integration? ); scanf( %f, bc.a ); printf( Upper limit of integration? ); scanf( %f, bc.b ); bc.h = (bc.b - bc.a)/n; if( isimp == 0 ){ trapz( s, n ); /*-- Trapezoidal rule */ } else{ simps( s, n ); /*-- Simpsons rule */ } printf( -----------------------------------------\n ); printf( Result = %g \n, s ); printf( -----------------------------------------\n ); printf( \nType 1 to continue, or 0 to stop.\n); scanf( %d, k ); if( k != 1 ) exit(0); } } void simps(ss, n) /* Simpsons rule*/ float *ss; int n; { int i, ls; float sum, s, w, x; double func(); s = 0; sum = 0; if( n/2*2 == n ) ls = 0; else { ls = 3; for( i = 0; i = 3; i++ ) { /* Simpsons 3/8 rule if n is odd */ x = bc.a + bc.h*i; w = 3; if( i == 0 || i == 3 ) w = 1; sum = sum + w*func( x ); } sum = sum*bc.h*3/8L; if( n == 3 ) return; } for( i = 0; i = (n - ls); i++ ){ /* Simpsons 1/3 rule */ x = bc.a + bc.h*(i + ls); w = 2; if( (int)( i/2 )*2 + 1 == i ) w = 4; if( i == 0 || i == n - ls ) w = 1; s = s + w*func( x ); } *ss = sum + s*bc.h/3; return; } void trapz(ss, n) /* Trapezoidal rule */ float *ss; int