资源列表
sourcecode
- 实现了卡尔曼滤波,该算法非常好用,实现了滤波的基本功能,希望大家下载-Implemented Kalman filter, the algorithm is very useful to realize the basic functions of filtering, I hope everyone downloads
MST
- 最小生成树的实现,算法思想源于《算法导论》-Implementation of the minimum spanning tree
wanshu
- 完数的简单代码,满足用户要求,实现简单,易于理解-Simple code number, to meet user requirements, to achieve a simple, easy to understand
PODeigenvaluecalculation
- 在获得流场直接模拟数据的机场上对流场做正规模态分解-Direct access to the flow field in the simulated flow field data airports do normal modal decomposition
poisson
- poisson.f90 是矩形区域上泊松方程Dirichlet边值问题差分求解的fortran程序,可选择Jacobi或者Gauss-Seidel迭代子程序,其中Jacobi迭代次数为925,Gauss-Seidel迭代次数为478。结果输出至solution.dat文件 poisson.ncl 是NCL脚本,运行该脚本得到的图为result.pdf thomas.f90 是追赶法解代数方程组的fortran程序。控制分辨率n的不同取值,输出以下文件: thomas(n=3).
OpenCVExamples
- The most useful examples of the application with opencv.-The most useful examples of the applicatio n with opencv.
countnew
- 统计文本文件中所需要的信息数量,生成新的文本文件-Statistics on a text file in the amount of information needed to generate a new text file
FixPoint_Library
- fixed point class library
quotient-set
- 判断集合A上的关系R是否为等价关系。若为等价关系,则输出集合A关于等价关系R的商集。-Judge whether the relationship R on set A is the equivalence relation. If it is the equivalence relation, then get quotient set of set A on the equivalence relationship R
Unary_polynomial
- 两个一元多项式相乘的算法,假设A(x)和B(x)为多项式,则M(x)=A(x)*B(x)其中,每一项都是一个一元多项式-Two unary polynomial multiplication algorithm, assume that A (x) and B (x) is polynomial, then M (x) = A (x)* B (x) which is a one dollar each polynomial
4.3
- 硬币找钱问题的解决方案,时间复杂度小,方法十分方便-Coin find money solution to the problem
