搜索资源列表
Compute
- 可编程计算器-programmable calculator.
compute
- vc++6.0 使用MFC实现的计算器小程序，可以执行
fftw-2.1.5
- FFTW, a collection of fast C routines to compute the Discrete Fourier Transform in one or more dimensions.The fftw/ directory contains the source code for the complex transforms, and the rfftw/ directory contains the source code for the real tran
Strassen矩阵乘法算法 C++程序源码
- Strassen矩阵乘法算法 C++程序源码 V.Strassen在1969年发表了一个算法，将计算两个n阶方阵的乘积的时间复杂性降低到了o（nlog27），被誉为“在代数复杂性理论中最激动人心的结果”。该算法主要适用于方阵的乘法。-Strassen algorithm for matrix multiplication C++ program source V. Strassen published in 1969, an algorithm to compute the product of
kraken_tl
- 利用简正波理论来计算声场，其中用到的思想可以在《计算海洋声学》中找到-using the nomal mode theary to compute the sound field
fft_delphi
- A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse
计算圆周率PI的FORTRAN 的程序
- 这是计算圆周率PI的FORTRAN 的程序，程序简单通过f(x) = 4/(1 + x**2)-This is a good program, compute pi by integrating f(x) = 4/(1+ x**2)
FFT
- 计算快速fouries变换的c++源程序，即可计算正变换，又可计算逆变换！-it can compute the fouries transform of time series,in c++.it can also compute the inverse fouries transform.
bhattacharyya
- compute Bhattacharyya distance between two Gaussian classes
App_Code
- 运用ASP.net C#语言对SQL数据库表格中的数据进行运算处理。-Data compute
compute
- 该程序可以计算任何两个超大整数的四则运算。-The program can calculate any two of the four large integer operations.
target_tracking_using_kalman
- target tracking algorithms using kalmanfilter compute the background image->Kalman filter initialization->loop over all images
fft
- this fft header file for fast fourier transform. with this file, you can compute frequency spectrum zero to tow pi.-this is fft header file for fast fourier transform. with this file, you can compute frequency spectrum zero to tow pi.
radiate_pattern
- 计算边长为2X2的矩形单元的辐射方向图,可定义波长-compute the radiation pattern of the rectangular patches with 2X2.
hartigansSLC_OpenCV
- hartigans Sequential Leader Clustering Algorithm in terms of OpenCV (ver.1.1) Sequential Leader algorithm: Hartigan, J. A. (1975), Clustering Algorithms. John Wiley and Sons, Inc., New York, NY. 1. Select maximum cluster "radius" 2
MatrixInverse
- 矩阵求逆 :一个简单的小例子常用于普通计算。-matrix inverse :a simple instance for common compute
algorithm
- 可以计算两个小于500位整数的乘法，多项式求m次阶的系数和,大数阶乘。-Can compute the two less than 500-bit integer multiplication,M second-order polynomial coefficients of demand and, factorial of large numbers .
smartinv
- 通过求解LU分解解线性方程组 大型稀疏矩阵LU分解有用的是容易计算的。不是最快的方式来计算逆矩阵，但要避免消耗储存的问题-computing selected entries of the inverse, by solving a sequence of linear equations after doing an LU factorization. Useful for large sparse matrix which LU decomposition is easy to c
FOChS
- matlab程序模拟微分方程。各种流行的系统显示混沌运动特征。-This toolbox contains the functions which can be used to simulate some of the well-known fractional order chaotic systems, such as: - Chen s system, - Arneodo s system, - Genesio-Tesi s system, - Lorenz s syste
GetIntersection
- using Gauss methods to compute the interse of space lines