MATLABppt

在诸多ICA算法中，固定点算法 (也称FastlCA)以其收敛速度快、分离效果好被广泛应用于信号处理领域。该算法能很好地从观测信号中估计出相互统计独立的、被未知因素混合的原始信号。(In many ICA algorithms, fixed-point algorithm (also known as FastlCA) for its fast convergence and good separation effect is widely used signal processing. The algorithm can estimate from the observed signals statistically independent each other, unknown factors are a mixture of the original signal.)

这是几个matlab和C++混合编程的实例，讲述的比较详细，绝对可以编译，使你拨开云雾，混编就这么简单。本源码也详细讲述了，如何在没安装MATLAB环境下如何部署，十分详细！(This is the number of matlab and C++ mixed programming examples, described in more detail, absolutely can compile, so you sweep aside the clouds, mixed that simple. The source also tells in detail how to install the MATLAB environment, not how to deploy, very detailed!)

共轭梯度法（Conjugate Gradient）是介于最速下降法与牛顿法之间的一个方法，它仅需利用一阶导数信息，但克服了最速下降法收敛慢的缺点，又避免了牛顿法需要存储和计算Hesse矩阵并求逆的缺点，共轭梯度法不仅是解决大型线性方程组最有用的方法之一，也是解大型非线性最优化最有效的算法之一。 在各种优化算法中，共轭梯度法是非常重要的一种。其优点是所需存储量小，具有步收敛性，稳定性高，而且不需要任何外来参数(Conjugate Gradient method (Conjugate Gradient) is between the steepest descent method between Newton method and a method, it only USES a derivative information, but overcome the steepest descent method slow convergence of weakness, but also avoid the Newton law needs to storage and computing Hesse inverse matrix and shortcomings, Conjugate Gradient method is not only solve linear equations with most of the large method, and also one of the most effective solution large nonlinear optimization of one of the algorithm. In all kinds of optimization algorithm, the conjugate gradient method is very important. Its advantage is the storage capacity needed, it has small step convergence, high stability, and doesn t require any exotic parameters numerical experiment, this is the modern scientific computing of the answer above problem sets)

旅行商问题（Travelling Salesman Problem, 简记TSP):假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 此处使用蚁群算法求解TSP问题(Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.Here,we use the procedure of ant colony algorithm to work out the TSP.)

ofdm_signal by matlab

说明：  此文件是二级倒立摆的仿真模型与仿真源程序(set up on a double inverted pendulum fuzzy control module of the Matlab files)

利用符号计算推导光学三阶微环滤波器传输函数，代入参数计算光谱响应，并对关键参数做扫描，绘制4通道微环滤波器响应谱。(Utilizing symbolic computation to derive the third-order optical micro-ring filter transfer function, substitutes the parameters to calculate the optical response. The key parameters are swept and the optical response of a four-channel micro-ring filter is drawn.)

在图像处理中使用的穷尽算法对目标帧经行预测，也是运动估计的简单形式(In the end image processing algorithms used by the line on the target frame predicts a simple form of motion estimation is)

这是parzen窗估计的典型例子，大家可以直接学习，是个不可多得的好材料。(This is a typical example of the estimated parzen window, we can learn, is a rare good material.)

说明：  蒙特卡洛资料及算法···········(Monte Carlo data and algorithm)