palabos

基于Biegler动态优化正交配置法（联立算法）的matlab 代码，由M.Cizniar，M. Fikar等编写(dynopt is a set of MATLAB functions for determination of optimal control trajectory by given description of the process, the cost to be minimised, subject to equality and inequality constraints, using orthogonal collocation on fi nite elements method.)

fast fourier transformation

这是利用FFT分析相位差的程序，具有一定的参考价值！(This is done using FFT analysis phase of the program, has a certain reference value!)

简单的滤波代码，包含高通滤波，低通滤波，带通滤波和带阻滤波。( U7B80 u5E5 u6E4 u6E4 u6E1 u6E1 u6E2 U5E26 u963B u6EE4 u6CE2 u3002)

说明：  Description 设a[0…n-1]是一个包含n个数的数组，若在ia[j]，则称(i, j)为a数组的一个逆序对（inversion）。 比如 有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, 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.)

ABAQUS渐近损伤 用于分析层合板渐近损伤 包含刚度折减(progresive damage)

说明：  基于M估计的迭代最小二乘算法，其中估计量有Huber,Andrews,Hampel,Ramsay等。(M is estimated based on the iterative least-squares algorithm, which estimates there are Huber, Andrews, Hampel, Ramsay and so on.)

说明：  ADI method for solving PDE equations

利用龙格库塔法（等步长，变步长）计算椭圆方程，双曲线方程，抛物线方程等。对各类微分方程进行数值计算。(The use of Runge-Kutta method (such as step, variable step size) calculated elliptic equations, hyperbolic equations, such as parabolic equation. Various types of differential equations for numerical calculation.)

基于ABAQUS的hashin和Tong-Norrius准则的umat子程序(Umat subroutine based on the Hashin and Tong-Norrius guidelines of ABAQUS)