shuzhifenxi

说明：  c++语言求解稀疏矩阵方程组的ICCG法源程序。参考：《工程电磁场数值计算分析与综合》 附录（Fortran90）.(c++ solves sparse matrix equations with the ICCG method.Reference: &quot Analysis and Synthesis of Numerical Electromagnetic Field ,&quot Appendix (Fortran90).)

fft code in visual c++

一个短时傅里叶变换的C语言实现，对3万个数据进行加窗、FFT处理(A short time Fourier transform of C language, for 30,000 data windowing, FFT processing)

说明：  Optics聚类算法 OPTICS没有显示地产生一个数据集合簇，它为自动和交互地聚类分析计算一个簇次序。这个次序代表了数据基于密度地聚类结构。它包含地信息，等同于从一个宽广地参数设置范围所获得的基于密度的聚类(Optics do not show clustering algorithm OPTICS to produce a collection of data clusters, it is automatically and interactively computing cluster analysis a cluster order. This order represents the data to cluster based on the density structure. It contains in information from a broadly equivalent range of parameters obtained by density-based clustering)

用c++实现m次多项式的曲线拟合，改程序简单易懂，可读性强(it s easy)

第一个把专家青睐的数学模型技术（NNM 算法模型）引入词汇记忆软件中，并取得了巨大的成功。NNM 算法模型与经典的“艾滨豪斯遗忘曲线”真正的融合于一体，使得该著名的理论在计算机与数学模型下第一次得到了淋漓尽致的发挥。(First a mathematical model of the popular technology expert (NNM algorithm model) the introduction of vocabulary learning software, and has achieved great success. NNM algorithm model and the classic " Ai Bin House forgetting curve" true integration in one, making the well-known theory in computer and mathematical models has been most vividly the first time under play.)

this is fft header file for fast fourier transform. with this file, you can compute frequency spectrum zero to tow pi.

打靶法求解两点边值问题 实例测试通过，可直接运行，并带有详细代码注释 采用全局收敛的牛顿-拉普森迭代算法求解编制问题 绝对物超所值！(Two-point boundary value problem shooting method)

解线性方程组的迭代法 雅可比迭代、高斯—赛德尔迭代、超松弛迭代法 (Solving linear equations iterative method Jacobi iteration, Gauss- Seidel iteration SOR method)

极小 算法（Min-Min）、极大极小算法(Max-Min)、最大时间跨度算法（Max-Int）三种典型的映射算法的算法原理以及计算程序(Minimal algorithm (Min-Min), max-min algorithm (Max-Min), maximum time-span algorithm (Max-Int) three typical mapping algorithm and the algorithm of the calculation program)