登录
首页 » matlab » RS

RS

于 2010-08-19 发布 文件大小:1KB
0 270
下载积分: 1 下载次数: 0

代码说明:

说明:  采用RS极重标差分析法得到HURST指数。参数sequence为输入的时间序列。(RS heavy use of standard deviation analysis by HURST index. Parameter sequence for the input time series.)

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

发表评论

0 个回复

  • Soulution
    binary hypothesis test solution
    2010-06-08 01:57:49下载
    积分:1
  • gmres_m
    gmres算法的一个特殊形式,用来求解大型稀疏矩阵方程(gmres algorithm a special form used to solve large sparse matrix equation)
    2005-04-21 01:03:45下载
    积分:1
  • DTC_MSAP
    simulink matlab DTC msap dtc.mdl secteur.m table.m
    2012-03-26 04:32:41下载
    积分:1
  • czhx
    matlab实现的磁滞回线的源码,并附有中文解释,可以根据需要修改(matlab implementation of the hysteresis loop of the source with a Chinese interpretation may need to modify)
    2020-08-03 19:18:34下载
    积分:1
  • tdu70
    重力异常的向上延拓程序,很实用,推荐地球物理学生学习(Gravity anomaly upward extension procedure is very useful, recommended geophysics students)
    2009-04-12 19:32:43下载
    积分:1
  • MATLAB-codes
    matlab几乎所有数值计算程序,都包括在内,数值积分数值微分,方程求根等等,几乎所有需要用到的程序(The matlab almost all numerical procedures, including numerical integration numerical differentiation equation Root, etc., almost all the needed procedures)
    2013-01-10 19:23:27下载
    积分:1
  • jilei
    matlab实现信号的相参积累和非相参积累源代码(matlab realization the signal coherent integration and non-coherent accumulation of source code)
    2020-11-06 19:39:49下载
    积分:1
  • absorber
    1-D Uniaxial-PML code
    2009-11-07 00:46:55下载
    积分:1
  • Logic-Non-circulating-DC-Speed-Control-System-Matl
    逻辑无环流直流可逆调速系统的Matlab仿真(Logic Non-circulating DC Speed Control System Matlab simulation of reversible)
    2020-07-22 01:28:44下载
    积分:1
  • danchunxingfa
    单纯形法,求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是:线性规划问题的可行域是 n维向量空间Rn中的多面凸集,其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是:先找出一个基本可行解,对它进行鉴别,看是否是最优解;若不是,则按照一定法则转换到另一改进的基本可行解,再鉴别;若仍不是,则再转换,按此重复进行。因基本可行解的个数有限,故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination. )
    2011-01-17 21:01:44下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载