-
Lti_system
连续LTI系统的时域分析连续时间系统的单位冲激响应、单位阶跃响应在线性系统分析中的作用、地位及其MATLAB实现(Lti system for the time domain analysis)
- 2010-12-06 22:38:16下载
- 积分：1
-
basicmpc
一个简单的预测控制例子，基本预测控制算法(Predictive control of a simple example, the basic predictive control algorithm)
- 2008-06-01 21:57:40下载
- 积分：1
-
Lepingle_Ribemont_SDE
随机微分方程数值解！ Numercal Sulution Of Stochastic Differential Equations
By Peter E.Kloeden Eckhard Platen
PC-Exercise 11.4.1
Figure 11.4.1
求解方程 11.4.1(Numercal Sulution Of Stochastic Differential Equations
By Peter E.Kloeden Eckhard Platen
PC-Exercise 11.4.1
Figure 11.4.1
)
- 2011-12-24 09:42:09下载
- 积分：1
-
《卡尔曼滤波原理及应用-MATLAB仿真》
卡尔曼滤波的原理及应用书的破地方，以及书中例子的源代码(The principle of Kalman filtering and the broken place of the application book, as well as the source code of the examples in the book)
- 2018-05-17 10:09:44下载
- 积分：1
-
mfd工具箱
说明： MDF多变量频域设计，用于对多变量系统的设计(MDF multivariable frequency domain design for multivariable system design)
- 2020-05-16 20:36:15下载
- 积分：1
-
Matlab_基于FFT的图像配准
说明： 简单的用相位相关法来粗估计图像间的平移参数(simple phase correlation method used to estimate the image of rough translation parameters)
- 2005-12-02 14:14:26下载
- 积分：1
-
spectral_color_1
this program is useful for spectral colour
- 2011-09-22 14:23:29下载
- 积分：1
-
fractal-use
分形的练习一
①Koch曲线
用复数的方法来迭代Koch曲线
clear i 防止i被重新赋值
A=[0 1] 初始A是连接（0，0）与（1，0）的线段
t=exp(i*pi/3)
n=2 n是迭代次数
for j=0:n
A=A/3 a=ones(1,2*4^j)
A=[A (t*A+a/3) (A/t+(1/2+sqrt(3)/6*i)*a) A+2/3*a]
end
plot(real(A),imag(A))
axis([0 1 -0.1 0.8])
②Sierpinski三角形
A=[0 1 0.5 0 0 1] 初始化A
n=3 迭代次数
for i=1:n
A=A/2 b=zeros(1,3^i) c=ones(1,3^i)/2
A=[A A+[c b] A+[c/2 c]]
end
for i=1:3^n
patch(A(1,3*i-2:3*i),A(2,3*i-2:3*i), b ) patch填充函数
end
(Fractal
Exercise One
The ① Koch curve
Plural iteration Koch curve
clear i to prevent i is reassigned
A = [0 1] initial A is a connection (0,0) and (1,0) of the segments
t = exp (i* pi/3)
n = 2 n is the number of iterations
for j = 0: n
A = A/3 a = ones (1,2* 4 ^ j)
A = [A (t* A+ a/3) (A/t+ (1/2+ sqrt (3)/6* i)* a) A+2/3* a]
end
plot (real (A), imag (A))
axis ([0 1-0.1 0.8])
② Sierpinski triangle
A = [0 1 0.5 0 0 1] initialized A
n = 3 the number of iterations.
for i = 1: n
A = A/2 b = zeros (1,3 ^ i) c = ones (1,3 ^ i)/2
A = [A A+ [c b] A+ [c/2 c]]
end
for i = 1:3 ^ n
patch (A (1,3* i-2: 3* i), A (2,3* i-2: 3* i), b ) patch filled function
end)
- 2013-03-02 10:03:09下载
- 积分：1
-
calculate_angle
给定地理坐标（经度、纬度），求出一年中每一天的太阳高度角和方位角(Given geographic coordinates (latitude and longitude), each day of the year, the sun s elevation angle and azimuth angle)
- 2016-06-04 13:02:47下载
- 积分：1
-
emd+信息熵
可以实现机械EMD经验模态分解，提取特征量并利用神经网络进行模式识别故障类型(The empirical mode decomposition of mechanical EMD can be realized, feature quantity is extracted and neural network is used to identify the type of fault.)
- 2018-01-31 16:13:02下载
- 积分：1
