ABAQUS-UMAT

说明：  基于结构网格二维Euler方程的Jameson求解方法 自己写的程序，网格是现成的结构网格(Jameson solution method based on two-dimensional Euler equation of structural grid. Write their own procedures, the grid is ready - made structural grid.)

一个简单介绍ZERNIKE矩的文章，zernike矩是一种在图像处理、模式识别中广泛应用的方法(ZERNIKE a brief moment of articles, zernike moment is a kind of image processing, pattern recognition methods widely used in)

多元GARCH的Matlab程序，用于计算GRACH(y,p,q)(Multivariate GARCH in Matlab)

包括基本的克里金(Kriging)插值法实现代码，仅实现基本方法部分，不包含扩展克里金方法( kriging uses ordinary kriging to interpolate a variable z measured at locations with the coordinates x and y at unsampled locations xi, yi. The function requires the variable vstruct that contains all necessary information on the variogram. vstruct is the forth output argument of the function variogramfit. This is a rudimentary, but easy to use function to perform a simple kriging interpolation. I call it rudimentary since it always includes ALL observations to estimate values at unsampled locations. This may not be necessary when sample locations are not within the autocorrelation range but would require something like a k nearest neighbor search algorithm or something similar. Thus, the algorithms works best for relatively small numbers of observations (100-500). For larger numbers of observations I recommend the use of GSTAT. Note that kriging fails if there are two or more observa)

线接触滑块润滑，基于有限差分法，采用的是中间差分的方法，求解油膜厚度(Line contact slider lubrication, based on the finite difference method, using an intermediate difference method for solving film thickness)

BICG算法，是Krylov子空间的迭代方法之一(The BICG algorithm is one of the Krylov subspace iteration method)

通过采集直流输电线路正负极故障电流信息，实行正负极解耦，用行波进行故障定位( U901A u8FC1 u91C0 u96C6 u76R4 u6D1 u8F93 u7535 u7EBF u8DEF u6B63 u8D1F u6781 u6545 u969C u7535 u6D41 u4D1 u606F uFF0C u5B9E u882C u6B63 u8D1F u6781 U89E3 u806 uFF0C u7528 u884C u6)

说明：   ★问题描述: 给出平面上的N 个二维点，求出距离最小的2 个点对。本题中距离定义为他们的直 线距离。例如(0,0) (3,4)的距离为5. ★数据输入： 有多组数据，对于每组数据，第一行是一个数字N 表示点的个数。N=0 的时候说明 输入结束。之后N 行，每行有2 个浮点数x_i,y_i 表示第i 个点的坐标。(1<=N<=10000 0,0<=|x_i|,|y_i|<=10^9) ★结果输出: 输出一个浮点数，表示最近点对的距离除以2，保留2 位小数(四舍五入)。

Dsimplex.m 对偶单纯形法求解线性规划问题(Dual simplex method for solving linear programming problems)

西安电子科技大学葛德彪教授书后所附fortran程序(Xidian University, Professor Ge Debiao book accompanying fortran program)