weixin_43242836的博客

待更新#include <iostream>#include <vector>#include <math.h>using namespace std;typedef vector<vector<double>> Matrix;#define MAX 6void dispMatrix(Matrix m, int n); ...

待完善。。Cotes求积公式Simpson求积公式变步长梯形这里以Simpson求积流程作Sample：需要注意这里定义函数模板，Solve 第一个参数为函数名。typedef double (*Func)(int, double, double);vector<double> Solve(Func func, double a, double b);#inc...

高斯消去法#include <iostream>#include <vector>#include <math.h>using namespace std;typedef vector<vector<double>> Matrix;#define MAX 6void dispMatrix(Matrix m, int n); ...

#include <iostream>#include <vector>#include <math.h>using namespace std;#define eps 0.00001#define maxn 200typedef vector<vector<double>> Matrix;void dispRes(vect...

先用欧拉法求得一个初步的近似值，称为预报值，然后用它替代梯形法右端的yi+1再直接计算fi+1，得到校正值yi+1，这样就可以得到预报校正公式。{yp=yn+hf(xn,yn)yc=yn+hf(xn+1,yp)yn+1=12(yp+yc)\left\{\begin{array}{l}{y_{p}=y_{n}+h f\left(x_{n}, y_{n}\right)} \\ {y_{c}=y_{n...

#include <iostream>#include<iomanip>#include <vector>using namespace std;typedef vector<double> List;double aitken(List x, List y, double data);int main(){ int n; ...