css

Fractional knapsack problem, Greedy algorithm

吉尔算法积分一阶微分方程组初值问题的C语言描述，包括主函数、计算微分方程组中各方程右端函数值的函数程序、计算雅克比矩阵的函数程序、矩阵求逆程序等。(GEAR algorithm integral first order differential equations initial value problem of the C language description, including the main function to calculate the differential equations in the equation right function value function procedures, functions Jacobian matrix calculation procedures, matrix inversion procedures.)

说明：  此程序为满足条码不能带IOQ三位字母的计算方法(Bar code can not be three letters with the calculation of IOQ)

由散点插值生成等值线,并且提供颜色选择工具,共有三种插值方法(Generating isolines from scattered interpolation and providing a color selection tool, there are three interpolation methods)

程序算任意点FFT和小波变换,以及可选择多种小波及小波变换后的单频带重够,另算信号的Lipschitz指数,高级数字信号处理!(counting procedures arbitrary point FFT and Wavelet Transform, and the choice of multiple wavelet and the wavelet transform of a single-band heavy enough, and another count signal Lipschitz index advanced digital signal processing!)

数值计算实例，主要有LU分解，龙格库塔法，高斯分解法，欧拉法，曲线拟合，曲线插值(Numerical example)

含列所有图像处理的VC++程序，包括图像转置，傅立叶变换，图像编码等(Containing all image processing VC++ Procedures, including image transpose, Fourier transform, image coding, etc.)

清华大学《数值分析A》－第02章.插值 Lagrange Newton Hermite 三次样条(Tsinghua University, )

计算岩石表面裂隙宽度并求取其表面粗糙度系数(Calculate the rock surface crack width and strike the surface roughness coefficient)

针对传统的算法如遗传算法、粒子群算法等在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.)