几种常见稀疏恢复算法的matlab代码 SparseRecovery

normal equalizer by a beginner

this is a kalman filter

Linear selection algorithm, similar to sequencing, the analysis algorithm to learn to be aware of

实现了蚁群算法求解TSP问题。注释详细 function[R_best,L_best,L_ave,Shortest_Route,Shortest_Length]=ACATSP(C,NC_max,m,Alpha,Beta,Rho,Q) ------------------------------------------------------------------------- 主要符号说明 C n个城市的坐标，n×2的矩阵 NC_max最大迭代次数 m蚂蚁个数 Alpha表征信息素重要程度的参数 Beta表征启发式因子重要程度的参数 Rho信息素蒸发系数 Q信息素增加强度系数 R_best各代最佳路线 L_best各代最佳路线的长度 ========================================================================= (Ant Colony Algorithm for the realization of the TSP problem. Notes the detailed function [R_best, L_best, L_ave, Shortest_Route, Shortest_Length] = ACATSP (C, NC_max, m, Alpha, Beta, Rho, Q) ------------------------------------------------------------------- The main symbol------ C n that cities coordinates, n × 2 matrix NC_max the largest number of iterations m the number of Alpha ant pheromones characterized the importance of the parameters Beta factor heuristic importance of characterization of the parameters Rho evaporation coefficient of pheromone pheromone Q increase in intensity coefficient R_best best route generations generations L_best the length of the best route ====== ================================================== =================)

calibration stereo data

悬置功能计算的，能量解耦的方法，优化及其位移的计算(The calculation of suspended function, energy decoupling method, optimization and calculation of displacement)

阵列信号处理波束形成算法，MATLAB环境下编译通过，可直接应用或移植。(Array signal processing beamforming algorithm, compiled in MATLAB environment, can be directly applied or transplanted.)

This is a small program to create indexs for two binary trees and combine them to a new 003 * index tree and output the new tree,the second tree only has the left child tree then 004 * if the first tree has no left child tree,insert the second tree into the first tree as 005 * its left child and if the first tree has the left child tree,then insert the first tree 006 * into the second tree as its left child. (This is a small program to create indexs for two binary trees and combine them to a new 003* index tree and output the new tree, the second tree only has the left child tree then 004* if the first tree has no left child tree, insert the second tree into the first tree as 005* its left child and if the first tree has the left child tree, then insert the first tree 006* into the second tree as its left child.)

FDTD Analysis for antenna

包含几个主成分分析方法的程序以及主成分分析法的讲解。(Contains several principal component analysis program and principal component analysis method explain.)