OptiY 软件

天然气管道连接问题原程序，一百个用户，其中有四个无效用户，将其它96个有效用户连接成一个树形网络，用kruskal算法实现-Natural gas pipeline to connect the issue of the original procedure, 100 users, which has four invalid users, will the other 96 valid user to connect into a tree network, using Kruskal Algorithm

卡拉曼最优估计器算法吗，标量kalman最优估计器MATLAB实例参考《数字滤波与卡尔曼滤波》S.M.Bozic 1979实例编写，程序思路比较清晰，便于初学者理解kalman滤波的原理

多元数组得各类运算-multiple arrays in various operations

《科学工程计算C语言算法》一书代码。C语言编写。均写成函数形式，可以直接调用。包括数值微分、数值积分、插值、方程求解等数值算法。-"scientific engineering calculation algorithm C language," a code book. C language. Functions were written form can be called directly. Including numerical differentiation, numerical integration, interpolation, equation solving numerical algorithms.

最短小的dvd解码程序-shortest small DVD decoding procedures

非线性回归问题SQP解法-nonlinear regression problems SQP Solution

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

这是代码来实现多径 dsr.this 使用 DSR protocol.there 是使用 multipath.we 使用 3 多径基于的纸张的路由协议实现的方法。

模拟了衍射光栅的光学行为，运用matlab语言编写的程序，对科技工作者有很搭帮住-simulation of the optical diffraction grating, using the Matlab language procedures, IT workers have to take very live help