资源列表
RLS
- 本示例展示在系统辨识课程中最基本的方法 -最小二乘法的仿真实现，开发环境为matlab2010a-The realization of the least square algorithm based on matlab.
extended_rls
- 本例程为系统辨识中的增广最小二乘法的matlab实现，用于解决ARMAX模型的辨识。-This routine as augmented least-square method in the identification of the system of matlab, is used to solve the ARMAX model identification.
Traitement-dimage
- Différent traitement d image les différents traitements à base d histogramme Redimensionnement rotation différents types de bruits filtre détection de contours détection de régions application de la morphologie mathématique-Différent traitement d ima
numerical-algorithms
- matlab 实现几个常用的解线性方程组的数值算法。包括共轭梯度法、预处理共轭梯度法、SOR、Lanczos.-matlab implementation of several commonly used numerical algorithm for solving linear equations. Including the conjugate gradient method, preconditioned conjugate gradient method, SOR, Lanczos.
PHD
- PHD 滤波器，用于多目标跟踪，很实用的方法-PHD fliter
CHAP4_6
- CMAC and PID Concurrent Control
CHAP3_1
- 专家PID控制仿真例程-Expert PID control
Untitled
- 成功实现计算Xnksts算法的程序，本人测试已经通过，需要MATLAB2009b环境运行，如有问题，请联系QQ：10462339-The successful implementation of the program to calculate Xnksts algorithm, I have passed the test, need MATLAB2009b operating environment, any questions, please contact QQ: 1046233911
source_code_jzhlvn
- 成功实现计算jsdiOX算法的程序，本人测试已经通过，性能给由于ljsldf算法，需要MATLAB2009b环境运行，如有问题，请联系QQ：10462339-The successful implementation of the program to calculate jsdiOX algorithm, I test has been passed to the due performance ljsldf algorithm that takes MATLAB2009b operating
Truss-Matlab-program
- 平面桁架Matlab程序，计算刚度矩阵使用程序-Truss Matlab program, use the program to calculate the stiffness matrix
zhengliudianlu
- 这是关于单相桥式晶闸管整流电路的MATLAB仿真模型，方便参考-This is the single-phase bridge thyristor rectifier circuit MATLAB simulation model, for easy reference
source_code_xuzgb9
- 成功实现计算alksdjo算法的程序，本人测试已经通过，性能给由于klsdf算法，需要MATLAB2009b环境运行，如有问题，请联系QQ：10462339-The successful implementation of the program to calculate Xnksts algorithm, I have passed the test, need MATLAB2009b operating environment, any questions, please contact Q