登录
首页 » matlab » Flexibility-difference

Flexibility-difference

于 2012-05-27 发布 文件大小:3KB
0 269
下载积分: 1 下载次数: 137

代码说明:

  基于柔度差算法实现结构的损伤识别,附算例的节点坐标和单元文件(Compliance difference algorithm for structural damage identification, with examples of the node coordinates and unit files)

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

发表评论

0 个回复

  • virtual
    提高了摄像机标定仿真实验的一些源码,主要内容是虚拟图像生成的源码(Improve the calibration of some source simulation, the main contents of the virtual image generated source code)
    2010-08-19 00:45:50下载
    积分:1
  • MATLAB-Simulations-for-Radar-Systems-Design
    关于雷达信号处理的教程,详细介绍了雷达信号的分类,以及处理方式(On radar signal processing tutorial, detailing the classification of radar signals, as well as treatment modalities)
    2008-06-03 09:38:43下载
    积分:1
  • Changes_for_Curvelet_retrieval.doc
    modification for curvelet code running
    2011-06-10 12:13:07下载
    积分:1
  • xiaoshengjing
    用小生境遗传算法优化一元函数,包括主程序和各子程序,直接运行出结果。(Using niche genetic algorithm to optimize the function, including the main program and each subroutine, run directly from the results. )
    2014-09-23 08:56:21下载
    积分:1
  • omp
    omp算法,该编码通俗易懂,应用简单。用于求压缩感知中,在字典D已知的前提下,一个信号在该字典上的稀疏表示。(omp algorithm, and compressed sensing, sparse representation of a signal in the dictionary in the dictionary D known premise.)
    2012-11-21 18:21:10下载
    积分:1
  • psofortsp
    Optimization using Particle Swarm Optimization for Travelling Selesman Problem with Matlab
    2014-02-14 14:51:12下载
    积分:1
  • myrcsfj
    利用近远场外推做圆柱体雷达散射截面,并用fdtd方法。(Make use of the near and far field extrapolation cylinder RCS and use fdtd method.)
    2014-06-20 02:33:23下载
    积分:1
  • ukf_for_track_6_div_system
    采用卡尔曼滤波方法,对移动目标的状态进行估计(Kalman filter method is used to estimate the state of moving targets.)
    2019-01-15 10:12:52下载
    积分:1
  • eg28-dingdanxuqiuyuce
    《MATLAB神经网络30个案例分析》中的第28个例子,案例28 灰色神经网络的预测算法—订单需求预测。希望对大家有一定的帮助!(The MATLAB neural network analysis of 30 cases of 28 example, 28 cases of grey neural network prediction algorithm- order demand forecasting. Hope to have certain help to everybody! )
    2013-09-20 16:46:33下载
    积分:1
  • yiqunsuanfaTSP
    说明:  利用蚁群算法解决TSP问题,本例涉及了31个城市并将其坐标化,每个城市只能拜访一次,而且最后要回到初始城市,所选路径为所有路径之中的最小值。(Using ant colony algorithm to solve TSP problem, this example involves 31 cities and coordinates them, each city can only visit once, and finally return to the initial City, the selected path is the minimum of all paths.)
    2019-11-13 16:58:28下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载