登录
首页 » matlab » improve PI model

improve PI model

于 2018-03-20 发布 文件大小:1KB
0 276
下载积分: 1 下载次数: 11

代码说明:

  基于改进的PI模型对非线性曲线进行拟合,二次寻优算法进行参数辨识,用逆模型前馈补偿(Based on the improved PI model, the nonlinear curve is fitted, and the second optimization algorithm is used to identify the parameters, and the inverse model feedforward compensation is used.)

文件列表:

improve.m, 2834 , 2018-02-06

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

发表评论

0 个回复

  • gatbx
    matlab工具箱 包括测试函数 可实现函数调用(matlab toolbox includes a function call test functions can be realized)
    2011-01-01 19:49:39下载
    积分:1
  • ldpc_system_standard
    matlab 版本的LDPC码的译码工具包,很实用(LDPC decoding tollkit of MATLAB Version)
    2013-07-16 10:50:09下载
    积分:1
  • FLDAandPDF
    人脸识别的一种基本算法,非常简练,注释也很详细(face recongnition)
    2010-05-19 11:53:16下载
    积分:1
  • cd
    说明:  code for image subtraction
    2014-01-27 14:07:44下载
    积分:1
  • K-meanCluster
    How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments. (How the K-mean Cluster workStep 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (Nk) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3. Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4. Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.)
    2007-11-15 01:49:03下载
    积分:1
  • Decode
    说明:  PacketX解码例子Decode.rar(PacketX\Examples\Scripts\Decode.rar)
    2010-03-30 10:38:23下载
    积分:1
  • floyd
    MATLAB最短路径,最基础的计算网络最短路径的算法 floyd - 最短路问题 Syntax: [d,path]=floyd(a,sp,ep) (MATLAB shortest path, the most basic computing network shortest path algorithm)
    2013-04-10 21:01:30下载
    积分:1
  • Untitled6
    分别用矩形窗、汉宁窗、海明窗、三角窗和Blackman窗设计一 的线性相位带通滤波器,观察它们的3dB和20dB带宽,并比较五种窗的特点。(Respectively rectangular window, Hanning, Hamming window, triangular window and Blackman window design a linear phase bandpass filter, observe their 3dB and 20dB bandwidth and compare the characteristics of the five windows.)
    2015-04-16 10:30:39下载
    积分:1
  • MATLAB在振动信号处理中的应用
    matlab在振动信号处理中的应用源代码及pdf(Application of MATLAB in vibration signal processing source code and PDF)
    2021-03-16 15:09:21下载
    积分:1
  • GA
    说明:  implementation of an example in genetic algorithms
    2011-01-10 00:33:09下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载