推荐系统-电影推荐-SVD方案

采用高斯消元法实现的n阶线性方程组求解程序；-using Gaussian elimination method to achieve the n-solving linear equations;

从头和尾同时进行冒泡排序-Do bubble sort from the head and from the tail at the same time

棋盘覆盖 applet小程序-chessboard coverage applet small program

我们介绍了图形着色和应用程序在以前的帖子。正如在前面的文章中讨论，广泛用于图形着色。不幸的是，有没有高效的算法供图着色与颜色的最小数目，由于问题是一个已知的NP 完全问题。有近似算法虽然解决这个问题。以下是基本的贪婪算法来指定颜色。它并不能保证使用最低的颜色，但它保证颜色的数量上限。更多 d + 1 颜色的基本算法从不使用其中 d 是给定的图形中的一个顶点的最大程度。

基于最小二乘原理的正交多项式拟和输入原始数据及拟和次数即可输出最终拟和表达式系数-based on the principle of least squares orthogonal polynomials and to the importation of the raw data and can be exported and the number of proposed and final expression coefficient

Modified Gram-Schmidt (MGS)正交化法是利用已有正交基计算新的正交基。既能选择相关特征，又能排出已选特征对后续特征选择的影响。

FFT算法的软件实现，有方法讲解，也有部分C++的源码。-FFT algorithm for software implementation, there are ways to explain, as well as some C++ The source.

a算法解决八码难题-a code algorithm to solve eight problems

implementación del filtro de Kalman

Finds the polynomial p10 of degree less than or equal to 10 that interpolates cos x on the interval [0, PI/2] at 11 equally spaced points. Study the error betwee between the function and the polynomial at 41 equally spaced points over the same interval. Repeat the latter but use your 11 points to be Chebyshevs.