登录
首页 » matlab » zjzb

zjzb

于 2010-01-04 发布 文件大小:158KB
0 72
下载积分: 1 下载次数: 4

代码说明:

  使用MatLab绘制直角坐标系,以便于更加快捷地画图。很实用。(MatLab)

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

发表评论

0 个回复

  • OFDM
    说明:  OFDM系统功能仿真,很好很强大,嗯嗯嗯(OFDM system, functional simulation, very good very strong, er er er)
    2010-03-25 10:18:11下载
    积分:1
  • GM1_1
    灰色系统GM(1,1)模型及其检验,用于时间序列预测(grey system GM(1,1)model and its testing,can be used to predict)
    2009-12-06 02:17:40下载
    积分:1
  • Main_SVR_Epsilon
    该文件为支持向量机模型参数的matlab代码 支持向量机模型为专门用于处理不平衡数据的成本控制型支持向量机模型(Matlab code for support vector machine model parameters in the file support vector machine model specifically for the cost of dealing with unbalanced data control support vector machine model)
    2012-05-21 20:07:58下载
    积分:1
  • GA
    说明:  genetic algorithm with matlab
    2011-08-29 19:08:47下载
    积分:1
  • Chebyshew-1-band-pass
    Chebyshew-1型带通模拟滤波器,可以较好的实现边界滤波(Chebyshew-1,band pass filter,used for signal processing)
    2014-09-08 12:43:18下载
    积分:1
  • Bouc-Wen
    Bouc-Wen非线性滞回模型仿真程序,通过此程序可观察Bouc-Wen模型中各参数对其所描述的滞回曲线形状的影响(Bouc-Wen nonlinear hysteretic model simulation program, described by the Bouc-Wen model parameters on the hysteresis curve shape can be observed through this program)
    2021-04-08 16:19:01下载
    积分:1
  • range_compress
    SAR回波距离压缩程序,对于初学的同学会有很大的帮助,思路清晰,使用结构体编的(SAR echo range compress )
    2014-12-10 14:36:29下载
    积分:1
  • D2Q9
    格子LBM计算典型参考,不错的介观计算方法(LBM calculation of the typical reference grid, a good mesoscopic method)
    2010-07-11 22:34:06下载
    积分:1
  • K-meanCluster
    How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments. (How the K-mean Cluster workStep 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (Nk) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3. Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4. Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.)
    2007-11-15 01:49:03下载
    积分:1
  • fixed_point
    Fixed-Point iteration(Function fixed_point(p0, N) approximates the solution of an equation f(x) = 0, rewritten in the form x = g(x), which is a sub-function the user has to enter. the call to the function fixed_point(p0, N) returns the root of the equation f(x),i.e. the fixed-point of g(x), if the procedure is successful or a sequence of iterates in case something goes wrong. p0 is the initial approximation and N the maximum number of iterations. If, after N iterations, condition |x(k)- x(k-1)| < tol is not satisfied, all iterated values will be displayed, accompanied by a message asking the user to either change p0 in case of divergence or enter another g(x) that does not lead to complex numbers arithmetics. Reasons for the program to go wrong are the divergence of iterates and/or appearance of complex numbers for example with functions involving sqrt(x) when one of the iterates is negative. )
    2009-05-14 04:43:58下载
    积分:1
  • 696522资源总数
  • 104042会员总数
  • 54今日下载