erchengfa3d

一个abaqus梁单元的UEL，配套了理论和inp文件，可以完美运行(A abaqus UEL beam element, supporting the theory and inp file, you can run perfectly)

说明：  MATLAB实现自定义的拉格朗日插值和牛顿插值，均包括主调函数和被调用函数，程序简单易懂。(MATLAB realizes the self defined Lagrange interpolation and Newton interpolation, both including the main function and the called function, the program is simple and easy to understand.)

粘弹正演程序和模型实例,2维数值模拟正演，适应于粘弹介质，(This program can be two-dimensional numerical simulation of acoustic wave equation, Viscoelastic isotropic media.)

说明：  Abaqus复合材料Hashin失效子程序(Failure subroutine of Hashin for ABAQUS composite)

belief propagation algrithm

Description 设a[0…n-1]是一个包含n个数的数组，若在i<j的情况下，有a[i]>a[j]，则称(i, j)为a数组的一个逆序对（inversion）。 比如 <2,3,8,6,1> 有5个逆序对。请采用类似“合并排序算法”的分治思路以O(nlogn)的效率来实现逆序对的统计。 一个n个元素序列的逆序对个数由三部分构成： （1）它的左半部分逆序对的个数，（2）加上右半部分逆序对的个数，（3）再加上左半部分元素大于右半部分元素的数量。 其中前两部分（1）和（2）由递归来实现。要保证算法最后效率O(nlogn)，第三部分（3）应该如何实现？ 此题请勿采用O(n^2)的简单枚举算法来实现。 并思考如下问题： （1）怎样的数组含有最多的逆序对？最多的又是多少个呢？ （2）插入排序的运行时间和数组中逆序对的个数有关系吗？什么关系？ 输入格式 第一行：n，表示接下来要输入n个元素，n不超过10000。 第二行：n个元素序列。 输出格式 逆序对的个数。 输入样例 5 2 3 8 6 1 输出样例 5(Set a[0... N-1] is a n array containing n numbers. If there is a [i] > a [j] i n the case of I < j, then (i, j) is a n inversion pair of a array. For example, <2,3,8,6,1> has five reverse pairs. Please use the idea of "merge sorting algorithm" to achieve the statistics of inverse pairs with O (nlogn) efficiency. The number of inverse pairs of a sequence of n elements consists of three parts: (1) The number of reverse pairs in the left half, (2) the number of reverse pairs in the right half, (3) the number of elements in the left half is greater than that in the right half. The first two parts (1) and (2) are implemented by recursion. To ensure the final efficiency of the algorithm O (nlogn), how should the third part (3) be implemented? Do not use O (n ^ 2) simple enumeration algorithm to solve this problem.)

通过不精确的ALM算法，解析出张量矩阵中的低秩部分和稀疏部分。(via the Inexact ALM method will solve the programming.)

程序算任意点FFT和小波变换,以及可选择多种小波及小波变换后的单频带重够,另算信号的Lipschitz指数,高级数字信号处理!(counting procedures arbitrary point FFT and Wavelet Transform, and the choice of multiple wavelet and the wavelet transform of a single-band heavy enough, and another count signal Lipschitz index advanced digital signal processing!)

我自己用c语言写的64点基4FFT算法，在visual c++ 6.0环境下编译通过。同matlab结果一致。(My own use C language to write the 64 based 4FFT algorithm, in visual c++ 6 compiler environment through. Results consistent with matlab.)

说明：  工艺优化中偏最小二乘法对响应面法的改进，显著改善模型系数不显著现象(Matlab program for calculating grey correlation matrix)