Stress-wave-induced-Fracture

说明：  基于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.)

提出基于高速公路收费站进出口数据推算OD矩阵的一般方法。在缺乏初始OD矩阵的条件下,结合指数平滑法和无约束重力模型思想,通过VB编程反复迭代进行初始OD矩阵推算 利用组合模型预测高速公路各收费站出入口流量,通过弗雷特法进行OD分布推算。以沪宁高速公路为例证实此方法具有较高的精度。(Proposed highway toll station-based import and export data projections general OD matrix method. Lack of initial OD matrix conditions, combined with the exponential smoothing and unconstrained gravity model of thinking, through the VB Programming iterative initial OD Matrix Estimation flow of the use of a combination of model predictions highway toll station entrances and exits through Fratar Method for OD distribution projections. Shanghai-Nanjing Expressway, for example to confirm that this method has higher accuracy.)

abaqus中扩展有限元（UEL）计算疲劳断裂(extended finite element method (uel)for fracture problems within the finite element software ABAQUS)

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

C++编写的电力系统潮流计算程序，采用牛顿法，并考虑到节电优化编号，5,14,57,300节点验证正确(Power flow calculation program, C++ written using Newton' s method, taking into account the number to the power-saving optimization, 5,14,57,300 node authentication)

FFT DIF 分裂基的C语言代码，比较好的说明了整个流程(FFT DIF split the base of the C language code, better explains the entire process)

利用坎门站的潮汐观测数据计算调和常数，并利用主要分潮和浅水分潮进行潮汐预报(Kanmen station observation data using tidal harmonic constants calculated, using mainly tidal and shallow water tidal surges were forecast...)

此源码包是我本学期最优化理论课程的大作业，其中包括了我自己写的以下常用最优化算法的实现代码：最速下降法，牛顿法，非线性最小二乘法，DFP法。fun1，fun2是两个测试函数。谢谢！(This is my source packages optimization theory this semester courses in large operations, including my own to write the following commonly used optimization algorithm code: steepest descent method, Newton method, nonlinear least squares method, DFP method. fun1, fun2 are two test function. Thanks!)

金属表面反射模型算法，用于计算不同金属的偏振反射参数。(Metal surface reflectance model algorithm used to calculate the different metal polarized reflectance parameters.)

用Fortran编写的非线性优化软件，具有一定的智能搜索功能(used in Fortran program)