Plane_finite_element_program

学习如何设置UPML吸收边界的3-D FDTD程序.对于初学者很有帮助(Learn how to set up UPML absorbing boundary of the 3-D FDTD procedure. Very helpful for beginners)

计算复序列的分裂基快速傅里叶变换，分裂基快速算法是将基2和基4分解组合而成。在基2M类快速算法中，分裂基算法具有最少的运算量，且仍保留结构规则、原位计算等优点。(Calculate complex sequence of split radix fast Fourier transform, fast algorithm is to split the base base 2 and base 4 decomposition combination. 2M fast algorithm in the base class, the split-based algorithm has the least amount of computation and structural rules remain in situ calculation and so on.)

lyapunov指数求解，采用wolf法，计算速度极快(lyapunov Index solving, using wolf law, the calculation speed)

这是fotran的非线性有限元程序，包括1D，2D程序(fortan NFEM )

分别采用Roe格式和AUSM格式求解一维黎曼问题，并将计算结果与解析解进行比较，发现这两种计算格式都能获得高的计算精度。(Roe scheme were used in this procedure and AUSM format to solve a 1-D RIEMANN problem, and numerical results were compared with the analytical solution, the results can be seen from these two formats have a solution with high accuracy.)

潮流计算中拉丁超立方采样的算法，可利用其进行概率潮流计算(Flow calculation Latin hypercube sampling algorithm, can use its probabilistic load flow calculation)

利用C语言实现MOORE-PENROSE广义逆矩阵的计算，经试验OK。(The realization of MOORE-PENROSE generalized inverse matrix is calculated by using the C language, through the test of OK.)

this is an inverted matrix in labview

计算偏心圆导热计算以及同位网格上的SIMPLE算法 (Calculating thermal calculations and eccentric position on the grid with SIMPLE algorithm)

概念格的构造问题是形式概念分析应用的前提。由于概念格的时空复杂度随着形式背景的增大而可能指数性的增大，有关概念格的生成问题一直是形式概念分析应用研究的一个重点。国内外的学者和研究人员对此进行了深入的研究，提出了一些有效的算法来生成概念格，这些算法一般可分为两类：批生成算法(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 ). .)