-
Program
矩阵转换问题
行与列的个数均为n 的矩阵称为n 阶方阵。假定矩阵中的每个元素的值在0到9之间，则可以将矩阵中的所有元素按行依次排列得到一个“单行矩阵字符串”。(Matrix conversion, the number of rows and columns of the matrix n are called n-order square. Assume that each element of matrix value in the 0 to 9, you can press all the elements of the matrix rows in order of priority for a " single matrix string." )
- 2010-12-28 11:42:08下载
- 积分：1
-
project
多项式的加减法运算，输入的多项式带有未知数x和数字(Polynomial addition and subtraction calculations)
- 2021-04-28 10:28:44下载
- 积分：1
-
boykov_kolmogorov_max_flow.cpp
Maximum Flow Graph (Boykov Kolmogorov Algorithm)
- 2013-10-09 03:12:32下载
- 积分：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
-
dit_fft
本程序包括：DFT（离散傅里叶变换），FFT（快速傅里叶变换），IFFT（快速傅里叶逆变换），conv（卷积：圆周卷积、线性卷积），主要应用于信号处理，既可以对实序列做上述操作，也可以对复序列。(This process includes: DFT (Discrete Fourier Transform), FFT (fast Fourier transform), IFFT (inverse fast Fourier transform), conv (convolution: circular convolution, linear convolution), mainly used signal processing, either on the actual sequence to do the operation, can also be complex sequence.)
- 2010-09-22 21:30:23下载
- 积分：1
-
EMD
利用emd算法解决经验模式分解的一些存在的端点效应问题。 有效的解决了问题。(Using emd algorithm to solve some of the empirical mode decomposition end effects exist. Effective solution to the problem.)
- 2020-10-19 16:27:25下载
- 积分：1
-
srfft
计算复序列的分裂基快速傅里叶变换，分裂基快速算法是将基2和基4分解组合而成。在基2M类快速算法中，分裂基算法具有最少的运算量，且仍保留结构规则、原位计算等优点。(Calculate complex sequence of split radix fast Fourier transform, fast algorithm is to split the base base 2 and base 4 decomposition combination. 2M fast algorithm in the base class, the split-based algorithm has the least amount of computation and structural rules remain in situ calculation and so on.)
- 2013-05-23 19:56:04下载
- 积分：1
-
matrixmulti
在visual studio的平台上开发CUDA程序实现并行加速计算矩阵的乘积，同时比较与串行计算的差异(Differences in the development of procedures to achieve parallel CUDA accelerated computing matrices in visual studio platform, but compared with the serial computing)
- 2020-12-11 21:49:17下载
- 积分：1
-
24
说明： 给定四个数（1--13），判经过四则运算后能否得到结果24，若能，输出表达式。 (Given the number four (1- 13), after sub after four computing results can be 24, if the output expression.)
- 2008-01-03 22:19:45下载
- 积分：1
-
fft
说明： 实现快速离散傅里叶变换，即FFT,很有用的程序(Fast discrete Fourier transform, namely, FFT, very useful program)
- 2008-10-31 13:46:14下载
- 积分：1
