cpid5

DFS CODE Depth-first search algorithm Matlab source this procedure site collected from abroad, is the standard depth-first search algorithm, can be achieved and the detection circuit node traversal functions, details see the original English Notes I added this procedure randomness, that is, bifurcation encountered when a randomly selected node, become a random depth-first search algorithm

自适应陷波算法，串行结构,可以对多个阶次起作用(adaptive lms)

detection of the optimal countour

Matlab遗传算法工具箱函数及应用实例.(Matlab toolbox functions and application examples.)

sapjco3官网jar包，包中含有详细开发实例(sapjco3 official website of the jar package, the package contains a detailed example of the development)

最优化算法中的带有Wolf搜索求步长的拟牛顿算法求最优值的源码，matlab编程实现，希望对大家有用。(Optimization algorithm with Wolf to the search requirements step quasi-Newton algorithms to find the optimal value of the source code, Matlab programming, and hope to be useful.)

伪谱法安装程序，直接在MATLAB环境下运行安装文件，随后即可使用，效果不错的一种方法，希望有用。(The installer pseudo-spectral method)

wsn的TEEN算法，自己加入了相应的注释，相信大家会看的很轻松(wsn the leach method, its accession to the corresponding note, I believe we will see very easily)

In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a linear system of equations. It is named after the German mathematicians Carl Friedrich Gauss and Philipp Ludwig von Seidel, and is similar to the Jacobi method. Though it can be applied to any matrix with non-zero elements on the diagonals, convergence is only guaranteed if the matrix is either diagonally dominant, or symmetric and positive definite.

说明：  simulink file to ampletude modulation and demodulation