Mobility_Jena

以随机的中弱大气湍流为背景，可用于计算大气湍流下准直高斯光束的光强分布，光束扩展以及光束角漂移(The random weak atmospheric turbulence as the background can be used to calculate atmospheric turbulence of collimated Gaussian beam intensity distribution and beam propagation and beam angle drift)

基于vc++6.0的佳点集遗传算法的编程，里面的各项参数均可由使用者自我调整!(Vc++6.0 based on the good point set genetic algorithm programming, which the parameters can be adjusted by the users themselves!)

EnKF集合卡尔曼滤波代码，用于读写模式集合，包括两种扰动观测分析方案。(These files illustrate the model used for storing, reading and writing the ensemble of model states.)

电力系统暂态分析中非常有用的三相短路计算程序，只要改变输入就可用于求解具体问题(power system transient analysis is very useful three-phase short-circuit the process. as long as the change in input can be used to solve specific problems)

说明：  用matlab实现的有限元工具箱，有平面空间梁单元，杆单元，实体单元等。(achieved using Matlab Toolbox FEM, graphic space beam elements, rod elements, entities modules.)

利用遗忘因子递推最小二乘法做的参数估计，介绍还算详尽(Forgetting factor recursive least squares method using the parameter estimates do)

基于配电网络辐射型的前推回代潮流计算程序，包括分层等内容(And backward substitution based on the radiation type of distribution network before flow calculation procedures, including the contents of the stratification)

三次样条插值c++头文件，一些头文件，非常好(Cubic spline interpolation c++ header files, some header files)

根据电磁参数,介电常数实部和虚部，磁导率的实部和虚部，计算反射损耗。(calculating the reflection loss from the electromagnetic parameters)

一般线性规划问题具有线性方程组的变量数大于方程个数，这时会有不定的解。当决策变量个数n和约束条件个数m较大时，单纯形法是求解线性规划问题的通用方法。 从线性方程组找出一个个的单纯形，每一个单纯形可以求得一组解，然后再判断该解使目标函数值是增大还是变小了，决定下一步选择的单纯形。通过优化迭代，直到目标函数实现最大或最小值(In general linear programming problems, the number of variables with linear equations is greater than the number of equations. When the number of decision variables n and constraint number m are large, simplex method is the general method for solving linear programming problems. Find out one by one from the linear equations of the simplex, each a simplex can get a set of solution, and then concludes that the solution is the objective function value increases or smaller and decided to choose the next simplex. By optimizing iteration, until the target function achieves the maximum or minimum value.)