simp4辛普生积分法

题目：n阶方阵求逆的实现总体需求：编写一个实现求矩阵逆矩阵的程序。功能需求：1) 输入一个n（n

德国纳粹二战时发明的密码机engma“迷”的复原模拟程序的源码-Nazi Germany during World War II invention of the cipher machines engma "fans" of the recovery process simulation FOSS

程序只产生均值为0，方差为1的随机数，要产生均值为E,方差为D的随机数，只要随机数*D+E就可以了。高斯随机数程序还是带参数的，参数是用来描述正态分布的一个浮点数表。在执行程序时，先生成这个表（只做一次），而后就可以任意多次地执行高斯随机数产生程序了。使用C是为了保证通用性，如果有人觉得麻烦，可以用C++做个类，把这些东西都封装进去。另外，如果有人有兴趣，也可以把它修改成任意形式分布的连续随机数产生程序，修改非常简单，这里就不提示了。-procedures have only mean of 0 and variance for a random number to produce the mean E, D variance for the random number, as long as a few random E* D on it. Gaussian random process parameters or with the parameter is used to describe a normal distribution of the float table. In the implementation process, Mr. into the table (one-off), and you can repeatedly arbitrary implementation Gaussian random number generator proceedings. The use of C is to ensure commonality, if someone finds trouble, can be used to be a Class C, all these things into account Packaging. Also, if someone is interested, can you change the form of arbitrary distribution of continuous random number generator procedure is very simple changes, I will not be sacrificed as a result.

资源描述OCR字符识别OCR字符识别OCR字符识别OCR字符识别OCR字符识别OCR字符识别OCR字符识别OCR字符识别OCR字符识别

Fast Algorithms for Projected Clustering - PROCLUS - a traditional subspace clustering algorithm for high dimensional data-Fast Algorithms for Projected Clustering- PROCLUS- a traditional subspace clustering algorithm for high dimensional data

算法的思路：首先对矩阵QR分解，然后矩阵转置，接着矩阵乘机，通过不断的迭代是的举着下三角元素小于设定的阈值，这样得到的矩阵主对角元素上 元素就是所求的矩阵特征值

逐次超松驰迭代法(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.

使用Las Vegas方法与回溯方法结合，改进8后问题算法

蚁群算法的c++实现方法，通过c++实现蚁群算法的基本功能，提供了详细的注释和编码。

非线性方程类，封装了有关解非线性方程的算法-nonlinear equations, the solution package, the algorithm of nonlinear equations