bianchengzhuji

一个采用FLUENT计算气体-液体两相流的算例，附件文件可以直接用FLUENT打开，并附带了计算结果截图。(FLUENT is calculated using a gas- liquid two-phase study, attachment files can be opened directly by FLUENT, and the calculation results with the screenshot.)

利用分步傅立叶积分法，求解薛定谔方程，可以计算光纤中色散与SPM(This file solves the nonlinear Schrodinger equation for propagation in an optical fiber using the split-step Fourier method described )

基于GWBASIC实现的无约束寻优算法，内附GWBASIC主程序和说明(Non-binding on GWBASIC achieve optimization algorithm, the main program and instructions included GWBASIC)

thermal damage abaqus-umat subroutine

this source code is use to calculate resister capacitor and inductor

计算电磁学有限元法全美经典教材，金建铭编著英文版(FEM computational electromagnetics American classic textbook, Jin Jianming edited English)

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.)

王兆华关于apFFT原理的一篇文章，写的很简单明了，方便大家更好理解全相位FFT(WangZhaoHua about apFFT principle of an article, written in very simple and clear, facilitate everybody better understand all phase FFT )

求数组最长递增子序列算法。输入一个数组，输出其最大递增子序列(Array for the longest increasing subsequence algorithm. An array of input and output its maximum incremental sequence)

己知一些离散的点，使用matlab利用最小二乘法拟合(Had a number of discrete points, with linear least squares fitting)