gamatlabcode1.doc

本程序运用bing yang的PAST算法和PASTD算法跟踪信号子空间，并利用MUSIC算法估计信号的波达方向(DOA)(This procedure utilizes the PAST algorithm and the PASTD algorithm (put forward by Bing Yang)track signal subspace, and uses MUSIC algorithm to estimate signal prameter Direction Of Arrival(DOA) )

自己编写的求解本证值的程序，用以对崩政治求解方法的理解，也可以做成其它线性代数程序的子函数(their preparation for the certification of the value of the procedure to solve the political collapse of understanding, can also cause other linear algebra procedures Functions)

一个Rayleigh衰落的clarke模型的问题,主要是信道仿真方面的,实用.(a Rayleigh fading clarke model that the main problem is the channel simulation aspects. practical.)

Generalized Givens Transformation and its Application

六步逆变器供电的无刷直流电机，采用MATLAB/SIMULINK建模 (Six step inverter Brushless DC motor , which is modeled through MATLAB/SIMULINK )

Control system dynamic simulation instance tutorial,可以很好的学习交流控制系统的仿真(Control system dynamic simulation instance tutorial, can be a good learning exchange control system simulation)

分水岭测试算法，供参考，里面还有一些其他代码，共学习(Watershed test algorithm, for reference)

说明：  在matlab下，运用矩量法计算长直导线电容，并分析电容随导线长度，半径，分段数的变化(In matlab, Compution of a long straight wire capacitance with MOM , and analysis of capacitance with the wire length, radius, segment number of changes)

For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).

multilevel modeling by bond graph methode