multiplication-table

说明：  这是LU分解法求线性方程组的资料，讲解了LU分解的原理及过程，非常实用(LU decomposition seeking linear equations to explain the principles and process of the LU decomposition, very practical)

针对传统的算法如遗传算法、粒子群算法等在TSP问题上求解精确性和求解规模上都还有一定的不足，本文提出了一种基于动态规划思想的粒子群优化算法。该算法用动态规划的方法实现粒子间的信息交互和粒子的进化，并且将粒子群中的粒子按无标度信息指导网络拓扑图的方式进行连接。仿真结果表明该方法能有效地减小误差率，提高解的精确，同时还保持了较低的计算复杂度，具有良好的稳健性。(TSP problem solving for the traditional algorithms such as genetic algorithms, particle swarm optimization accuracy and solving the scale, there is a certain lack of a dynamic programming algorithm-based particle swarm optimization algorithm. The algorithm using dynamic programming method to achieve the evolution of information exchange between the particles and the particles, and particle swarm particle scale-free information guide network topology map to connect. The simulation results show that this method can effectively reduce the error rate and improve the solution precision, while maintaining a low computational complexity, good soundness.)

传输矩阵法用于计算光纤光栅的有效折射率，是一种经典的数学算法(Matrix function)

MFC做的计算器程序，可以实现加减乘除。平方，立方等功能(MFC to do calculator program can be achieved subtraction multiplication and division. Square, cubic and other functions)

香农编码的C语言实现，VC++环境~~~~~~~~~~~~~~~~~~~~~~~~~(Shannon C-language coding, VC++ environment ~~~~~~~~~~~~~~~~~~~~~~~)

常用的算法设计策略(包括分治策略、动态规划、贪心策略、回溯法、随机算法等) 算法复杂度分析方法(计算迭代次数、使用递归方程、频度分析等) (Commonly used algorithm design strategies (including the strategy of divide and conquer, dynamic programming, greedy strategy, backtracking method, random algorithm) algorithm complexity analysis (number of iterations, using a recursive equation, frequency analysis, etc.))

基于热焓法的凝固传热模拟的UFluent-UDF程序(UDF for Modelling Soldification using Enthalpy Porosity Technique)

经典R-K法，通过它可以计算一些简单的常微分方程的数值解(Classical RK method, which can be calculated by simple numerical solution of ordinary differential equations)

说明：  Optics聚类算法 OPTICS没有显示地产生一个数据集合簇，它为自动和交互地聚类分析计算一个簇次序。这个次序代表了数据基于密度地聚类结构。它包含地信息，等同于从一个宽广地参数设置范围所获得的基于密度的聚类(Optics do not show clustering algorithm OPTICS to produce a collection of data clusters, it is automatically and interactively computing cluster analysis a cluster order. This order represents the data to cluster based on the density structure. It contains in information from a broadly equivalent range of parameters obtained by density-based clustering)

解线性方程组的迭代法 雅可比迭代、高斯—赛德尔迭代、超松弛迭代法 (Solving linear equations iterative method Jacobi iteration, Gauss- Seidel iteration SOR method)