搜索资源列表
FFTModify
- 用能量重心法，对基2分裂的FFT算法进行校正，在整周期采样的条件下，幅值，相位，频率等可以达到很高的精度 -energy center, two pairs of split-the FFT algorithm for correction, in the whole cycle of sampling conditions, the amplitude, phase, frequency, etc., may achieve high accuracy
Matching-1
- 给定整数n，产生所有[2n]上的匹配（matching） //将其视为一个所有块大小均为2的集合分拆 //输出格式为 a1 a2 - b1 b2 - c1 c2 - ... //满足a1<a2, b1<b2, ... //且 a1 < b1 < c1 <-given integer n, have all [2n] on the matching (matching) / / will be considered as an all pieces a
Matching-2
- //给定整数n，产生所有[2n]上的匹配（matching） //将其视为一个所有块大小均为2的集合分拆 //以a_i表示其第i个元素所在的集合号 //输出格式为 a1 a2 a3 ... //满足 //a_{i+1} <= max { a1,a2,...a_i } + 1 -/ / a given integer n, have all [2n] on the matching (matching) / / will be considered as an all
c_inference_ver2.2
- The package includes 3 Matlab-interfaces to the c-code: 1. inference.m An interface to the full inference package, includes several methods for approximate inference: Loopy Belief Propagation, Generalized Belief Propagation, Mean-Field
Split-Step-Fourier
- 这个Matlab的m代码解决了薛定谔方程，沿着带宽频率和相位偏移，显示三维图像。
liftingscheme
- 小波提升格式的源代码，采用了标准的分裂、预测和更新三步，比经典小波算法速度提高一倍！-Lifting format of the source code, adoption of the standard split, forecasts and updates of steps, the classic wavelet algorithm than double the speed!
liftingscheme_java
- 小波提升格式的java源代码，包括标准的分裂、预测和更新三步，以及一个实例-Lifting format java source code, including the standard split, forecasts and updates of steps, and an example
sspropcm
- 利用分步傅立叶积分法，求解薛定谔方程，可以计算光纤中色散与SPM-This file solves the nonlinear Schrodinger equation for propagation in an optical fiber using the split-step Fourier method described
soliton
- 本程序是利用分步傅里叶算法解非线性薛定谔方程-this program is used for NLS by the split step Fourier method
Split_radix
- FFT的分裂基算法，很详细的注释，花了两天的时间。希望对大家有帮助-The Split-radix FFT algorithm, a very detailed notes, spent a couple of days. We want to help
split_step_fourier_method
- 使用分布傅立叶法计算非线性薛定谔方程。可以得到光纤非线性传输特性。-Fourier method using the distribution of nonlinear Schr枚dinger equation. Can be non-linear optical transmission characteristics.
Cell
- 细胞分裂问题 某种生命周期为5小时的水藻细胞繁殖能力很强。新细胞经过两小时变成成熟细胞，并分裂出一个新细胞。第三小时分裂能力最强，可以又分裂出两个新细胞，第四小时又分裂出一个新细胞。五小时后死亡。 （1）假定开始只有一个新水藻细胞，分别输出从1至30小时后的细胞总数。（屏幕输出结果即可） （2）一个新水藻细胞100小时后变成多少个细胞？（屏幕输出结果即可） （提示：1至6小时后的细胞总数分别为：1，2，4，6，9，16）-The issue of cell division of
cordic
- cordic methods describe essentially the same algorithm that with suitably chosen inputs can be used to calculate a whole range of scientific functions including sin, cos, tan, arctan, arcsin, arccos, sinh, cosh, tanh, arctanh, log, exp, square root a
splfft
- 分裂基算法，已调试，用C语言实现-Split-radix algorithm, have been debug using C language. . . . . . . . . . . . .
sspropc
- 利用分步傅立叶积分法，求解薛定谔方程，可以用于计算光纤中色散与SPM-This file solves the nonlinear Schrodinger equation for propagation in an optical fiberusing the split-step Fourier method described
FFT
- 利用分裂基方法实现快速傅里叶变换的CPP文件-The use of split-based methods for fast Fourier transform CPP file
meshgeneration
- 计算用网格剖分程序，利用Bowyer-Watson method 法剖分，生成Delaunay网格-Calculation mesh generation procedure, and use law split Bowyer-Watson method to generate Delaunay meshes
[1]-Split-radix-algorithm-for-2-D-discrete-Hartle
- Split-radix algorithm for 2-D discrete Hartley transform
split
- 分离VASP计算得到的DOSCAR文件，将每个原子的计算结果分开输出-split the DOSCAR from the result of VASP
The-split-bregman-method
- 图像处理、Bregman迭代算法，分裂Bregman迭代算法，l1正则化问题-image processing,Bregman iteration,split Bregman iteration,l1-regularized problems