03CH4_red19

功能是将邻接矩阵或关联矩阵变为有向或者无向网络图，有结果显示。(Function is to convert the adjacency matrix or the correlation matrix becomes directed or undirected network diagram, results show.)

实对称矩阵特征值与特征向量的雅克比法，ap为是对称矩阵，vp返回特征向量(Real Symmetric Matrix Eigenvalues and Eigenvectors of the Jacobian method, ap is a symmetric matrix, vp return eigenvector)

说明：  《遗传算法及其在电力系统中的应用》华中科技大学版("Genetic Algorithms and Their Applications in Power Systems" 2002)

用Lanczos方法求解矩阵的最大几个奇异值的Matlab程序。(Matlab codes for large singular value with Lanczos Methods)

说明：  FFT正变换和逆变换，了解FFT变换的实质(FFT transform and inverse transform is to understand the substance of FFT transform)

概念格的构造问题是形式概念分析应用的前提。由于概念格的时空复杂度随着形式背景的增大而可能指数性的增大，有关概念格的生成问题一直是形式概念分析应用研究的一个重点。国内外的学者和研究人员对此进行了深入的研究，提出了一些有效的算法来生成概念格，这些算法一般可分为两类：批生成算法(Batch Algorithm)和渐进式生成算法(Incremental Algorithm )。。 (Concept lattice structure problem is the premise formal concept analysis applications. Since the concept of space-time lattice with the increasing complexity of the form and context may increase exponentially, generating questions about the concept lattice has been a focus of formal concept analysis applied research. Domestic and foreign scholars and researchers conducted a thorough study made a number of efficient algorithms to generate the concept lattice, these algorithms can be divided into two categories: batch generation algorithm (Batch Algorithm) and progressive generation algorithm (Incremental Algorithm ). .)

判断点和线段之间的关系，包括点在线段的上，点在线段的延长线，反向延长线，点在线段外四种情况(Judge the relationship between the point and line, including the point on the line, in line at the extension of reverse extension cord, and so on.)

计算离散傅里叶变换的一种快速算法，简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少，特别是被变换的抽样点数N越多，FFT算法计算量的节省就越显著。(A computing discrete Fourier transform fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by the JW Cooley and TW Tuji Ti out. Using this algorithm enables a computer to calculate the number of multiplications needed for the discrete Fourier transform greatly reduced, especially sampling points N is transformed more and save FFT algorithm to calculate the amount of the more remarkable.)

计算流体力学入门第九章代码 simple 算法(the code for the problem introduced in the book computational fluid dynamics chapter 9 simple algorithm)

用LU和LDU分解求解方程组，给出了详细说明(The equations are solved by the decomposition of LU and LDU, and the detailed description is given.)