资源列表
SOR
- 逐次超松驰迭代法(Successive Over Relaxation Me thod,简称SOR方法)是高斯—塞德尔方法的一种加速方法，是解大型稀疏矩阵方程组的有效方法之一，它具有计算公式简单，程序设计容易,占用计算机内存较少等优点,但需要较好的加速因子(即最佳松驰因子).下面我们首先说说松驰一词的含意,再利用它来解释雅可比迭代法与高斯—塞德尔迭代法,最后给出逐次超松驰迭代法的推算公式和收敛性条件.-Successive over relaxation iteration method (Su
GaussianElimination
- Gaussian Elimination algorithm for inverting matrix
change
- 数值，a,b数字转换，附带提示框上的数值转换-Value, a, b-digital converter, with boxes on the value of conversion
n_Queen
- 该算法为回溯法的经典问题之一，在n*n的棋盘上放置n个皇后。运行后会给出皇后的位置和解的个数-The backtracking algorithm is one of the classic problems in the n* n place n queens on the chessboard. After running the settlement will give the location of the number of Queen s
shuzu
- 数组里面有100个数 实现查找删除 以及按大小排序-There are 100 number array size, and delete and realize the search order
Screening-method
- 选择排序 排序问题中的蛮力法 算法设计与分析-Selection sortThe scheduling problem with the brute force methodDesign and analysis of algorithms
bintoint
- Oberon 2 Genetic operator (binary to integer)
10-2
- 十进制转换为二进制数据，可以将浮点型数据进行转换，精度可以自行修改。-Convert from decimal to binary data, you can float data conversion accuracy can modify.
Leaveoneout
- Método leave-one-out
linear-problem-programming
- this is a c++ program to implement linear programming language in operating research.
138
- UVA #138 problem implemented in visual c-UVA #138 problem implemented in visual c++
divide
- 采用正向最大匹配算法实现中文分词，基于matlab2013编程-MATLAB code