arrow3.m.tar

有限差分法求解欧拉方程，weno有限差分法求解欧拉方程。(Euler solved with weno)

K均值算法实现二维点的聚类，可以手动选择分的类别数(K mean algorithm for clustering two dimensional points)

说明：  实现基2时域频域抽取fft算法，可输出运算后所得复序列的模值序列，并可记录显示计算所用时间(Achieve base 2 fft algorithm frequency domain extraction can be obtained after computing the output sequence of modulus of complex sequences can be used in the calculation time, records show)

分别对beta估计值模拟分析、非中心对称分布、卡方拟合优度检验、筛选抽样随机数抽取、有限样本性质模拟这5个内容进行了编程说明(The five contents of beta estimation simulation analysis, non-centrosymmetric distribution, chi-square goodness-of-fit test, random number extraction of screening sampling and Simulation of finite sample properties are explained by programming.)

三相潮流计算，使用的是牛顿拉弗逊方法。迭代较快。是解决潮流的较有效的方法。(Three-phase power flow calculation, using Newton' s method Laffer Johnson. Iterate rapidly. The trend is to solve the more effective method.)

说明：  经典99行拓扑优化程序，采用Heaviside方程获得接近0-1离散解(The classical 99-line topology optimization program uses Heaviside equation to obtain nearly 0-1 discrete solution)

此为基于图像配准的傅立叶变换源代码，已精心调试过，请放心使用.(This is the image registration based on the Fourier Transform source code, has been painstakingly debugging, please rest assured that use.)

单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解,再鉴别；若仍不是，则再转换,按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method for the minimum)

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

说明：  VC实现，天文导航算法及实现 包括数据的获取、加工、处理、保存为文件(VC, astronomy, navigation algorithm and implementation including data acquisition, processing, handling, preservation of documents)