登录
首页 » matlab » matlabzhuiganfa

matlabzhuiganfa

于 2011-04-04 发布 文件大小:1KB
0 336
下载积分: 1 下载次数: 0

代码说明:

说明:  利用matlab实现的追赶法,是数值分析的重要工具(matlab zhuiganfa)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • stft_cf
    A matlab function that calculates the short term Fourier transform with adjustable parameters.
    2009-09-26 04:18:48下载
    积分:1
  • julei
    matlab的fcm聚类源程序,希望对大家有帮助。谢谢(The fcm clustering matlab source code, want to help everyone. Thanks)
    2010-01-05 18:03:10下载
    积分:1
  • KALAMN
    一种扩展卡尔曼滤波算法源程序 简单易懂 功能强大(an extended Kalman filter algorithm source code is simple to understand the powerful)
    2007-05-31 17:14:01下载
    积分:1
  • GABOR
    图象处理Gabor.对Gabor的原理,参数设置以及滤波后的效果进行了说明(Image processing Gabor. The principle of Gabor, parameter setting and the effect after filtering)
    2013-12-27 21:53:51下载
    积分:1
  • mpi_kmeans-1.5
    Super-fast kmeans code in C++/matlab/python
    2009-06-03 15:54:24下载
    积分:1
  • kalmanfilter_example
    说明:  自己写的一段kalman滤波,非常基础,加入了一致性分析(Himself wrote a kalman filter, very basic, joined the consistency analysis)
    2011-03-25 16:52:41下载
    积分:1
  • ask
    amplitude sjift keyingg
    2013-12-03 20:32:58下载
    积分:1
  • Layer-N
    层数N对光子晶体带隙的影响,不同的介质层数N,即不同的周期数,传输矩阵也不同,光子晶体的反射率和透射率也不同。(Influence of layers N bandgap of photonic crystals)
    2013-05-04 21:31:09下载
    积分:1
  • Probabilistic-Neural-Network-
    Probabilistic Neural Network
    2014-02-20 10:45:11下载
    积分:1
  • small-world-networks
    1998年, Watts和Strogatz 提出了小世界网络这一概念,并建立了WS模型。 实证结果表明,大多数的真实网络都具有小世界特性(较小的最短路径) 和聚类特性(较大的聚类系数) 。 WS小世界模型构造算法 1、从规则图开始:考虑一个含有N个点的最近邻耦合网络,它们围成一个环,其中每个节点都与它左右相邻的各K/2节点相连,K是偶数。 2、随机化重连:以概率p随机地从新连接网络中的每个边,即将边的一个端点保持不变,而另一个端点取为网络中随机选择的一个节点。其中规定,任意两个不同的节点之间至多只能有一条边,并且每一个节点都不能有边与自身相连。 (In 1998, Watts and Strogatz proposed the concept of the small world network, and the establishment of the WS model. The empirical results show that most real networks have small world (the smaller the shortest path) and clustering properties (high clustering coefficient). WS small-world model construction algorithm 1, from the rules FIG: consider a nearest neighbor coupling network with N points, they are surrounded by a ring, wherein each node and its left and right adjacent to each of K/2 connected to the node, K is an even number. The 2 randomized reconnection: randomly with probability p from the new connection on each side of the network, coming section of one of the endpoints remain unchanged, while the other endpoint is taken as the random selection of a node in the network. Which states that between any two different nodes can have at most one edge, and each node can not be connected to its own side.)
    2021-04-27 08:08:44下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载