资源列表
gaussfinal
- 高斯法迭代，用于数值分析，数值计算，计算机专业课程-Gauss
KnightTour
- 骑士周游问题，国际象棋中骑士走遍所有的格子，而且不重复的走法。尝试算法。-Knight tour problem, the international chess knights traveled in all of the lattice, and not repeat the moves. Try algorithm.
Lebenber_Marquart
- Lebenber Marquart algorithm
NET-To-ANSYS
- 有限元转换程序，用于将生成的有限元网格结点数据与商业软件ANSYS相结合，方便在ANSYS中修改单元的材料-Finite element conversion program for finite element mesh nodes will generate data and commercial software ANSYS combination, easy to modify the unit material in ANSYS
Equation
- 大型对称方程组解算（Fortran90）： 共轭梯度法、高斯消元法和平方根法-Large symmetric linear solver (Fortran90): conjugate gradient method, Gaussian elimination and the square root method
inner_IALM_constraints
- 通过不精确的ALM算法，解析出张量矩阵中的低秩部分和稀疏部分。-via the Inexact ALM method will solve the programming.
rk
- 常微分方程的龙格库塔法系列程序，从二级到四级的算法。-Ordinary Differential Equations Runge - Kutta method series of procedures, from two to four algorithms.
simpson
- 复化辛普森算法，用于在数值计算中对计算误差做出估计。
TriInt
- 在有限元的计算中，常需要用到三角形区域上的积分，以及右端函数和基函数乘后的积分，本代码中以上两种均可计算，可精确到想要求的精度-Finite element calculations, often require the integration on the triangle area, as well as the right end of the function and the basis function multiplied Points, this code can calculat
ant
- 蚁群算法是经典的优化智能算法，能找到的最短路径。-The ant colony optimization algorithm is the classic intelligent algorithm can find the shortest path.
sdf_fft_64pt_tb
- 64 pt fft tb sdf pipelined
Viterbi
- The Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of hidden states – called the Viterbi path – that results in a sequence of observed events, especially in the context of Markov information sources and hidd