FFT algorithm for power system improvements, there is a need to look at the Frie...

FFT和FIR 快速傅里叶变换和FIR滤波器实验程序-Fast Fourier Transform FFT and FIR and FIR filter experimental procedure

计算矩阵行列式值的源程序-calculating the determinant of the matrix source

这个方案的目标是获得 Qx、 Qy、 Qz 分别在 X、 Y 和 Z 不得不离开初始电量"L"的 X 容器里的液体的容器的数量，而无需使用任何测量仪是不得不使用容器给那能力时说。此程序输入以下信息： 该三个货柜、 数量的液体初始和最终的状态想要 résultat，以及它的能力职位朝它更短的路径最后如果井存在如果不它会发布一条消息，说"而不是路径"，因为他的职位也它造成图。

应用背景泊肃叶动流是计算流体与计算传热学一个经典问题，其理论解已经被人们计算出，常用作不可压缩流动的校核算例，同时也是很好的lbm模拟学习的入门算例。对于刚开始接触的入门者有很大帮助。关键技术相比之前的不可压缩模型，该程序采用了可压缩的D2G9模型以及标准的碰撞迁移规则，边界处理则采用了非平衡外推格式与周期边界条件。但读者可以通过改变初始条件边界条件来计算其他的物理量。

巴特沃斯、切比雪夫I和椭圆滤波器设计的源程序！非常难得！ 简洁的C语言编写-Butterworth, Chebyshev I and elliptic filter design of the source! Very rare! Concise C language

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

prime 判断-prime judgment

实现JACOBBI、gs迭代和超松弛法解线性方程组的过程。-Realize JACOBBI, gs iterative relaxation method and ultra-linear equations solution process.

离散相关和自相关的快速算法-separated from the relevant and related to the fast algorithm

hmm model, training phase data has to be given to the model .-hmm model, training phase data has to be given to the model .