nsolgm

提供函数能进行1维2维的FFT，输入输出的序列长度应为2的整数次方倍(Provides functions can be one-dimensional two-dimensional FFT, sequence length input and output should be an integer power of 2 times)

算术编码是用符号的概率和它的编码间隔两俩个基本参数来描述的。算术编码可以是静态的或是自适应的。(Arithmetic coding to both of two basic parameters to describe the probability of the symbol and its coding interval. Arithmetic coding can be static or adaptive.)

fortran编写的共轭梯度法模块，直接套用，可以直接读矩阵文件(the conjugate gradient method of fortran written modules, ready-made, you can directly read the matrix file)

用visual basic编译的布谷鸟算法的源代码,是一种很好地启发式智能算法。(Use visual basic compiler cuckoo algorithm source code, is a good heuristic intelligent algorithm. )

王勖成《有限单元法》里面的教学源程序,PROGRAM OF PLANE PROBLEM 96.1(Wang Aimin, "Finite Element Method," in which the source of teaching, PROGRAM OF PLANE PROBLEM 96.1)

基于信任域算法求解rosenberg函数的极小值问题(Trust region algorithm for solving the rosenberg function minimum value)

一个drucker prager模型的 的用户子程序，用于求解平面应变问题 abaqus UMAT and inp(drucker prager yield model for abaqus )

matlab计算码头堆场集装箱的操作，集卡，场桥，岸桥(matlab container)

计算离散傅里叶变换的一种快速算法，简称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.)

解释有限元程序SAP5的原理，结构，算例的一本书籍(The finite element program SAP5 explain the principles, structure, examples)