登录
首页 » matlab » giumiu_v41

giumiu_v41

于 2017-02-28 发布 文件大小:9KB
0 265
下载积分: 1 下载次数: 2

代码说明:

  wolf 方法计算李雅普诺夫指数,用于时频分析算法,旋转机械二维全息谱计算的实用例程。( wolf calculated Lyapunov exponent, For time-frequency analysis algorithm, Rotating Machinery dimensional hologram of practical spectrum calculation routines.)

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

发表评论

0 个回复

  • generation
    遗传算法反演子程序,可用于地球物理非线性反演(The genetic algorithm inversion subroutine, can be used for nonlinear geophysical inversion)
    2016-03-29 01:20:19下载
    积分:1
  • 蒙特塔罗
    说明:  通过matlab实现抽样检测功能,具体通过蒙特塔罗算法依照概率分布计算指定变量的分布规律,是初学者的好案例(The sampling detection function is realized by matlab, and the distribution rule of specified variables is calculated by Montreal algorithm according to probability distribution.)
    2019-10-06 08:28:50下载
    积分:1
  • zuixiaoerchengfa
    说明:  点云通过不同的多项式来进行曲线拟合,可以手动设置多项式的次数。(Point clouds are fitted by different polynomials,The degree of the polynomial can be set manually.)
    2020-10-07 16:34:58下载
    积分:1
  • roefou
    用Roe格式的一阶迎风差分方法解决欧拉方程的黎曼问题(Solves the Riemann problem for the Euler equations using Roe s first-order upwind method )
    2020-10-18 23:47:26下载
    积分: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
  • FDTD for optical waveguides.rar
    说明:  本程序是采用FDTD算法结合PML吸收边界,对对称三层平板光波导的模式场仿真(This program uses FDTD algorithm and PML absorbing boundary to simulate the mode field of symmetrical three-layer planar optical waveguide.)
    2020-09-10 16:08:00下载
    积分:1
  • 二维非稳态导热问题的Fortran程序
    计算二维非问题油内热源问题导热,可以参考学习(Calculation of two-dimensional non thermal problems in oil heat conduction, you can refer to the study)
    2017-11-23 10:44:02下载
    积分:1
  • RN8302_FFT_Harmonic
    电力芯片RN8302计算高次谐波时的FFT变换算法,最高可实现51次谐波计算。(FFT transform algorithm for power chip RN8302 to calculate the high harmonics, the highest can achieve the 51 harmonic calculation.)
    2021-01-31 21:50:08下载
    积分:1
  • Explain-of-SAP5
    解释有限元程序SAP5的原理,结构,算例的一本书籍(The finite element program SAP5 explain the principles, structure, examples)
    2017-03-30 19:48:51下载
    积分:1
  • VLE_NRTL
    气液平衡数据进行NRTL参数最小二乘法拟合(VLE NRTL fitting)
    2020-10-12 23:57:32下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载