fourier_trans

说明：  Optics聚类算法 OPTICS没有显示地产生一个数据集合簇，它为自动和交互地聚类分析计算一个簇次序。这个次序代表了数据基于密度地聚类结构。它包含地信息，等同于从一个宽广地参数设置范围所获得的基于密度的聚类(Optics do not show clustering algorithm OPTICS to produce a collection of data clusters, it is automatically and interactively computing cluster analysis a cluster order. This order represents the data to cluster based on the density structure. It contains in information from a broadly equivalent range of parameters obtained by density-based clustering)

说明：  fortran弹塑性分析程序，很有用的啊！(fortran plastic analysis program, very useful)

开发环境没有可选项，fortran90,Fortran_90_and_Computational_Science-_codes(Computational Science codes by fortran90 )

C + +程序，根据用户的输入可以产生特定的Gauss -1型切比雪夫正交规则，(C++ program which can generate a specific Gauss-Chebyshev type 1 quadrature rule, based on user input)

矩阵转换问题 行与列的个数均为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." )

合肥工业大学数值分析（计算方法A）中高斯—塞德尔算法的实现(Gauss- Seidel Algorithm)

cluster in quest聚类算法是基于密度和网格的聚类算法。对于大型数据库的高维数据聚类集合。(cluster in quest clustering algorithm is based on the density of the grid and clustering algorithm. For large database of high-dimensional data clustering pool.)

计算复序列的分裂基快速傅里叶变换，分裂基快速算法是将基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.)

分数值分析的一些ppt课件，很有用，在学习C的时候，可以用到这些博大精深的思想(Fractional value analysis ppt courseware, useful when learning C, you can use these profound thought)

Fractional knapsack problem, Greedy algorithm