登录
首页 » matlab » smallest

smallest

于 2006-06-07 发布 文件大小:14KB
0 225
下载积分: 1 下载次数: 125

代码说明:

  这是数值计算当中最小二乘法的例子,在matlab中实现(This is the numerical calculations of the least squares method, for example to achieve Matlab)

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

发表评论

0 个回复

  • Matlab
    RD成像算法,快速傅里叶变换函数,适合学习(RD imaging algorithm, fast Fourier transform function, suitable for learning)
    2020-08-13 18:58:29下载
    积分:1
  • TESTGLP0
    计算天体力学中常用的HANSEN函数,对偏心率小于0.1时适用(This code for hansen function )
    2012-04-06 16:23:13下载
    积分:1
  • PFC
    晶体相场计算原子密度场分布和缺陷形成,基本程序,用于科学计算。基于Fortran 6.5编写,在其他应用程序中可能需要略微修改(Phase-field crystal modeling of atomic density field distribution)
    2016-06-25 21:55:18下载
    积分:1
  • ekfslam_v2.0
    It is a code for simulation of fast slam in matlab
    2012-10-10 07:43:08下载
    积分:1
  • matlab版本的动态非结构网格划分程序
    matlab版本的动态非结构网格划分程序,希望对你们有用,欢迎下载。(matlab version of the dynamic non-structural meshing program, I hope useful to you, welcome to download.)
    2012-12-05 13:41:25下载
    积分:1
  • quantreg
    使用matlab进行分位数回归,类似于R语言中的quanterg包(Quantile regression using MATLAB)
    2021-02-07 23:29:55下载
    积分:1
  • c_and_f
    c/C++跟fortran语言之间的一些转换(c/C fortran language with the conversion between)
    2007-05-31 13:46:32下载
    积分:1
  • FEMCalc
    应用于高速碰撞的相关子程序,考虑了在高速碰撞中单元畸变的沙漏模型。。(Related subroutines used in high-speed collision, taking into account distortion in high speed crash in the hourglass model unit. .)
    2010-06-24 17:39:20下载
    积分:1
  • jsp_ga_Matlab
    车间调度问题的遗传算法matlab源程序,供大家参考(shop scheduling GA Matlab source for reference)
    2007-05-28 17:38:01下载
    积分: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
  • 696516资源总数
  • 106914会员总数
  • 0今日下载