shuiku-tiao-hong-

说明：  这是一个ACM试题中的算法，叫分而治之算法，上面有PPT还有实例代码，希望喜欢ACM的同学可以喜欢(This is a Question in the ACM algorithm, called divide and conquer algorithms, there are examples of the code above, there are PPT hope that students like to be like the ACM)

利用拉格朗日松弛法求解机组组合问题，考虑领域搜索的随机性(Using Lagrangian relaxation method to solve the unit combination problem, considering the randomness of the search field)

空间数据扩边以后做fft并在频率域延拓，可用于求重磁异常(expansion of spatial data and FFT， in the frequency domain extension can be used to find the gravity and magnetic anomalies)

卡尔曼滤波的C语言实现，可用于估测电池soc等(C language implementation of Calman filter)

说明：  基于matlab实现的拉格朗日插值函数，牛顿插值函数代码。(Based on MATLAB Lagrange interpolation function, Newton interpolation function code)

矩阵排序，按照行排序。 例如 矩阵[ 1 2 3 4 5 4 1 3 2 1 3 5 6 9 7]排序后为： [ 1 2 3 4 5 3 5 6 9 7 4 1 3 2 1] (matrix row sort )

经典非线性动力学模型，布鲁塞尔子模型，可直接运行，运算效率高。(nonlinear dynamics Brusselator model)

利用蚁群算法求解TSP问题， 从Location.dat文件输入每个城市的坐标。(The use of Ant Colony Algorithm for TSP problems Location.dat file input from the coordinates of each city.)

实现位场数据的向上延拓运算，有效的消除数据中的噪音及浅部干扰。(Realize the potential field data upward continuation operator, effectively eliminate the noise in the data and shallow interference.)

vasp，功能强大的第一性原理计算软件，请注意版权(The Vienna Ab initio Simulation Package (VASP) is a computer program for atomic scale materials modelling, e.g. electronic structure calculations and quantum-mechanical molecular dynamics, from first principles.)