网站首页

cg

于 2012-01-15 发布文件大小:2KB

 0  139

下载积分: 1 下载次数: 0

我要下载

代码说明：

说明： conjugate gradient for solving system of equations

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

WSN1
WIRESLESS SENSOR NETWORKS ALGORTHIM

2013-01-26 15:27:21下载

积分：1
dongtaichuanjiankongjian
案例设计源程序，matlab动态创建控件，有函数有界面的设计(Case design source, matlab dynamically created controls, there are functions with interface design)

2013-09-02 16:02:46下载

积分：1
SMI
说明：单输入输出子空间moesp算法，可直接进行调用(Single-input-output subspace MOESP algorithm)

2019-03-16 19:50:06下载

积分：1
congestion-control
级联故障和拥塞控制及在无标度网络上的传播(Cascading failure and congestion control and spreading in scale-free networks.)

2014-08-12 11:24:14下载

积分：1
pwm-rectifier
this file includes PWM rectifier document

2014-08-15 19:07:47下载

积分：1
matlab
运用ode45求解微分方程，并用matlab做出其图形(Use ode45 to solve differential equations, and make its graphics with matlab)

2012-11-12 22:04:56下载

积分：1
Recursive_integer_division
递归法求解整数划分。整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )

2014-02-06 14:21:38下载

积分：1
SPSAfordesignofanattentionalstrategydesign
SPSA for design of an attentional strategy design

2010-07-09 13:32:18下载

积分：1
icaFacesCode
Independent component analysis for face recognition

2009-11-08 00:55:33下载

积分：1
4-ary-LDPC
4-ary LDPC matlab code

2020-08-25 13:28:16下载

积分：1

696518资源总数
105885会员总数
31今日下载

cg

0 个回复

热门标签

热门下载