0123

用C语言程序通过先随机选取K个对象作为初始的聚类中心。然后计算每个对象与各个种子聚类中心之间的距离，把每个对象分配给距离它最近的聚类中心。聚类中心以及分配给它们的对象就代表一个聚类。一旦全部对象都被分配了，每个聚类的聚类中心会根据聚类中现有的对象被重新计算。(C Programming Language by first randomly selected the K object as initial cluster centers. And then calculate the distance between each object and each seed cluster center, and assign each object to its nearest cluster center. Cluster centers, and the object assigned to them on behalf of a clustering. Once all the objects are assigned to each cluster cluster centers will be based on the existing object clustering is recalculated.)

数学最优问题中，拉格朗日乘数法（以数学家约瑟夫·路易斯·拉格朗日命名）是一种寻找变量受一个或多个条件所限制的多元函数的极值的方法。(In the mathematical optimization problem, the Lagrange multiplier method (named by the mathematician Joseph Luis Lagrange) is a method of finding the extremum of a multivariate function which is restricted by one or more conditions.)

实现互相关运算 C实现，实现互相关运算 C实现(cross correlation C code implementation)

说明：  用matlab实现的有限元工具箱，有平面空间梁单元，杆单元，实体单元等。(achieved using Matlab Toolbox FEM, graphic space beam elements, rod elements, entities modules.)

偏最小二乘法中的交叉有效性计算,看看，可能有用(PLS cross-validity of the calculation, see, may be useful)

计算方法：主要是高斯消去法的C语言算法实现(Calculation method: Gaussian elimination)

两种涡旋光束的线性强度、强度密度和三维立体图，改变拓扑荷可以改变强度分布。(two kinds of vortex beam)

椭圆偏微分方程求解函数，调用该函数可以解任意椭圆偏微分方程(Elliptic partial differential equations to solve the function, call this function can solve any elliptic partial differential equations)

铁木辛柯梁梁单元有限元程序，可以自动形成刚度阵，质量矩阵(Ironwood oct Ke Liangliang unit finite element program can automatically form stiffness matrix, mass matrix)

解线性代数方程组的顺序高斯消去法。使用c++标准库的vector实现。(Solution of linear algebraic equations order Gaussian elimination. Use c++ standard library vector implementation.)