搜索资源列表
compact3
- 自己写的高精度紧致差分格式，包括 Pade格式(FST) 二阶精度中心格式(SLW) 二阶精度迎风格式(MXD) 宽网格基二阶精度中心格式(SLW) 五阶精度迎风紧致格式(MXD) 写成C＋＋类，使用VC6.0环境，计算数据文件可用tecplot画图。 -himself wrote the compact high-precision differential format including Pade format (FST) second order accurac
dec-bin-hex
- 用visual basic写的进制转换代码-used to write visual basic code base for the conversion
time_wn
- 用C语言实现的对基—2FFT算法的改进，提高了算法的运算速度-using the C language to the base-FFT algorithm, the algorithm improves the speed of operation
dit-dif-fft
- 快速傅立叶算法，按时间和按频率抽取的基2算法-Fast Fourier algorithm, time and frequency taken by the base 2 Algorithm
ConvertNum
- 这个程序有别于已经做好exe文件的2-8-10-16进制转换程序而是可以被其他程序调用，或简单地用ctrl c，来复制其中一段至目标程序的源代码-have made exe files 2-8-10-16 base for the conversion process, but the other procedures can be called, or simply use the ctrl c, to replicate some of which target program's
进制转换(M)
- 一个简单实用的进制转换算法，该算法能实现二、八、十、十六进制的相互转化。-a simple and practical base for the conversion algorithm, the algorithm can achieve 2, 8, 10, hexadecimal the mutual conversion.
32to10
- 此為簡單的32進制轉換技巧,善加瞭解後知道要點後,即可製做出不同的進制計算需求.-this as a simple base for the conversion of 32 skills, properly understood know points, the system can make a different band computing needs.
e1
- 16点基4—FFT算法编程。输入16点的序列，采用基4-fft方法计算其快速傅里叶变换。-16 points-based 4-FFT algorithm for programming. Enter the 16-point sequence, with the base 4-fft method for calculating the fast Fourier transform.
FFT
- FFT算法的基本原理是把长序列的DFT逐次分解为较短序列的DFT.按照抽取方式的不同可分为DIT-FFT(按时间抽取)和DIF-FFT(按频率抽取)算法.按照蝶形运算的构成不同可分为基2、基4、基8以及任意因子(2n,n为大于1的整数),基2、基4算法较为常-The FFT algorithm s basic principle is decomposes gradually long sequence DFT into short sequence DFT. different may div
sdl_astar_pathfind
- A*寻路算法, 源代码中使用的SDL库，可以到http://www.libsdl.org/或者VC知识库网站工具栏目www.vckbase.com/tools下载。-A* Routing algorithms, source code used in the SDL libraries, or can http://www.libsdl.org/ VC Knowledge Base site columns www.vckbase.com tools/tools download.
mixfft05
- 任意混合基的FFT，我用过了，很好用，大家可以试试！-Arbitrary mixed-base FFT, I spent a good use, we can try!
fft
- 基为2的快速傅立叶变换的核心代码，蝶形计算-Base for the 2 fast Fourier transform core code, butterfly calculation
fft
- 基2分频与基于分裂基的fft的实现，特别是新型的倒序算法提高了程序的质量-Base 2-splitting based on the realization of fft-based, especially the new type of reverse algorithm to improve the quality of the procedures
LLVFourierTransforms
- fft变换代码,采用基2的频率域变换代码.-fft transform code, the use of the base 2 of the frequency domain transform code.
Source
- C#的数值计算的几乎所有算法，拿来就可以使用，是大家数值计算的必备代码库-C# The numerical calculation of almost all the algorithms, used to be able to use, is an essential numerical code base
FFT
- 快速傅里叶分析的C算法程序，是基二FFT算法，内付简单使用说明。-Fast Fourier analysis of the C algorithm procedure is the base two FFT algorithm, with simple instructions to pay.
lmt
- this is code of data mining exatracted from weka tool which is java base
part
- THis part algorithm which is data base classification algorithm implemented in java-THis is part algorithm which is data base classification algorithm implemented in java
bft-base-src-rh72.tar
- BFT/BASE库,由mit开发的PBFT实用程序-The BFT/BASE database, developed by mit PBFT utility
Conversion-any-base-to-each-other
- This program convert any base to any base eachother . very necessary and very helpful .