登录
首页 » matlab » math

math

于 2012-05-07 发布 文件大小:3124KB
0 171
下载积分: 1 下载次数: 2

代码说明:

  此文件包含了matlab中几种常见的算法,便于初学者参考学习。(Detailed introduces the mathematical modeling of several common mathematical model and modeling method. Convenient first contacts the mathematical model of the people learn. )

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

发表评论

0 个回复

  • suizhun
    水准测量的点位精度和平差后的点的坐标。可以利用该程序得到误差椭圆。(Leveling point precision of peace after the coordinates of the points difference. The program can be obtained using the error ellipse.)
    2010-12-08 22:34:45下载
    积分:1
  • Srshcomp
    this source code is very good
    2013-08-16 01:30:40下载
    积分:1
  • vehicle-model
    汽车七自由度的模型,包括M文件。可以和carsim联合仿真,对做汽车动力学仿真很有用。(Seven degrees of freedom vehicle model, including M files.Can and carsim joint simulation, is very useful to do vehicle dynamics simulation.)
    2021-03-30 16:59:09下载
    积分:1
  • Gaexample
    遗传算法-优化算法-模板-可以供学习参考(Genetic algorithms- Optimization- Template)
    2014-01-13 14:38:47下载
    积分:1
  • xingbo
    行波测距的matlab仿真研究,非常适合初学者使用。(The traveling wave ranging matlab simulation)
    2015-10-25 17:37:04下载
    积分:1
  • ekffffff4
    说明:  实现组合导航仿真,扩展卡尔曼滤波算法,比较简洁(Realization of Integrated Navigation Simulation)
    2019-04-21 23:28:19下载
    积分:1
  • Untitled56
    HOTELLING TRANSFORMATION
    2012-03-28 02:06:27下载
    积分:1
  • lms
    lms.m 均衡算法 用lms算法实现的 C语言编译(lms.m Equalization Algorithm with lms)
    2010-05-18 19:32:49下载
    积分:1
  • greedy_method
    greedy_method.m为为贪婪算法程序。所得结果为局部最优,可能不是全局最优的。(greedy_method.m greedy algorithm program. The results obtained for the local optimum, may not be globally optimal.)
    2012-04-16 14:52:45下载
    积分:1
  • functionz
    说明:   在三次样条中,要寻找三次多项式,以逼近每对数据点间的曲线。在样条术语中,这些数据点称之为断点。因为,两点只能决定一条直线,而在两点间的曲线可用无限多的三次多项式近似。因此,为使结果具有唯一性。在三次样条中,增加了三次多项式的约束条件。通过限定每个三次多项式的一阶和二阶导数,使其在断点处相等,就可以较好地确定所有内部三次多项式。此外,近似多项式通过这些断点的斜率和曲率是连续的。然而,第一个和最后一个三次多项式在第一个和最后一个断点以外,没有伴随多项式。因此必须通过其它方法确定其余的约束。最常用的方法,也是函数spline所采用的方法,就是采用非扭结(not-a-knot)条件。这个条件强迫第一个和第二个三次多项式的三阶导数相等。对最后一个和倒数第二个三次多项式也做同样地处理。 (the Cubic Spline, to find three polynomial, approaching every right to point the data curve. The kind of terms, these data points called breakpoints. Because only two points a straight decisions, and in between the two curves can be used an infinite number of cubic polynomial approximation. Therefore, in order for the outcome of uniqueness. The Cubic Spline, add the cubic polynomial bound by the conditions. By limiting each cubic polynomial of the first order and second-order derivative, it breakpoint in the same Department, we can better identify all internal cubic polynomial. In addition, the polynomial approximation of these breakpoints slope and curvature is continuous. However, the last one and a cubic polynomial in a breakpoint and the final one, not accompanied by polynomials. There)
    2006-03-15 21:19:29下载
    积分:1
  • 696518资源总数
  • 106155会员总数
  • 8今日下载