9--高斯列选主元算法

#include "stdio.h"#include "math.h"#include "conio.h" #define N 3static double aa[N][N] = {{1,2,-1} , {1,-1,5} , {4,1,-2}};static double bb[N+1] = {3,0,2}; void main(){ int i,j; double a[N+1][N+1] , b[N+1] ; double x[N+1] ; double det; double gaussl(double a[][N+1] , double b[], doubl...
2008-05-10 21:21 | 阅读 728 次 | 评论 0 条

8--正割法算法

#include "stdio.h"#include "conio.h"#include "math.h"#define MaxK 1000#define EPS 0.5e-8double f(double x) {return x*x*x - x - 1 ;}void main(){ double x0 = 1, x1 = 2; int ZhengGe(double (*f)(double) , double &x0 ,double &x1,double eps); if(ZhengGe(f,x0,x1,EPS) == 1 ) printf...
2008-05-10 21:20 | 阅读 937 次 | 评论 0 条

7--牛顿下山法

#include "stdio.h"#include "conio.h"#include "math.h"#include "stdlib.h" #define Et 1e-3 /* 下山因子下界 */#define E1 1e-3 /* 根的误差限 */#define E2 1e-3 /* 残量精度 */ double f(double x) { return x*x*x - x - 1;} /* f(x)的表达式 */double f1(double x) { return 3*x*x - 1;} /* f(x)的导数 */ void main(){ int...
2008-05-10 21:19 | 阅读 883 次 | 评论 0 条

6-牛顿切线法

#include "stdio.h"#include "math.h"#define MaxK 1000#define EPS 0.5e-3double f( double x ){ return x*x*x - x - 1;}double f1( double x ) { return 3*x*x - 1;}void main(){ double x = 1.5; int newton( double(*)(double), double(*)(double), double &x0 ,double); if( newton(f,f1,x,EPS) == 1 ...
2008-05-10 21:12 | 阅读 1007 次 | 评论 1 条

5-埃特金加速迭代算法

#include "stdio.h"#include "conio.h"#include "math.h"#define MaxK 100 /*最大迭代次数*/#define EPS 0.5e-3double g(double x){ return x*x*x-1;} /*迭代函数*/int aitken(double (*g)(double), double &x, double eps){ double yk,zk,xk; int i=0; printf("k\t\t xk\t\t\t yk\t\t zk\t\t xk+1\n"); printf("...
2008-05-10 21:10 | 阅读 868 次 | 评论 0 条

4-龙贝格求积算法

#include "stdio.h"#include "conio.h"#include "math.h"#define EPS 1e-6 double f(double x) { return 4/(1+x*x); } double Romberg(double a,double b,double(*f)(double),double eps){ int i , m , n=1 , j=1 ; double h , sum , p ; double T[10][10]; h = (b-a)/2; T[0][0] = h*( f(a) + f(b) ...
2008-05-10 21:08 | 阅读 766 次 | 评论 0 条

3-自适应梯形求积公式

#include "stdio.h"#include "conio.h"#include "math.h"#define EPS 1e-6 main(){ double s; double f(double); double AutoTrap(double(*)(double),double,double,double); s = AutoTrap(f , 0.0 , 1.0, EPS); getch();} double f(double x) { return 4/(1+x*x);} /* f(x)表达式 */ double AutoTrap(d...
2008-05-10 21:07 | 阅读 1010 次 | 评论 0 条

2-牛顿插值法

#include "stdio.h"#include "conio.h"#define N 4static double x[N+1]={0.4,0.55,0.8,0.9,1};static double y[N+1]={0.41075,0.57815,0.88811,1.02652,1.17520};void main(){ double varx,f[N+1][N+1]; int checkvalid ( double x[],int n); void Print(double x[], double y[],double f[][N+1]); void ch...
2008-05-10 21:05 | 阅读 773 次 | 评论 0 条

1-拉格朗日插值法

#include "stdio.h"#include "conio.h"#define N 4main(){ double x[N+1] = {0.4, 0.55, 0.8, 0.9, 1}; double y[N+1] = {0.41075, 0.57815, 0.88811, 1.02652, 1.17520}; double varx = 0.5; int checkvalid ( double x[], int n ); double Lagrange (double x[], double y[], double varx, int n ); ...
2008-05-10 21:03 | 阅读 951 次 | 评论 0 条
文章分类
文章归档