-
calfem_3[1].4
用于在matlab平台上进行有限元分析，calfem(Matlab platform used in the finite element analysis, calfem)
- 2007-10-06 22:17:05下载
- 积分：1
-
SB2_Likelihoods
相关向量机，的极大似然估计文件与SB2配合使用，可以进行扩展(Relevance vector machine, maximum likelihood estimation file with SB2 used in conjunction, can be extended)
- 2012-11-28 17:10:19下载
- 积分：1
-
Threshold_test
说明： FFH中传统门限的比较获取，SNR的不同，BER不同，从中最佳(FFH traditional threshold comparison to obtain, SNR different, BER is different from the best)
- 2008-09-18 21:21:44下载
- 积分：1
-
PVmodule
说明： 自己做的太阳能光伏电池仿真模型，外带参考资料！PV(pv and reference book)
- 2011-03-24 22:42:16下载
- 积分：1
-
MATLAB_symbol-operation
收集的matlab符号运算的电子书籍与文档资料，对于熟悉了matlab数值运算想对符号计算有所了解的可以看看。(Matlab symbolic operation collected the e-books and documentation, for those familiar with the matlab numerical computation would like to understand the symbolic computation can take a look at.)
- 2007-11-07 20:41:22下载
- 积分：1
-
matlabchoach
MATLAB的教程，彩色页面，简单易懂，是大家学习MATLAB的好教材。(MATLAB tutorial, simple, easy to understand)
- 2009-05-06 04:38:21下载
- 积分：1
-
Matalbforjava
说明： JAVA与MATLAB配置说明，实现Java与MATLAB连接通讯(JAVA and MATLAB configuration instructions, Java and MATLAB to achieve intercellular communication)
- 2010-04-26 21:40:58下载
- 积分：1
-
Network
Matlab Networks codes
- 2011-10-18 18:30:23下载
- 积分：1
-
Hibert
希尔伯特变换理论及matlab程序( Hibert for matlab )
- 2020-07-31 18:48:37下载
- 积分：1
-
xiashan
MATLAB 牛顿下山法的一个小程序，原理就不详细说了。因牛顿迭代法受初值选取的限制，为防止迭代发散，对迭代过程再附加一项要求:|f(x(k+1))|<|f(x(k))|,将牛顿法迭代的结果:x(k+1) =x(k)-f(x(k))/f (x(k))和前一近似值x(k)适当加权平均做为新的改进值:x(k+1)=u*x(k+1) +(1-u)*x(k),其中u(0<>
迭代时u取1开始，逐次减半计算，直至附加要求符合为止。实例计算中x(k)=x(0)不变，只更新u和x(k+1)，直至:|f(x(k+1))|<|f(x(k))|（即|f(x(1))|<|f(x(0))|)，然后更新下山因子为u=1,继续以牛顿法迭代。(MATLAB Newton-down a small program, the principle is not explained in detail. Newton iteration by the initial value of the selected limit, in order to prevent additional iterative divergence, the iterative process a request: | f (x (k+1)) | < | f (x (k)) | Newton iteration Results: x (k+1) ' = X (k)-f (x (k))/f' (x (k)) and a previous approximation x (k), appropriately weighted average as a new improved value: x (k+1 ) = u* x (k+1) ' + (1-u)* x (k), where u (0 < u> iteration take successive calculated at 50 until the additional requirements found so far. examples of calculation of X ( k) = x (0) unchanged profile u and x (k+1, hungry) until: | f (x (k+1)) | < | f (x (k)) | (i.e. | f (x (1)) | < | f (x (0)) |), then profile downhill factor for u = 1, to continue to Newton iteration.)
- 2013-05-15 08:52:09下载
- 积分：1
