高性能计算高斯消去解方程组c++程序（复杂度 n^3

Goertzel基本算法在每次采样后立即进行处理，在每个第N次采样进行一次音调检测。在采用FFT算法时，我们要对成块的采样进行处理，但这并不意味着必须按块来处理数据。数字处理的时间很短，因此如果每次采样都存在一次中断，那么这些数字处理完全可以在中断服务程序(ISR)内完成。或者，如果系统中存在采样缓存，那么可以持续采样，然后进行批处理。-Goertzel basic algorithms in each sample immediately after processing, in each of the first N sub-samples to conduct a tone detection. In the use of FFT algorithms, we would like to be processed into a block of samples, but this does not mean that must block processing the data. Digital processing time is very short, so if an interrupt for each sample are present, then the digital processing is fully able to interrupt service routine (ISR) to complete. Or, if the system exists in sample buffer, you can continue to sample, and then batch.

一个MFC实现的俄罗斯方块程序，操作简单，界面友好，可用作课程设计，实训等，简单易懂

该代码实现了A率和mu率PCM算法，有详细的注释说明，-the code achieved A rate and the rate of PCM mu algorithm, a detailed explanatory notes

该程序用来处理微分方程系统的,用来化简一个微分系统的-The procedures used to deal with differential equations system to simplify a system of differential

巨指针类型数据的快速排序法-Quick sort for the large pointer type data

kruscal求最小生成树-kruscal for minimum spanning tree

BM快速搜索算法的实现。可以实现诸如edit等软件的搜索功能，作者已经做过对比测试。-BM quick search algorithm. Can be achieved, such as edit software such as search capabilities, the author has done comparison testing.

用遗传算法求y=x*sin(10*pi*x)+2的最大值  -1=

资源描述图像去噪图像处理中的非局部均值算法。不同于“局部均值”的过滤器，它采取的平均值的一组像素周围的目标像素的平滑图像，非局部均值滤波，以平均的所有像素的图像，加权类似这些像素的目标像素。这导致了更大的后过滤的清晰度，减少损失图像中的细节与局部均值算法比较。