资源列表
Newton
- 用牛顿下山法求方程的近似解，并另付实验报告。-Newton descent method with the approximate solution of Equation, and the extra test report.
JINTUIFA
- 程序-进退法,是一种最优化算，可应用于求解最优化问题-Program- advance and retreat method, is considered one of the most optimized, can be used to solve optimization problems
HeapSimulation
- Heap Simulation in C#
GrafoMetro
- minimal path for a graph
AStar
- Quick AStar algorithm
dinospinicosahedron1
- 一个正二十面体的细分迭代工程,很漂亮,需要glut-an icosahedron is the breakdown of iterative engineering, and very pretty, needs glut
MATRIX99
- 含有各种矩阵的操作函数，可以实现各种矩阵运算的程序-Operation with a variety of matrix functions, matrix operations can achieve a variety of procedures
ag_matlab
- Genetic algorithm scheduler using matlab
MarkwardtIDL
- IDL版的Marquadt优化算法，可求解非线性最小二乘问题-MPFIT uses the Levenberg-Marquardt technique to solve the least-squares problem. In its typical use, MPFIT will be used to fit a user-supplied function (the "model") to user-supplied data points (the "da
PCA
- 应用主成分分析的方法实现数据降维，主成分个数通过累积方差贡献率的方法来确定-The principal component analysis of data dimensionality reduction, the number of principal components to determine the cumulative variance contribution rate
Newtons-method
- 關於牛頓法的計算，xn+1 初始值xn-(f(xn)/f (xn))，以及誤差判斷,每疊代一次，牛頓法結果的有效數字將增加一倍。-Newton on the calculation method, xn+1 initial value xn- (f (xn)/f ' (xn)), and an error judgment time, Newton' s method results significant figures will double every iteration.
AstarPath
- 经过改造与优化的A*算法， 求最短路径，能够标识出每一步寻找的结点。-After transformation and optimization of the A* algorithm, seeking the shortest path to identify each step of the search nodes.