资源列表
agr3
- 利用幂法求矩阵的最大特征值，还包括一些相应的辅助函数
jueCeShurar
- 这个是用来做决策树用的，很清楚的看出结构，可以看看哦-This is a decision tree used to make very clear to see the structure, you can see Oh
fft
- 傅立叶变换 1维和2维的变换 是学习傅立叶变换的好程序-fast fourier transform 1Dimension 2Dimension
lam
- 通过线性积分的方法实现一种有效的时程曲线积分-Achieved through the method of linear integral curves of an effective integration time
euler.runge-kutta
- 欧拉法，龙格库塔法解微分方程的m文件,代码比较简短，但效率挺高。-Euler, Runge-Kutta method for solving differential equations( m file)
Kmeans
- 利用java实现了k-means聚类，数据集是由Math.random函数产生的。-K-means clustering was achieved with Java.The data set was created by Math.random.
Newton
- 数值分析考试计算题，解题步骤Newton解方程-Numerical analysis exam calculation problems, problem-solving steps of solving equations Newton
fortran5
- 这是一些何光渝fortran书上的对应的源程序，对大家学习有好处，这是第五章的内容-Here are some fortran He Guangyu the corresponding source book for them to learn from good, this is the fifth chapter
RSdecoder_BMalgoritmus
- DECODED = RSDEC(CODE,N,K) attempts to decode the received signal in CODE using an (N,K) Reed-Solomon decoder with the narrow-sense generator polynomial. CODE is a Galois array of symbols over GF(2^m), where m is the number of bits per symb
MHJGHJGJGHFJ
- 题目：有n个人围成一圈，顺序排号。从第一个人开始报数（从1到3报数），凡报到3的人退出 圈子，问最后留下的是原来第几号的那位。 1. 程序分析： 2.程序源代码：-Topic: a n personal round into 1 turn, PaiHao order. From the first man began to count off (from 1 to 3 number off), all three of whom left the report Circl
qiufeixianxingfangchengzuzuixiaoerchengjiedeguangy
- 1.功能 利用广义逆求解无约束条件下的优化问题(C语言) 2.参数说明 int m : 非线性方程组中方程个数 int n : 非线性方程组中未知数个数 double eps1 : 控制最小二乘解的精度要求 double eps2 : 用于奇异值分解中的控制精度要求 double x[n] : 存放非线性方程组解的初始近似值X(0),要求各分量不全为0 int ka : Ka＝max{m,n}+1 void (*f)() : 指向计算非线性方程组中各方程
convnfft
- FFT based convolution