登录
首页 » matlab » alpha-matlab

alpha-matlab

于 2012-08-07 发布 文件大小:167KB
0 159
下载积分: 1 下载次数: 325

代码说明:

  matlab产生Alpha稳定分布随机数;Alpha稳定分布概率密度函数计算;Alpha稳定分布的分布函数计算等(Matlab produce Alpha stable random number distribution Alpha stability distribution probability density function computing Alpha stability distribution of distribution function is presented)

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

发表评论

0 个回复

  • Fuuzy
    利用模糊理论计算开关柜运行状态,层次分析法(Fuzzy theory based operating condition assessment For MV switchgear)
    2012-05-11 09:41:54下载
    积分:1
  • projection
    CT迭代重建算法中3维投影矩阵的生成算法,该算法对学习计算机断层层析成像很有帮助。(CT image reconstruction projection ,3D)
    2012-10-26 23:46:42下载
    积分:1
  • Problem1
    说明:  用fortran 70实现数值积分,并实例计算了三个函数,导出了积分值和误差(The numerical integration is realized by FORTRAN 70, and three functions are calculated with examples. The integral values and errors are derived.)
    2019-04-16 20:49:25下载
    积分:1
  • ComputationalElectromagnetics
    计算电磁学基础教材, 包括MOM FEM FDTD(fundmental materail for beginner include MOM FEM FDtd)
    2009-06-15 22:22:24下载
    积分:1
  • ModelC_alloy
    说明:  相场法材料计算的modelc-alloy 对应的基础代码,自取基础有用(The basic code corresponding to modelc-alloy for phase field method material calculation, useful for self-extraction)
    2020-06-25 12:40:02下载
    积分:1
  • 11087 统逆序对
    Description 设a[0…n-1]是一个包含n个数的数组,若在i<j的情况下,有a[i]>a[j],则称(i, j)为a数组的一个逆序对(inversion)。 比如 <2,3,8,6,1> 有5个逆序对。请采用类似“合并排序算法”的分治思路以O(nlogn)的效率来实现逆序对的统计。 一个n个元素序列的逆序对个数由三部分构成: (1)它的左半部分逆序对的个数,(2)加上右半部分逆序对的个数,(3)再加上左半部分元素大于右半部分元素的数量。 其中前两部分(1)和(2)由递归来实现。要保证算法最后效率O(nlogn),第三部分(3)应该如何实现? 此题请勿采用O(n^2)的简单枚举算法来实现。 并思考如下问题: (1)怎样的数组含有最多的逆序对?最多的又是多少个呢? (2)插入排序的运行时间和数组中逆序对的个数有关系吗?什么关系? 输入格式 第一行:n,表示接下来要输入n个元素,n不超过10000。 第二行:n个元素序列。 输出格式 逆序对的个数。 输入样例 5 2 3 8 6 1 输出样例 5(Set a[0... N-1] is a n array containing n numbers. If there is a [i] > a [j] i n the case of I < j, then (i, j) is a n inversion pair of a array. For example, <2,3,8,6,1> has five reverse pairs. Please use the idea of "merge sorting algorithm" to achieve the statistics of inverse pairs with O (nlogn) efficiency. The number of inverse pairs of a sequence of n elements consists of three parts: (1) The number of reverse pairs in the left half, (2) the number of reverse pairs in the right half, (3) the number of elements in the left half is greater than that in the right half. The first two parts (1) and (2) are implemented by recursion. To ensure the final efficiency of the algorithm O (nlogn), how should the third part (3) be implemented? Do not use O (n ^ 2) simple enumeration algorithm to solve this problem.)
    2019-01-07 23:52:06下载
    积分:1
  • SPH3DOnTheBook
    Dr. Liu 在《光滑粒子流体动力学--一种无网格方法》一书中提供的光滑粒子流体动力学(SPH)源程序,采用Fortran语言编写,用于计算可压缩流体力学问题。(Dr. Liu in the " Smooth Particle Hydrodynamics- a meshless method," a book provided by the smooth particle hydrodynamics (SPH) source code, using Fortran language, used to calculate the fluid flow problem.)
    2021-01-08 11:58:51下载
    积分:1
  • ADINA-Program
    有限元源程序,结构分析软件,可以用于结构工程、近海工程等领域。(Adina FEM Program, can be used in structural engineering, offshore engineering, and so on)
    2012-12-26 20:47:21下载
    积分:1
  • Classificacao
    Code for Classification of points
    2012-09-22 21:07:01下载
    积分:1
  • 第7章实例:压电变换器的自振频率分析
    说明:  有限元分析视频学习,可用于有限元分析视频学习(Finite element analysis video learning, used for finite element analysis video learning)
    2020-03-21 16:06:34下载
    积分:1
  • 696518资源总数
  • 106227会员总数
  • 11今日下载