test1_1

This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen. Usage for KMEANS is: KMEANS SOURCEFILE <enter> The format of the source file is: NPat - Number of patterns (int) SizeVect - Size of vector (int) NClust - Number of cluster centers(int) vect[1,1] ... vect[1,SizeVect] - vector 1 (real) vect[2,1] ... vect[2,SizeVect] - vector 2 (real) . . . . . . vect[NPat,1] ... vect[NClust,SizeVector] - vector N (real) To compile: ICC KMEANS.CPP <enter> (This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen. Usage for KMEANS is: KMEANS SOURCEFILE <enter> The format of the source file is: NPat - Number of patterns (int) SizeVect - Size of vector (int) NClust - Number of cluster centers(int) vect[1,1] ... vect[1,SizeVect] - vector 1 (real) vect[2,1] ... vect[2,SizeVect] - vector 2 (real) . . . . . . vect[NPat,1] ... vect[NClust,SizeVector]- vector N (real) To compile: ICC KMEANS.CPP <enter> )

《计算理论导引》(作者)[美] Michael Sipser(译者)张立昂 王捍贫 黄雄 机械工业2000年2月第1版.pdf(Computational Theory，(Author) [America] Michael Sipser (translator) Zhang Li Ang Wang Hanpin Wong Hung Machinery Industry in February 2000 1st edition. Pdf)

常用的算法设计策略(包括分治策略、动态规划、贪心策略、回溯法、随机算法等) 算法复杂度分析方法(计算迭代次数、使用递归方程、频度分析等) (Commonly used algorithm design strategies (including the strategy of divide and conquer, dynamic programming, greedy strategy, backtracking method, random algorithm) algorithm complexity analysis (number of iterations, using a recursive equation, frequency analysis, etc.))

实对称矩阵特征值与特征向量的雅克比法，ap为是对称矩阵，vp返回特征向量(Real Symmetric Matrix Eigenvalues and Eigenvectors of the Jacobian method, ap is a symmetric matrix, vp return eigenvector)

说明：  VC实现，天文导航算法及实现 包括数据的获取、加工、处理、保存为文件(VC, astronomy, navigation algorithm and implementation including data acquisition, processing, handling, preservation of documents)

涡格法进行无人机的设计，升力系数，阻力系数，力矩系数等等，美过圣母大学的设计辅助软件(VLM)

计算按频率抽取的基4快速傅里叶变换算法，与基2FFT相比，基4FFT的乘法量约减少25 。(Calculating frequency taken by fast Fourier transform algorithm base 4, compared with the base 2FFT the base 4FFT multiplication about 25 less.)

单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解,再鉴别；若仍不是，则再转换,按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method for the minimum)

牛顿插值算法，利用数组存储均差表，一步步迭代求得插值(Newton interpolation algorithm, the use of array stores are differential gauge, step by step, iterative get interpolation )

用于处理电力系统中含有4个节点的随机潮流计算(Four nodes to deal with the random flow calculation)