LU分解，QR分解等矩阵分解

用C++编写的双三次样条插值算法-prepared by the C-cubic spline interpolation algorithm

程序只产生均值为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.

C++动态规划的算法例子，找零钱的经典问题编程-C++ Dynamic programming algorithm for example, to find the classic problem of small change programming

两个多项式加减乘运算-two polynomial multiplication

你好朋友，在这里我给 awk 语言用来找出包丢失，追溯 ns2 仿真中的详细信息代码

for fft fast four trasform for transform real function to forur

This OpenNL, a library to easily construct and solve sparse linear systems. * OpenNL is supplied with a set of built-in iterative solvers (Conjugate gradient,BICGSTAB, GMRes) and preconditioners (Jacobi, SSOR). * OpenNL can also use other solvers (SuperLU 3.0 is supported as an OpenNL extension,MUMPS will be supported in a future version)-This is OpenNL. a library to easily construct and solve sparse l inear systems.* OpenNL is supplied with a set of built-in iterative solvers (Conjugate gradie nt, Application of BICGSTAB. GMRes) and preconditioners (Jacobi, SSOR).* OpenNL can also use other solvers (Super rLU 3.0 is supported as an OpenNL extension, MUMPS will be supported in a future version)

旅行商问题的模拟退火matlab源码程序-Traveling salesman problem matlab source of the simulated annealing procedure

这是为解决 m-着色问题编写的算法。它基于回溯。对于等级是相对较低。但保证的正确性。M-着色问题是其 NP 完备而闻名，没有多项式时间算法都没有被发现。这个问题可以应用于许多实际问题，例如调度。

分形云（或灰尘）开始形成从一个用户定义的点P（A，B，X，Y），并通过大量的重复一些变换得到一些很酷的照片。因为事实上，我们可以顺着小径起点是离开（P0开始吧，p1-1st迭代，P2第二，的…PX即点图）图也被称为轨道（轨迹）的动态系统。得到一个粗鲁的估计是，B，X和Y是很好用的我你准备好clouds.xls。1 6张显示计算的序列这里给出的模式实例1 6。x()表显示图形的样子计算序列低接参数（有一些评论为什么）。提交575 K因为xls文件。