登录
首页 » matlab » LeastSquareComplexExponential

LeastSquareComplexExponential

于 2013-12-18 发布 文件大小:3KB
0 310
下载积分: 1 下载次数: 26

代码说明:

  最新比较流行的模态识别方法,最小二乘复指数法(LeastSquareComplexExponential(LSCE) for modal analysis)

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

发表评论

0 个回复

  • WCDMAsim
    说明:  WCDMA链路仿真,包括源代码与相关文档资料。(WCDMA Link Simulation, including source code and related documentation.)
    2008-12-08 12:10:15下载
    积分:1
  • multidiel
    multidiel.m - reflection response of isotropic or birefringent multilayer structure( multidiel.m- reflection response of isotropic or birefringent multilayer structure)
    2009-10-10 20:25:43下载
    积分:1
  • TE_model2d
    利用二维时域有限差分法纵向TE波模拟钻井(Using two-dimensional finite difference time domain simulation of drilling TE wave)
    2010-10-16 11:34:29下载
    积分:1
  • code
    MATLAB code for back propogation neural networks for more than five variable
    2013-11-15 18:50:14下载
    积分:1
  • Untitled21
    小波包进行信号去噪的m文件,在matlab中可以直接调用(Wavelet packet signal de-noising m file in matlab can be called directly)
    2020-10-30 19:59:56下载
    积分:1
  • VRP
    利用遗传算法 解决带时间窗口的车辆路径优化问题(VRP)(Genetic algorithm to solve vehicle window with Time Routing Problem (VRP))
    2016-05-27 17:11:14下载
    积分:1
  • redundancy
    我们可以用这个程序来计算信息论中的一个重要的概念,即数据的冗余度(we can use it to calculate the recedency)
    2009-02-17 22:29:19下载
    积分:1
  • LFMradar
    线性调频(LFM)脉冲压缩雷达仿真,有具体的方法和实现步骤,包括仿真结果。(Linear frequency modulation (LFM) pulse compression radar simulation, there are specific methods and implementation steps, including the simulation results.)
    2010-12-17 16:29:23下载
    积分:1
  • DTPathPlan
    基于距离转换的栅格地图路径规划方法,DT方法是从目标位置反向搜索路径。在栅格化环境中,从目标位置开始的距离传播视为一个波(wave front)沿空闲栅格传播。对于环境中任意给定的起始点,其到目标点的最短路径可通过使用最速下降法搜索而得到。(Raster map conversion path planning approach based on distance, DT reverse the search path from the target location. Distance from the target location in the grid environment, spread as a wave (wave front) along the idle grid dissemination. Starting point for any given environment, the shortest path to the target point by using the steepest descent method of searching.)
    2012-07-16 21:50:10下载
    积分:1
  • find-mobile-user
    To find a triangulation of minimal total edge length. That is, an input polygon or the convex hull of an input point set must be subdivided into triangles that meet edge-to-edge and vertex-to-vertex, in such a way as to minimize the sum of the perimeters of the triangles.
    2014-08-13 13:54:45下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载