搜索资源列表
Jacobi迭代法
- 用C语言来实现的。求解线性方程组的迭代，是一种简单的迭代法，可不如 Gauss-Seidel迭代法收敛速度快。-Use c language to make a Jacobi iterative arithmetic which could solve the linear equation group, but it s may be more slower than the Gauss-Seidel iterative arithmetic.
双并联
- 双并联人工神经网络,具有收敛速度快,泛化能力强等特点-double parallel artificial neural network, with the convergence speed and ability to generalize the characteristics of
Volterrra_luzhenbo4
- 更新部分 1、自适应算法采用参考文献[2]的NLMS算法，收敛速度更快，所需训练次数更少。 2、自适应收敛步长在(0,2)之间存在较优取值，Lorenz序列为0.6。-update an adaptive algorithm reference [2] NLMS algorithm, convergence faster, less the number of required training. 2, adaptive step in the convergence of (0,2)
LSMClass
- 改进的最小二乘法实现代码，提高了收敛速度。-improve the least-squares method to achieve code, improving the convergence rate.
liyingnan_4
- 最优化中利用惩罚因子的罚函数法的外延，连带了共轭梯度法，由于罚因子的迅速跌代增大，加速了目标函数的收敛速度。-optimization of the use of punitive factor function in the epitaxial sustaining a conjugate gradient method, As the penalty factor to the rapid increase or on behalf of, the objective function to
niudun
- 图是用牛顿法求方程z3-1=0的根所得到的“项链”。以上程序采用浮点运算，速度是比较慢的。如果每迭代一次就计算一次距离，则速度会更慢。为了使不同吸引区域有不同的颜色，并且能够表现收敛速度，必须做更多的距离计算，但得到的图形也更美丽。特别是将分界处的“项链”放大来看，会得到精致的结构。-Fig Newton method is used Equation z3-1 = 0 has been the root of the "necklace." The procedure is
svm12
- 一种很有效的支持向量机算法，收敛速度很快,-a very effective support vector machine algorithm, the rate of convergence,
myexinfomax
- 扩展的Infomax算法，具有比较快的收敛速度！而且程序非常简洁,明了-expansion of Infomax algorithm, with a faster rate of convergence! The procedure is very simple, straightforward
FastICA
- FastICA算法，用于信号的独立分量分析，在ICA的基础上加快了收敛速度，有更高的效率！并且增加了图象界面，使用方便！-FastICA algorithm, the signal for an independent component analysis, at the ICA on the basis of accelerating the convergence rate, a more efficient! And to increase the image user interface
shengjingwangluo
- 本算法在训练步数、训练时间及其误差精度等方面都优于常规的模糊神经网络，其学习收敛速度快、误差曲线也更稳定。-the algorithm steps in training, training time and error accuracy is superior to the conventional fuzzy neural network, learning fast convergence, the error curve is more stable.
a5_5BPnet
- bp网络的matlab程序,大大提高了收敛速度,并且拟合结果良好-bp network Matlab procedures, greatly improving the convergence rate, and the results fit well
ga427
- 针对TSP问题，提出了一种改进的遗传算法。在遗传算法中引入进化算法的思想，在此基础上提出顶端培育策略和分阶段策略，以求在保证群体多样性的同时加快收敛速度。-against TSP, an improved genetic algorithms. Genetic Algorithm evolutionary algorithm introduced the idea that the basis of this proposed strategy and cultivating top phase
MyLMS_LSL
- 本文件是比较LMS与LSL滤波器的参数的收敛速度-this document is compared with the LMS LSL filter parameters of the convergence rate
pso_c+
- 这是一个pso程序源代码，pso源于对鸟群捕食行为的研究而发明的进化计算技术，属于进化算法的一种。 优点：收敛速度快，具有全局寻优能力，而且编程简单，易于推广使用。 -This is a pso source code, pso out of the flock of predatory behavior and evolutionary computation invention of the technology is an evolutionary algorithm. Advant
BpAlgorithmFunction
- 采用BP算法进行函数拟合，收敛速度较快。-BP function fitting algorithm, convergence faster.
HopfieldExperiment
- 采用Hopfield网络解决旅行商问题，收敛速度快。-using Hopfield network to solve the traveling salesman problem, and fast convergence.
regular_pso_l
- 粒子群算法的局部模型程序，比全局模型的效果要好，尽管收敛速度慢些，但是都能找到最优点。-PSO partial model program than the overall model is better effect, despite the convergence speed more slowly, But can find the most advantages.
apso
- 改进的粒子群算法--自适应粒子群算法，在普通的粒子群算法里面加入了熵和平均粒距的概念，收敛速度大大提高，而且不容易陷入局部最优，能更有效的解决复杂问题。-improved PSO -- Adaptive PSO. In a normal PSO which joined the entropy and the average particle from the concept of convergence speed, it is not easy to find the global opti
TSP_GA
- 《智能优化算法》课的作业，用遗传算法解TSP问题。其间遇到了收敛速度慢的问题，也是在这个网找到了解决方案。大家下载的应该都是那个VC6的Windows程序。我这个是从零开始写的，大家看起来应该容易懂些。C++的Console程序，VC2005下编译。全部用STL，所以旧的编译器可能会有点问题。压缩包内有谢胜利的论文：《TSP遗传算法的改进》。正是用他的贪婪交配才使得10代左右解就收敛到很好。再次赞一下！-" Intelligent Optimization Algorithms"
particleswarm
- 改进的微粒群算法。寻找全局最优能力较好。收敛速度较快。-Improved particle swarm optimization. Better ability to find the global optimum. Faster convergence.