高斯迭代法源程序.doc

高斯迭代法源程序#include stdlib.h #include math.h #include stdio.h int agaus(a,b,n) int n; double a,b; int *js,l,k,i,j,is,p,q; double d,t; js=malloc(n*sizeof(int); l=1; for (k=0;k=n-2;k+) d=0.0; for (i=k;i=n-1;i+) for (j=k;jd) d=t; jsk=j; is=i; if (d+1.0=1.0) l=0; else if (jsk!=k) for (i=0;i=n-1;i+) p=i*n+k; q=i*n+jsk; t=ap; ap=aq; aq=t; if (is!=k) for (j=k;j=n-1;j+) p=k*n+j; q=is*n+j; t=ap; ap=aq; aq=t; t=bk; bk=bis; bis=t; if (l=0) free(js); printf(failn); return(0); d=ak*n+k; for (j=k+1;j=n-1;j+) p=k*n+j; ap=ap/d; bk=bk/d; for (i=k+1;i=n-1;i+) for (j=k+1;j=0;i-) t=0.0; for (j=i+1;j=0;k-) if (jsk!=k) t=bk; bk=bjsk; bjsk=t; free(js); return(1); main() int i; static double a44= 0.2368,0.2471,0.2568,1.2671, 0.1968,0.2071,1.2168,0.2271, 0.1581,1.1675,0.1768,0.1871, 1.1161,0.1254,0.1397,0.1490 ; static double b4=1.8471,1.7471,1.6471,1.5471; if (agaus(a,b,4)!=0) for (i=0;i=3;i+) printf(x(%d)=%en,i,bi); ./RootNewton.cpp Newton法求解非线性方程一个实根 #include /输入输出流头文件 #include polynomials.h /多项式及连分式求值头文件 #include NonLinearEquation.h /非线性方程(组)求解头文件 using namespace std; /名字空间 void main(void) int js = 60, k; long double eps = 0.000001, x = 1.5; cout RootNewton() endl = 0) cout k = k x = x endl; /* 计算函数及导数值 template void FunctionValueRN(_Ty dx, valarray& y) _Ty dCoff04 = -1, 0, -1, 1; _Ty dCoff13 = 0, -2, 3; valarray vdCoff0(dCoff0,4), vdCoff1(dCoff1,3); y0 = PolyValueOneDim(vdCoff0, 4, dx); /计算多项式值 y1 = PolyValueOneDim(vdCoff1, 3, dx); /计算多项式导数值 /RootQuasiNewton.cpp 拟牛顿法求解非线性方程组一组实根 #include /输入输出流头文件 #include polynomials.h /多项式及连分式求值头文件 #include NonLinearEquation.h /非线性方程(组)求解头文件 using namespace std; /名字空间 void main(void) int k = 100, i; double eps = 0.000001, x3 = 1.0, 1.0, 1.0, t = 0.1, h = 0.1; valarray vx(x, 3); cout RootQuasiNewton() endl endl; i = RootQuasiNewton(eps, t, h, vx, k); /求根 这个函数在chap8那个工程里面有 cout i = i endl endl; for(i = 0; i 3; i+) cout x( i ) = vxi endl; cout endl; /* 计算函数值 template void FunctionValueRSN(valarray& x, valarray& y) y0=x0*x0+x1*x1+x2*x2-1.0; /计算多项式f0函数值 y1=2.0*x0*x0+x1*x1-4.0*x2; /计算多项式f1函数值 y2=3.0*x0*x0-4.0*x1+x2*x2; /计算多项式f2函数值 拟牛顿法求非线性方程组的一组实数解#include stdlib.h #include math.h #include stdio.h int netn(n,eps,t,h,x,k,f) int n,k; double eps,t,h,x; void (*f)(); extern int rgauss(); int i,j,l; double am,z,beta,d,*y,*a,*b; y=malloc(n*sizeof(double); a=malloc(n*n*sizeof(double); b=malloc(n*sizeof(double); l=k; am=1.0+eps; while (am=eps) (*f)(x,b,n); am=0.0; for (i=0; iam) am=z; if (am=eps) l=l-1; if (l=0) free(y); free(b); free(a); printf(failn); return(0); for (j=0; j=n-1; j+) z=xj; xj=xj+h; (*f)(x,y,n); for (i=0; i=n-1; i+) ai*n+j=yi; xj=z; if (rgauss(n,a,b)=0) free(y); free(a); free(b); return(-1); beta=1.0; for (i=0; i=n-1; i+) beta=beta-bi; if (fabs(beta)+1.0=1.0) free(y); free(a); free(b); printf(failn); return(-2); d=h/beta; for (i=0; i=n-1; i+) xi=xi-d*bi; h=t*h; free(y); free(a); free(b); return(k-l); #include stdio.h #include netn.c #include rgauss.c main() int i,k; double eps,t,h; static double x3=1.0,1.0,1.0; void netnf(); t=0.1; h=0.1; eps=0.0000001; k=100; i=netn(3,eps,t,h,x,k,netnf); printf(n); printf(i=%dn,i); printf(n); for (i=0; i=2; i+) printf(x(%d)=%13.7en,i,xi); printf(n); void netnf(x,y,n) int n; double x,y; y0=x0*x0+x1*x1+x2*x2-1.0; y1=2.0*x0*x0+x1*x1-4.0*x2; y2=3.0*x0*x0-4.0*x1+x2*x2; n=n; return; #include stdlib.h #include math.h #include stdio.h int rgauss(n,a,b) int n; double a,b; int *js,l,k,i,j,is,p,q; double d,t; js=malloc(n*sizeof(int); l=1; for (k=0;k=n-2;k+) d=0.0; for (i=k;i=n-1;i+) for (j=k;jd) d=t; jsk=j; is=i; if (d+1.0=1.0) l=0; else if (jsk!=k) for (i=0;i=n-1;i+) p=i*n+k; q=i*n+jsk; t=ap; ap=aq; aq=t; if (is!=k) for (j=k;j=n-1;j+) p=k*n+j; q=is*n+j; t=ap; ap=aq; aq=t; t=bk; bk=bis; bis=t; if (l=0) free(js); printf(fai