C__4

文件中包括了最优化中的最小费最大流程序以及例子和程序(File included in the most optimal maximum flow procedures and examples of trees and procedures)

一维卡尔曼滤波算法，可以直接使用，通过系统噪声和测量噪声调整灵敏度。(One dimensional Calman filtering algorithm can be directly used to adjust the sensitivity through system noise and measurement noise.)

使用C编写的复数矩阵求逆，使用高斯消去法，已经和matlab结果做过对比，无误(Written in C and the complex matrix inverse, using the Gaussian elimination method, has been done and matlab results contrast, correct)

湍流模型re计算流体力学软件udf 可以用于修改UDF文件(turbulence model FLUENT)

The Polarized light Monte Carlo programs described here keep track of the status of polarization of light traveling through a scattering media.(polarized monte carlo)

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

This file contains a summary of what you will find in each of the files that make up your GPKolmogorov application.

上三角或下三角矩阵也有大部份的元素不储存值（为0），我们可以将它们使用一维阵列来储存以节省储存空间，而对称矩阵因为对称于对角线，所以可以视为上三角或下三角矩阵来储存。(Upper or lower triangular matrix or a large majority of elements are not stored value (0), we can use them to store a one-dimensional array in order to save storage space, and because the symmetrical diagonal symmetric matrix, it can be regarded as the or lower triangular matrix storage.)

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

This program is used to find the union, intersection and exclusive OR for given two sorted arrays.