网站首页

登录

demon

于 2021-01-28 发布文件大小:2239KB

 0  216

下载积分: 1 下载次数: 308

我要下载

代码说明：

对实际采集的舰船辐射噪声进行了demo谱分析，分别采用了窄带解调和宽带解调两种方式，得到了较清晰的轴频和叶频信息。(use narrow-band and broad-band methods to demodulate the ship-radiated noise which is actually colleted, there can see clear axle frequency and blade frequency in the demo spectrum.)

文件列表：

bandpass.mat,1500,2012-03-30
bandpass1.mat,1491,2012-03-29
bandpass2.mat,1492,2012-03-29
bandpass3.mat,1495,2012-03-29
bandpass4.mat,1489,2012-03-29
bandpass5.mat,1493,2012-03-29
bandpass6.mat,1492,2012-03-29
bandpass7.mat,1495,2012-03-29
bandpass8.mat,1493,2012-03-29
kuadaijietiao.m,1046,2012-03-30
lowpass.mat,1493,2012-03-29
testch1.bin,3840000,2012-03-15
zhaidaijietiao.m,1323,2012-03-30
简单说明.doc,30208,2012-03-30

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

SQP序列二次规划算法小程序
说明：用于求解数值算法最优化算法中的SQP算法(Solve SQP algorithm Numerical algorithm optimization algorithm)

2020-07-24 21:03:47下载

积分：1
PQ decomposition method
进行PQ分解，计算电力系统潮流的有效方法，应用广泛(PQ decomposition is an effective method for calculating power flow in power system.)

2019-04-23 21:34:16下载

积分：1
NDG
说明：一维波动方程的间断有限元计算，包括网格的划分，数值积分的计算等。(Discontinuous finite element method for one-dimensional wave equation, including mesh division, numerical integration calculation and so on.)

2021-04-21 19:28:49下载

积分：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_2D_TE_Veszt_PML
2维TE波的FDTD的源程序。周期边界条件，有限宽度的吸收边界条件(Two-dimensional TE wave FDTD source. Periodic boundary conditions, the limited width of the absorbing boundary conditions)

2021-04-13 15:58:57下载

积分：1
11087 统计逆序对
说明： Description 设a[0…n-1]是一个包含n个数的数组，若在ia[j]，则称(i, j)为a数组的一个逆序对（inversion）。比如有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, 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
lixiangshiliuyouxianyuanqiujie
理想流体势流的有限元求解程序,简单易懂，适合初学者对该方法编程的一个初步认识,程序内有详细的注释(Potential flow of ideal fluid finite element solver, easy to understand, this method is suitable for beginners programming a preliminary understanding of the program with detailed notes)

2013-11-13 09:47:37下载

积分：1
fahanshu
利用c++编写了一个外点惩罚函数，用于对于对目标值的推算与尝试。(Use c++ to write a point outside the penalty function for the target value for the calculation and try.)

2016-05-15 21:00:54下载

积分：1
LU-SGS
利用时域有限差分求解CFD问题，其中差分格式为LUSGS，是求解流体问题的理论基础(Solved using finite-difference time-domain CFD problems, in which the differential form LUSGS )

2011-12-15 22:43:30下载

积分：1
UDF_03_Files
说明：用C语言编写的Fluent UDF实例，包含Adjust宏，profile宏等八个实例教程，快速上手(The UDF is for computational fluid dynamics software Fluent, it concludes the Profile.c,the Adjust.c)

2019-05-11 00:02:23下载

积分：1

696518资源总数
104269会员总数
31今日下载