LorenzPoincare

分形几何中一些经典图形的Matlab画法 [文档在线提供](Fractal geometry of some classic graphical Matlab painting [document online])

Multichannel NLMS for system detection with multiple input streams

对心电信号进行EMD分解，比较EMD、EEMD、CEEMD、CEEMDAN的分解差别(Emd for ecg signal decomposition, comparing emd, eemd, ceemd, ceemdan decomposition differential)

programming with matlab in simple way

tls 算法 解决带系数矩阵的问题比LS算法在误差校正方面更有优势(tls algorithm to solve the problem with the coefficient matrix more advantages than the LS algorithm in terms of error correction)

用批处理最速下降法训练网络，利用Matlab Script节点实现在此以对一个非线性函数的逼近作为例子来说明 (Batch steepest descent method to train the network to use Matlab script node to achieve this as an example of a nonlinear function approximation to illustrate)

利用matlab根据Gauss、Cholesky和Jacbbi三种方法实现矩阵的范数求取(Using matlab under Gauss, Cholesky and Jacbbi Three methods of striking the norm of matrix)

matlab pso-xc evolve.m matlab pso-xc evolve.m

  最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.( Minimum cost maximum flow algorithm for general Matlab functions based on the Floyd shortest path algorithm of Ford and Fulkerson superposition algorithm of the basic ideas: the cost of unit flow on the arc as a certain length of Floyd for the most short-circuit method to determine the one percent V1 through Vn are the most short-circuit then this short circuit as a scalable road, a method for solving the maximum flow problem on flow increased to the maximum possible value that the shortest way increased traffic, the cost of unit flow on each arc sure, so many iterations, the final minimum cost maximum flow.)

this is one of the best satelite code in the world to find the look angle