-
Fractional Fourier Transform
分数傅里叶变换和分数余弦变换,动态展示实部,虚部和模值(Computation of the Fractional Fourier Transform)
- 2019-04-26 17:22:14下载
- 积分:1
-
2011MHD--wangxiaogang.zip
这是2011年中国等离子暑期学校关于磁流体力学(MHD)的讲义,授课的老师是北京大学的王晓刚教授,非常经典!(This is the 2011 China Summer School on magnetic plasma hydrodynamics (MHD) lectures, taught at Peking University Professor Wang Xiaogang teacher, very classic!)
- 2021-05-14 09:30:02下载
- 积分:1
-
4-fft
FFT快速傅里叶变换 采用基4 fft实现的c语言版(FFT Fast Fourier Transform implemented using the base 4 fft c language version)
- 2020-12-16 15:09:13下载
- 积分: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
-
rfft
数字信号处理FFT算法rfft.c,简单易懂。。(Digital signal processing FFT algorithm rfft,Straightforward..)
- 2013-11-22 20:02:24下载
- 积分:1
-
NearToFar
该程序用fortran90编写,时域有限差分(FDTD)中的近远场变换方法。解决了电磁波后向散射中的RCS计算(FORTRAN90 prepared with the program, finite difference time domain (FDTD) in the near field to far field transformation method. Resolved backscattering of electromagnetic waves in the RCS calculation)
- 2008-06-07 19:21:59下载
- 积分:1
-
corr_fast
快速计算相关系数的c代码,比较适用于统计学(Very efficient implementations for calculating correlation efficients )
- 2015-10-23 06:37:24下载
- 积分:1
-
zuijinercheng
基于C环境下的最小二乘法的计算编程算法相当相当实用。(C based on the circumstances of the least squares algorithm for calculating the programming very well.)
- 2009-05-12 23:42:37下载
- 积分:1
-
MATLAB
数学中的通径分析问题,主要用于数学实验方面,计算数学中的数据分析(Path analysis of mathematical problems in)
- 2011-05-28 10:32:01下载
- 积分:1
-
FDTD-
把 Maxwell 方程式在时间和空间领域上进行差分化。利用蛙跳式(Leap frog algorithm)--空间领域内的电场和磁场进行交替计算,通过时间领域上更新来模仿电磁场的变化,达到数值计算的目的。(The Maxwell equations in time and space on the field differencing. Using the leapfrog (Leap frog algorithm)- Space field for alternating electric and magnetic fields calculated by the time domain electromagnetic field is updated to mimic the changes to achieve the purpose of numerical calculation.)
- 2013-11-04 09:40:37下载
- 积分:1