SDCS

求沿平行静电偏转板中心入射的电子轨迹 (Calculation of Electron Physics )

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

用nuttall窗双谱线插值实现谐波提取(Nuttall window double spectrum line interpolation harmonic extraction)

ISAAC采用多块网格技术求解二维或三维的Euler或者NS方程，并且提供了大量的湍流模型供使用，为相关研究人员提供了很好的参考。(ISAAC solves 2D or 3D Euler or NS equatioon based on a multiblock grid technique, also lots of turbulence models is included in the code. ISAAC provides a good reference for relative researches.)

基于Python编写的差分进化原理的带边界条件约束算法(A band constraint algorithm based on differential evolution algorithm)

单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解,再鉴别；若仍不是，则再转换,按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method for the minimum)

是用MATLABA编写的遗传运算发的一个小程序 挺好用的 大家(MATLABA is prepared by the genetic operator issued a small procedure very well, we try to use)

美国大牛哈林登编写的计算电磁场的矩量法著作，对学习矩量法有帮助(method of moment to Calculate the electromagnetic field)

滤波器与匹配电路的设计，基于简化实频技术的matlab实现(the SRFT achieves an optimal lter design byusing computer-aided optimization. This code will describe SRFT and a MATLABR implementation of the SRFT currently under development)

用基于拉格朗日函数Hesse矩阵的SQP方法求解约束优化问题(Based on Lagrangian with SQP Hesse matrix method for solving constrained optimization problems)