登录
首页 » matlab » Chazhi_Nihe

Chazhi_Nihe

于 2020-09-18 发布 文件大小:180KB
0 176
下载积分: 1 下载次数: 4

代码说明:

  对大量数据的差值与拟合算法的Matlab实现,基于多用思想(The difference of large amounts of data fitting algorithm of the Matlab implementation, based on multi-thinking)

文件列表:

插值与拟合
..........\curvefun.m,64,2003-03-18
..........\griddataexam.m,324,2003-07-15
..........\sea.m,707,2003-04-01
..........\test1.m,145,2003-03-18
..........\插值与拟合.pps,300544,2003-08-09

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

发表评论

0 个回复

  • ARXRLS
    程序采用C语言,实现最小二乘辨识算法和递推最小二乘算法(Program using C language, least squares identification algorithm and recursive least squares algorithm)
    2012-10-26 13:07:45下载
    积分:1
  • Kalman_BasedOnStatistic
    Kalman滤波的一个仿真程序,基于“当前”统计模型(Kalman filter, a simulation program, based on the )
    2021-04-15 17:18:54下载
    积分:1
  • ODBprint
    将ABAQUS的ODB结果文件按照人为要求在文本文档中记录(On ABAQUS ODB results file records in a text document in accordance with human requirements)
    2021-03-09 22:09:27下载
    积分:1
  • Fear.the.Walking.Dead.E05E04.480p.web.Fa
    Cavity Matlab SIMPLE algorithm
    2019-07-05 02:32:59下载
    积分:1
  • source
    线弹性模型,可以对一般的弹性体通过abaqus进行验证使用(Linear elastic model)
    2013-11-18 10:33:29下载
    积分:1
  • arcLength
    有限元计算控制加载中弧长法(arc-length)的matlab源程序(Loading FEM arc length control method (arc-length) matlab source)
    2020-12-14 22:49:16下载
    积分:1
  • sphcone_rcs
    计算球体RCS,输入球直接获取球的雷达散射截面(Sphere radar cross section calculation)
    2021-05-08 15:58:36下载
    积分:1
  • 3nodes
    基于牛拉法的电力系统潮流计算,该程序是计算IEEE3节点的,采用matlab编程(Cattle Rafah-based power system load flow calculation, the program the calculation IEEE3 node, using matlab programming)
    2020-12-17 21:29:12下载
    积分:1
  • migration(FKaPS)
    F-K域偏移法和相移法偏移程序(C语言)(FK domain migration method and the phase- shift method migration program (C language))
    2021-04-06 20:59:02下载
    积分:1
  • 单纯形法Matlab程序-2016-11-17
    一般线性规划问题具有线性方程组的变量数大于方程个数,这时会有不定的解。当决策变量个数n和约束条件个数m较大时,单纯形法是求解线性规划问题的通用方法。 从线性方程组找出一个个的单纯形,每一个单纯形可以求得一组解,然后再判断该解使目标函数值是增大还是变小了,决定下一步选择的单纯形。通过优化迭代,直到目标函数实现最大或最小值(In general linear programming problems, the number of variables with linear equations is greater than the number of equations. When the number of decision variables n and constraint number m are large, simplex method is the general method for solving linear programming problems. Find out one by one from the linear equations of the simplex, each a simplex can get a set of solution, and then concludes that the solution is the objective function value increases or smaller and decided to choose the next simplex. By optimizing iteration, until the target function achieves the maximum or minimum value.)
    2018-03-27 17:22:03下载
    积分:1
  • 696518资源总数
  • 105885会员总数
  • 31今日下载