登录
首页 » matlab » gm

gm

于 2007-11-14 发布 文件大小:2KB
0 246
下载积分: 1 下载次数: 0

代码说明:

说明:  这是MATLAB 图形用户界面的一个例子 欢迎大家一起交流学习心得 我也是刚刚接触MATLAB(This is a MATLAB graphical user interface with an example welcome everyone to exchange learning experiences I have just contacted MATLAB)

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

发表评论

0 个回复

  • net-work
    基于BP和RBF的函数逼近编程及仿真,含仿真结果和分析比较(Approximation programming and simulation-based BP and RBF functions, including analysis of the simulation results and compare)
    2014-11-30 21:35:14下载
    积分:1
  • ReadParRec42
    用于读取MRI的ParRec数据源代码的Matlab文件(read MRI ParRec File)
    2013-04-15 08:19:28下载
    积分:1
  • TLBO-Code-for-Constrained-Functions
    TLBO Code for Constrained Functions-约束条件的教师学习算法(TLBO Code for Constrained Functions)
    2015-04-16 09:58:54下载
    积分:1
  • simulink
    this is the file which will help in understanding the MATLAB and simulink good luck
    2009-10-23 13:06:55下载
    积分:1
  • chandan1
    generation of random nodes for wsn
    2011-02-14 19:33:29下载
    积分:1
  • 求解非线性代数方组的有效方法 Newton-Raphson
    牛顿-拉夫逊法在数学上是求解非线性代数方程组的有效方法,其要点是把非线性方程求解过程变成反复地对相应的线性方程进行求解的过程。(Newton- Raphson method in mathematics is an effective method for solving nonlinear algebraic equations, the point is that the non-linear equation solving process into the process repeated for the corresponding linear equation solving.)
    2020-07-08 16:38:56下载
    积分:1
  • TDOA
    基于tdoa原理的地面定位系统中HDOP的研究(Principle-based tdoa ground positioning system of HDOP)
    2010-01-20 13:57:49下载
    积分:1
  • elman_app
    说明:  上课时老师用的源代码,据说是他的研究生编写的用于模拟ELMAN网(Classroom teachers to use the source code, it is said that his post-graduate prepared ELMAN network used to simulate)
    2008-11-10 17:17:34下载
    积分:1
  • M_files_chap04
    and this for chapter 4, chapter 3 just describe some theories.
    2013-04-08 04:17:57下载
    积分:1
  • gradient descent
    说明:  梯度下降法是一個一階最佳化算法,通常也稱為最速下降法。 要使用梯度下降法找到一個函數的局部極小值,必須向函數上當前點對應梯度(或者是近似梯度)的反方向的規定步長距離點進行疊代搜索。如果相反地向梯度正方向疊代進行搜索,則會接近函數的局部極大值點;這個過程則被稱為梯度上升法。(The gradient descent method is a first-order optimization algorithm, also commonly referred to as the steepest descent method. To find the local minimum of a function using the gradient descent method, an iterative search must be performed to the specified step distance point in the opposite direction of the gradient (or approximate gradient) of the current point on the function. If the search is reversed in the opposite direction to the positive direction of the gradient, it will approach the local maximum point of the function; this process is called the gradient ascent method.)
    2019-02-21 23:13:19下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载