登录
首页 » matlab » Arithmetic

Arithmetic

于 2009-11-17 发布 文件大小:169KB
0 239
下载积分: 1 下载次数: 7

代码说明:

  常用优化算法的matlab实现,如德杰斯特拉,弗洛伊德等。(Matlab optimization algorithm used to achieve, such as Dejene Stella, Freud and so on.)

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

发表评论

0 个回复

  • GFBACK
    Multiple Access Channel with Generalized FeedBack rate region analysis MAtlab Code
    2010-09-01 20:26:56下载
    积分:1
  • matlabgui
    matlab 的gui开发文档,一个比较简单的例子,调试通过(gui of matlab development documents, a relatively simple example, debugging through)
    2009-06-09 00:32:17下载
    积分:1
  • back0
    video back subtraction
    2011-04-29 11:37:04下载
    积分:1
  • Solar
    This model is to determine the number of solar panels needed and the minimum battery capacity needed(in amps)and also for the required backup time
    2013-10-29 19:15:19下载
    积分:1
  • flavia-alpha.src.tar
    leaf recognition by Flavia
    2011-12-25 11:39:55下载
    积分:1
  • kaiman2
    一个二维的卡尔曼滤波程序,给定了状态方程和观测方程,对学习信息融合,滤波估计灯方面有积极的知道效果(A two-dimensional Kalman filtering process, given the state equation and observation equation, the study of information fusion, filtering light area is estimated to know there is a positive effect)
    2009-03-28 18:04:09下载
    积分:1
  • Mittag_Leffler
    Uses fractional order calculus
    2010-11-28 23:39:40下载
    积分:1
  • 2DPSK
    说明:  和2DPSK相关的通信系统matlab仿真(2DPSK and related communications systems Matlab simulation)
    2006-05-06 23:01:23下载
    积分:1
  • ECG---Zeroline-Filter
    image an ECG(.csv) with Zeroline-Filter
    2014-01-22 01:48:18下载
    积分:1
  • PSO
    梯度下降法是最早最简单,也是最为常用的最优化方法。梯度下降法实现简单,当目标函数是凸函数时,梯度下降法的解是全局解。一般情况下,其解不保证是全局最优解,梯度下降法的速度也未必是最快的。梯度下降法的优化思想是用当前位置负梯度方向作为搜索方向,因为该方向为当前位置的最快下降方向,所以也被称为是”最速下降法“。最速下降法越接近目标值,步长越小,前进越慢。(The gradient descent method is the earliest and most simple and most commonly used optimization method. The gradient descent method is simple to realize. When the objective function is a convex function, the solution of the gradient descent method is a global solution. In general, the solution is not guaranteed to be the global optimal solution, and the gradient descent method is not necessarily the fastest. The optimization idea of gradient descent method is to use the current position negative gradient direction as the search direction, because the direction is the fastest descending direction of the current position, so it is also called the steepest descent method. The faster the slowest descent approach is closer to the target, the smaller the step, the slower the progress.)
    2018-01-29 21:44:10下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载