登录
首页 » matlab » pso

pso

于 2017-09-29 发布 文件大小:1KB
0 169
下载积分: 1 下载次数: 19

代码说明:

  粒子群算法,也称粒子群优化算法或鸟群觅食算法(Particle Swarm Optimization),缩写为 PSO。它具有精度高,收敛快等优点,广泛用于系统辨识、函数优化等领域。文件pso.m是粒子群算法辨识程序,在此基础上,需要自行编写目标函数计算程序以实现不同系统的参数辨识。(Particle swarm optimization (PSO), also known as particle swarm optimization algorithm or bird swarm foraging algorithm (Particle Swarm Optimization), abbreviated as PSO. It has the advantages of high precision and fast convergence. It is widely used in system identification, function optimization and other fields. The document pso.m is a particle swarm algorithm identification program. On this basis, it is necessary to write an object function calculation program to realize the parameter identification of different systems.)

文件列表:

pso.m

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • fft
    有关FFT方面的内容,包括算法原理和程序应用(PDF)(The FFT aspects, including the principles and procedures of application of algorithm (PDF))
    2011-10-29 15:27:35下载
    积分:1
  • 12408927_G_P
    说明:  关联维数求解,大组件构建,可以快速得到关联维数的值。(The value of correlation dimension can be obtained quickly by solving the correlation dimension and constructing large components.)
    2021-04-10 10:00:20下载
    积分:1
  • Runge-Kutta
    Using Runge-Kutta 10 inoder to solve
    2011-06-05 01:41:52下载
    积分:1
  • mciduoxiangshinihe
    用c++实现m次多项式的曲线拟合,改程序简单易懂,可读性强(it s easy)
    2014-07-01 18:34:09下载
    积分:1
  • Bayesian-maximum-a-posteriori
    实现贝叶斯最大后验概率计算,适合原理的研究,简单易懂。(To achieve the maximum a posteriori Bayesian probability, the principle of appropriate and easily understood.)
    2011-06-15 22:01:03下载
    积分:1
  • neh
    flow shop neh scheduling by makespan minimization
    2012-03-14 21:59:14下载
    积分:1
  • utmc
    本程序用于生成高质量的网格,可用于有限元,有限体积等方法的前处理。(This procedure is used to generate high-quality mesh, can be used for finite element, finite volume methods such as pre-processing.)
    2017-08-10 11:24:49下载
    积分:1
  • MATLAB
    最小二乘法在二维平面测向交叉定位里的应用(The least squares method in the two-dimensional plane measured to cross positioning)
    2021-04-16 11:48:54下载
    积分:1
  • Fortran_Method_1
    用于矩阵的一种cholesky分解方法,第一次上传请多关照(cholesky method for matrix decomposition)
    2020-08-23 14:48:20下载
    积分:1
  • KMEANS
    This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen. Usage for KMEANS is: KMEANS SOURCEFILE <enter> The format of the source file is: NPat - Number of patterns (int) SizeVect - Size of vector (int) NClust - Number of cluster centers(int) vect[1,1] ... vect[1,SizeVect] - vector 1 (real) vect[2,1] ... vect[2,SizeVect] - vector 2 (real) . . . . . . vect[NPat,1] ... vect[NClust,SizeVector] - vector N (real) To compile: ICC KMEANS.CPP <enter> (This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen. Usage for KMEANS is: KMEANS SOURCEFILE <enter> The format of the source file is: NPat - Number of patterns (int) SizeVect - Size of vector (int) NClust - Number of cluster centers(int) vect[1,1] ... vect[1,SizeVect] - vector 1 (real) vect[2,1] ... vect[2,SizeVect] - vector 2 (real) . . . . . . vect[NPat,1] ... vect[NClust,SizeVector]- vector N (real) To compile: ICC KMEANS.CPP <enter> )
    2013-01-05 23:11:23下载
    积分:1
  • 696518资源总数
  • 105714会员总数
  • 27今日下载