可以编译的三相光伏逆变并网仿真测试例程

适合于大学生或工程硕士的工科计算方法课件(Numerical analysis for undergraduate students)

滑模变结构于matlab仿真的自带源码，pdf版本的书籍已经上传，有需要的可以下载(Sliding Mode Variable Structure comes with source code in matlab simulation pdf version of the book has been uploaded, you can download)

说明：  classic goldstein filter by matlab for interferogram phase noise filtering(classic goldstein filter by matlab)

一般经典的稀疏表示分类代码，希望对初学者有用。当然如有不足之处，请多多修改

有关机动目标跟踪，卡尔曼滤波相关的资料，对从事卡尔曼滤波研究，机动目标跟踪的朋友有参考价值 (The maneuvering target tracking, Kalman filtering relevant information, engaged in Kalman filtering, target tracking friends have reference value)

说明：  蚁群算法matlab实现，c为测试矩阵蚁群算法matlab实现，c为测试矩阵蚁群算法matlab实现，c为测试矩阵蚁群算法matlab实现，c为测试矩阵(matlab，ant matlab，ant matlab，ant matlab，ant matlab，ant matlab，ant )

ＡＳＭ算法的代码实现，在ｍａｔｌａｂ编译环境下的完整代码。(ASM code realization of the algorithm, compiled in matlab environment of complete code.)

GMSK信号的循环谱密度程序 对循环谱算法感兴趣者下载(GMSK signal cycle of spectral density of the cyclic spectrum algorithm procedures of interest to those who download)

“基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。 (" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)

A Markov Chain Monte Carlo version of the genetic algorithm Differential Evolution: easy Bayesian computing for real parameter spaces