Numerical method of procedure: to accelerate the iterative Gauss

7zip的源码，VC++平台开发，c的是解压算法，c++压缩解压算法都有，给适合的朋友们，本人正在寻找zip压缩算法，纯C语言，希望得到大家的帮忙，谢谢！

本文是关于语音编码算法综合性能比较 的一篇文章，对各种编码算法的性能进行综合 比较和评价的方法 。本文试图利用层次分析法来对编码算法进行性能评估。-This article is a speech coding algorithm on a comprehensive performance comparison of an article on the performance of various coding algorithm comparison and evaluation of a comprehensive approach. This paper attempts to make use of analytic hierarchy process to assess the performance of coding algorithm.

svm（支持向量机）的演示程序，是可执行程序，非控制台程序，可实现分类并图形化显示。-svm (support vector machine) demonstration program, an executable program, non-console programs for classification and graphical display.

线性方程组求解器，用此程序包可以求解大型稀疏矩阵方程组，还可以 并行，优化提高效率，此库包含大部分线性方程组的求解方法，包括直接法、迭代法等以及一些特殊系数矩阵的求解方法。

整理分享：常用的数学运算程序源代码 包括常用的几种数学运算程序的C++代码，例如矩阵运算-collate share : common mathematical procedures used in the source code of several mathematical programs in C code, for example, matrix operations, etc.

附有论文《D_S证据理论在火灾探测中的应用》，及MATLAB程序

一个费诺编码器,输入N个总和为1的小数,就可以得到N个费诺码-a fee Connaught encoder input N sum of a minority, it can be N Connaught yards charges

本算法  从最简单的程序，渐渐深入，能够让读者以最快的速度，学会D-S算法在matlab中的实现过程。算法中标有详细的注释，最大程度上帮助读者完全掌握。

he 8-puzzle will be represented by a 3x3 list of lists positions where the empty box will be represented by the value 9, as shown below: [[9,1,3],[5,2,6],[4,7,8]] Possibility Solution: Only half of the initial positions of the 8-puzzle are solvable. There is a formula that allows to know from the beginning if you can solve the puzzle.To determine whether an 8-puzzle is solvable, for each square containing a value N is calculated how many numbers less than N there after the current cell. For example, to the initial status

用对分法求非线性方程f(x)=0的实根.基本思想：逐步缩小这个有根的区间，当这个区间长度减小到一定程度是，就取这个区间的中点作为根的近似值-Use of sub-method of nonlinear equation f (x) = 0 the real roots. The basic idea: to gradually narrow the range of this well-established, when the interval length decreases to a certain extent, we take the midpoint of this range as the root approximation