Holubowicz119325

matlab代码，从多个中选择最大的和最小的，不经过排序，可以直接选择。(matlab code, choose from more than biggest and smallest, without sorting, you can directly choose.)

两个平面波展开程序，关于二维结构，希望对大家有所帮助。(Two plane wave expansion method programs,about two dimensional structure.)

分布式发电的PQ控制研究仿真，通过MATLAB/simulink进行仿真(PQ control study simulation of distributed generation )

说明：  捷联惯导系统放置在室内测试台上做静态测试，测试时间4500s。 1）取前180数据做粗对准（解析对准法）； 2）取第181s~900s数据做精对准（Kalman滤波法）； 3）从第901s开始做纯惯导解算； 4）用国军标的导航系统位置精度评价方法评估系统定位精度（分别计算CEP50 和 CEP95 下的定位精度）。(The strapdown inertial navigation system was placed on the indoor test bench for static test with a test time of 4500s. 1) take the first 180 data for rough alignment (analytical alignment method); 2) accurate alignment of 181s-900s data (Kalman filtering method); 3) pure inertial navigation solution is performed from 901s; 4) the positioning accuracy of the navigation system is evaluated by the method of position accuracy evaluation of the national military standard (the positioning accuracy under CEP50 and CEP95 are calculated respectively).)

In numerical analysis, the secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f.(The secant iteration to find the zero of some non-linear function converges to zero if appropriate starting values are chosen. Although the convergence rate is not as good as the one of the Newton method, it may sometimes converge when Newton fails. The funtion should be defined as an inline function and two starting values are required to start the iteration. Please enter help secant from the Matlab prompt for usage information and examples. )

这个程序用来计算单层膜的厚度和折射率的信息，以及可以得到他们的局部分部信息(This file is about the caluation for the thickness and refractiveness of the sample, and the distrbution about it can be obtained)

这也是中东地区的一种格式，数据处理不难，但是功能多了就很难(This is the Middle East region a format, data processing is not difficult, but it functions more difficult)

一个用matlab编写的绘制smith圆图的程序，简单明了，内有代码解释(One using matlab draw smith chart of the procedure is simple, there are code explanations)

输入节点个数和路径权重可得到任意两点之间的最短路径，放在Muti_Cost矩阵中(Input node number and weight of available paths the shortest path between any two points, on Muti_Cost matrix)

ARA – The Ant-Colony Based Routing Algorithm for MANETs