-
BranchBound
branchbound就是所谓的分支定界算法，应用于动态规划解决实际问题(branchbound is called the branch and bound algorithm applied to the dynamic programming to solve practical problems)
- 2012-07-30 23:37:14下载
- 积分：1
-
double
线性方程组迭代解法,包括SOR，CG ，BICG等(linear system iteration solver)
- 2010-01-05 21:53:34下载
- 积分：1
-
Desktop
主要用于三次样条拟合，对离散点进行拟合插值，(Three order spline fitting)
- 2018-05-25 17:27:38下载
- 积分：1
-
mm
说明： 模糊模拟、神经网络以及遗传算法的结合，matlab程序(The combination of fuzzy simulation, neural network and genetic algorithm, matlab program)
- 2013-03-06 15:09:50下载
- 积分：1
-
interpolation
cressman格点插到格点程序，从一个场插值出另一个分辨率不同的场(interpolates fields to another grid as specified )
- 2013-08-25 21:53:45下载
- 积分：1
-
IMLS
点云曲面建模，基于距离函数，运用移动最小二乘法，拟合曲面，提取等值面，用于散乱点云的快速三角网格构建(Point cloud surface modeling, based on the distance function, the use of moving least squares method, fitting surface, isosurface extraction for fast scattered point cloud build triangular mesh)
- 2020-11-12 10:09:45下载
- 积分：1
-
program3
早期的圆柱绕流程序，用fortran语言编写，用来了解早期绕流流动的发展(flow around the cylinder)
- 2011-06-22 16:06:03下载
- 积分：1
-
[二次开发] ABAQUS-UMAT
说明： ABAQUS 的二次开发,详细注释说明，自学ABAQUS的二次开发(ABAQUS secondary development, detailed notes, self-study ABAQUS secondary development)
- 2020-01-01 22:55:42下载
- 积分：1
-
hartigansSLC_OpenCV
hartigans Sequential Leader Clustering Algorithm in terms of OpenCV (ver.1.1)
Sequential Leader algorithm:
Hartigan, J. A. (1975), Clustering Algorithms. John Wiley and Sons, Inc., New York, NY.
1. Select maximum cluster "radius"
2. Start with zero clusters
3. Add each item to be clustered to:
* Closest cluster if distance <= r
* New cluster if distance to closest cluster > r
4. Compute new center from members in cluster
5. Empty the clusters (keeping the centers)
6. Return to step 3 (until no changes are made)
- 2010-02-25 19:28:25下载
- 积分：1
-
vss-nlms
国外最近的一篇变步长nlms仿真，该文件有文中的几种仿真(Recent foreign nlms a variable step simulation, there is the text of the document of several simulation)
- 2013-07-15 10:00:03下载
- 积分：1
