-
EM
自己编写的期望最大化（EM）算法的MATLAB实现，里面有较为运行方法和程序说明，对新手有很好的帮助(
I have written the expectation-maximization (EM) algorithm in MATLAB, which has run more methods and procedures described, there is a good help for the novice)
- 2014-02-09 17:12:01下载
- 积分：1
-
kabg
α-β-γ滤波函数，可实现对等间隔的观测数据进行滤波估计。(α-β-γ filter function design by C language. Complete the filter evaluation function for equidistant discrete data.)
- 2013-08-19 16:40:24下载
- 积分：1
-
fft
用DFT 函数计算电压u, 电流i的基波(f1=50 Hz)的有效值和相位;
用FFT函数分别计算电压u和电流i 所包含的直流,基波和谐波的有效值和初相角;
可计算基波(f1=50 Hz)和各次谐波的功率p和功率因数con?.(The effective value and phase of fundamental wave (f1 = 50 Hz) of voltage U and current I are calculated by DFT function.
The effective values and initial phase angles of DC, fundamental and harmonic waves contained in voltage U and current I are calculated by FFT function, respectively.
The power P and power factor con of fundamental wave (f1 = 50 Hz) and harmonics can be calculated.)
- 2019-03-28 15:48:19下载
- 积分：1
-
302.L7.15Nov02
关于弹性能的一个ppt和弹性能计算有关很有用(Microstructure-Properties Elastic Effects, Interfaces)
- 2012-02-09 01:23:50下载
- 积分：1
-
Moving-Least-Square-Method
用于多学科设计优化中代理模型技术，移动最小二乘法是代理模型方法的一种(For multidisciplinary design optimization in the agent model, the moving least squares method is a kind of agent model)
- 2020-11-12 09:39:43下载
- 积分：1
-
常微分方程数值解法
常微分方程数值解法，又是一个数值分析的常用算法(Numerical Solution of ordinary differential equations, numerical analysis is a common algorithm)
- 2005-01-31 22:13:30下载
- 积分：1
-
FDTD_3D_PEC
说明： FDTD的3D源程序,PEC边界,比较详细(FDTD the 3D source, PEC boundary, a more detailed)
- 2021-01-18 10:48:43下载
- 积分：1
-
hhspectrum
Hilbert Haung spectrum
- 2012-07-19 00:52:09下载
- 积分：1
-
Fr_bin2dec
converts binary sequence to decimal sequence
- 2013-09-06 18:40:37下载
- 积分：1
-
单纯形法Matlab程序-2016-11-17
一般线性规划问题具有线性方程组的变量数大于方程个数，这时会有不定的解。当决策变量个数n和约束条件个数m较大时，单纯形法是求解线性规划问题的通用方法。
从线性方程组找出一个个的单纯形，每一个单纯形可以求得一组解，然后再判断该解使目标函数值是增大还是变小了，决定下一步选择的单纯形。通过优化迭代，直到目标函数实现最大或最小值(In general linear programming problems, the number of variables with linear equations is greater than the number of equations. When the number of decision variables n and constraint number m are large, simplex method is the general method for solving linear programming problems.
Find out one by one from the linear equations of the simplex, each a simplex can get a set of solution, and then concludes that the solution is the objective function value increases or smaller and decided to choose the next simplex. By optimizing iteration, until the target function achieves the maximum or minimum value.)
- 2018-03-27 17:22:03下载
- 积分：1
