omp算法，应用与压缩感知

应用背景package Kmeans; import java.io.BufferedReader; import java.io.FileReader; import java.util.ArrayList; public class KMeans { private static String fileName = "E:java练习Arithmeticjulei1.txt"; // 文件地址 private static int numTotal; // 聚类总数 private static int K; // 聚类的簇数关键技术典型的聚类算法，应用广发，学习简单，java技术的使用

一种用C语言实现的快速傅立叶变换和傅立叶反变换,经测试十分好用-A C-realize the fast Fourier transform and Fourier inverse transform, have been tested and is very easy to use

This code is used to find shortest path by using dijkstra algorithm

载波生成器+博立业算法分析器。多功能，主要用于演示。-FFT

#包括；

Learnin Mathematics with the ABACUS Activity-book part 6

cinematic model of a robot with five degree

数据挖掘中，判别树算法的应用例子。属于分类中的算法 很好。-data mining, discriminant Tree Algorithm application examples. The classification is a good algorithm.

复式河道水面线推求程序,开发平台Fortran。-penthouse river water line calculation procedures, Fortran development platform.

逐次超松驰迭代法(Successive Over Relaxation Me thod,简称SOR方法)是高斯―塞德尔方法的一种加速方法，是解大型稀疏矩阵方程组的有效方法之一，它具有计算公式简单，程序设计容易,占用计算机内存较少等优点,但需要较好的加速因子(即最佳松驰因子).下面我们首先说说松驰一词的含意,再利用它来解释雅可比迭代法与高斯―塞德尔迭代法,最后给出逐次超松驰迭代法的推算公式和收敛性条件.-Successive over relaxation iteration method (Successive Over Relaxation Me thod, called SOR method) is the Gauss- Seidel method for an accelerated method is solution of large sparse matrix equations, one effective method, it has a simple formula, programming easy, take up less computer memory, etc., but the need for better acceleration factor (that is, the best relaxation factor). Let us first talk about the meaning of the term relaxation, and then use it to explain the Jacobi s iterative method and the Gauss- Seidel iterative method, and finally gives successive over relaxation iterative method of projection formula and the convergence condition.