使用正交多项式完成数据拟合。程序对读入的gps采样点完成曲线拟合。...

Kalman filter的C，C++及matlab程序-Kalman filter of the C, C++ and matlab programs

计算自然对数底数e的程序 可选不同位数 -calculation of natural causes a few e optional different procedures median

猴子吃桃的问题： 此程序是用递归做出来的，方法很简单-monkeys eat a peach : This procedure is done using the recursive method is very simple

98年全国大学生数学建模竞赛B题“水灾巡视问题”，是一个推销员问题，本题有53个点，所有可能性大约为exp(53),目前没有好方法求出精确解，既然求不出精确解，我们使用模拟退火法求出一个较优解,将所有结点编号为1到53,1到53的排列就是系统的结构,结构的变化规则是:从1到53的排列中随机选取一个子排列,将其反转或将其移至另一处,能量E自然是路径总长度。具体算法描述如下：步1： 设定初始温度T，给定一个初始的巡视路线。步2 ：步3 --8循环K次步3：步 4--7循环M次步4：随机选择路线的一段步5：随机确定将选定的路线反转或移动，即两种调整方式：反转、移动。步6：计算代价D，即调整前后的总路程的长度之差步7：按照如下规则确定是否做调整：如果D0,则按照EXP(-D/T)的概率进行调整步8:T*0.9-->T,降温-98 National Mathematical Contest in Modeling B and that the "flood inspections", is a salesman problem, and that is 53 points, all possibilities about exp (53), there is no good way to get accurate solutions, since no exact solution for, we used simulated annealing France obtained an optimum solution to all nodes to a number of 53 to 53.1 is with the system structure, changes in the structure of the rules is : from 1-53 with a randomly selected with a son, to reverse or to move it to another, the energy E is the natural path length. The specific algorithm is described as follows : Step 1 : The initial set temperature T,

C++常用数值算法 原代码 复化辛卜生公式-C++ Commonly used numerical algorithm of the original code complex formula辛卜Health

这是一个简单的c#编码，用于转换以下长度：

2400 bps MELP语音编解码器浮点算法.zip   

CUDA矩阵相乘A*B=C代码，任意输入矩阵A的宽度和矩阵B的宽度（A[wB][wA]*B[wA][wB]），cudaMallocPitch开辟显存空间，cudaMemcpy2D数组复制，Kahan"s Summation Formula提高浮点计算精度。

根据不同的生成多项，生成CRC的初始表值，包括CRC16，CRC-CCITT，CRC32-According to a number of different generation, CRC generation of the initial table values, including the CRC16, CRC-CCITT, CRC32

求极点零点,求出极点到单位圆上各点的向量的模,求出零点到单位圆上各点的向量的相角-seek to get round to the flat pole on the point of the vector mode to get round to the flat 0.1 points on the phase angle of Vector