搜索资源列表
gaojingdu
- 高精度算法，属于处理大数字的数学计算方法。在一般的科学计算中,会经常算到小数点后几百位或者更多，当然也可能是几千亿几百亿的大数字。一般这类数字我们统称为高精度数，高精度算法是用计算机对于超大数据的一种模拟加,减,乘,除,乘方,阶乘,开方等运算。对于非常庞大的数字无法在计算机中正常存储，于是，将这个数字拆开，拆成一位一位的，或者是四位四位的存储到一个数组中， 用一个数组去表示一个数字，这样这个数字就被称谓是高精度数。高精度算法就是能处理高精度数各种运算的算法。 -High-precision
Huffman
- 运用赫夫曼编码的最优前缀码的贪心算法构造huffman树： 首先扫描输入文件，统计出现的字符以及每个字符出现的次数。每次取出现次数最小的那两个节点(node)合并成一个节点(node)，并且将累计数值相加作为新的接点的累计数值，最顶层的是根节点(root) -Huffman coding using optimal prefix code of the greedy algorithm constructs huffman tree: First, scan the input file,
Newton
- 1、使用牛顿法求sqrt（2）； 2、用牛顿法求 fx=(x-1)*(exp(x-1)-1)的误差以及误差比； 3、用牛顿法及其他两种方法求 fx=x^4-4*x+x^2的重根 -1, using Newton' s method for the sqrt (2) 2, using Newton' s method for the fx = (x-1)* (exp (x-1)-1) error and error ratio 3, using Newton
gongyingshui
- 一个用matlab编写的供应水的程序，用时将data.txt文件放于D盘根目录下，或更改程序中文件的当前指向。-A supply of water using matlab program, with the data.txt file will be placed under the root directory in D, or change the program files in the current point.
raised_cosine_filter
- Root raised cosine filter implementation in matlab, with graphs of impulse and frequency response.
code
- processing medical image,input is medical image,and output is the a txt file,contents the distance between cells and bone trabecula,to use this code,please change the root to yours which contents your pictures you want to deal with.
test
- processing medical image,input is medical image,and output is the a txt file,contents the distance between cells and bone trabecula,to use this code,please change the root to yours which contents your pictures you want to deal with.
cubic_nak
- Cubic spline interpolation used in the robotic root generation
statistic_errors
- 统计格点数据文件A和文件B中物理量间的相关系数，平均误差，均方根误差，绝对误差。-Statistics grid data file A and file B, the correlation between physical quantities, the average error, root mean square error, absolute error.
A-hybrid-least-squares
- A hybrid least squares support vector machines and GMDH approach for river fl ow forecasting-This paper proposes a novel hybrid forecasting model, which combines the group method of data handling (GMDH) and the least squares supp
lab2
- programme in matlab - aproximation 1D & 2D- using square root method-programme in matlab - aproximation 1D & 2D- using square root method
a!Pb!Pc!
- 这个是C++的小实验，可求a!+b!+c!，牛顿迭代法求方程根的问题-We can find a!+ b!+ c!，method for the root of the problem equation
RedBlackT
- Construct Red black Tree using cmd, reading from the left(root) top=right, bottom=left
heap
- 这是关于heap的程序，他可以实现heap的插入 删除 保存 输出等-this programming can realize the function of the heap ，include the insertion new element of the heap， delete the root element of heap，the function of heap sort ，and print the deleted element，save the root and so o
math_calculate
- 二分法，Newton迭代法和弦截法求方程根，并比较迭代次数。内含各种迭代法及数值加速方法的说明和比较。-Dichotomy, Newton iteration method for the equation of the root chord section, and compare the number of iterations. Includes a variety of accelerated iterative method and numerical descr iption of
cholesky
- 平方根法程序 输入变量为一个n阶正定矩阵A，输出的结果为下三角矩阵L-Square root law procedures
Binary-tree-traversal-algorithm
- 二叉树的遍历有常用的三种方法，分别是：先根次序、中根次序、后根次序。为了验证这几种遍历算法的区别，本次的实验将会实现所有的算法。 遍历的时候，把结点的信息打印出来，为了让结点的信息更容易区别，在每个结点前加上数字标识。如：data[1]=A,data[2]=B. 实现的算法皆为递归算法 -Binary tree traversal has used three methods, namely: first, the root sequence, the order of the ro
binary-tree
- 返回二叉树的根+返回树中某个结点的左孩子，若无则返回空+返回树中某个结点的双亲，如果是根结点，则返回空-Returns the binary tree root+ returns tree in a node of the left child, if there is no return null+ returns tree in a node s parents, if the root node, it returns null
Newton-search-algorithm
- 使用Matlab coder生成Cpp文件与VC++混合编程实现牛顿搜索算法求n次方根。Matlab使用2011a版本。-Use Matlab coder generates Cpp files with VC++ mixed programming algorithm for n-th Newton root search. Matlab using 2011a version.
ReBEL-0.2.7
- 包括kf，ekf，pf，upf可以自己定制模型参数，完成滤波-ReBEL currently contains most of the following functional units which can be used for state-, parameter- and joint-estimation: Kalman filter Extended Kalman filter Sigma-Point Kalman filters (SPKF) Unscented