vuel_springs_3d_jumpDofs

说明：  lingo软件分享,lingo是专门用于解决规划问题的数值计算工具，操作简便(Lingo Software Sharing, Lingo is a numerical calculation tool specially used to solve planning problems. It is easy to operate.)

近似熵和互近似熵的matlab代码，用于脑波分析很有用(Approximate entropy and cross approximate entropy matlab code for brain wave analysis useful)

数值分析课程必备的算法：列主元高斯消去法算法。有需要的同学下载(Numerical analysis courses required algorithms: PCA out Gaussian elimination algorithm. Those students in need to download)

计算声发射时域信号特征值：裕值，振幅因子FK、fc，峭度，(Calculation of acoustic emission time-domain signal characteristic values: margin value, the amplitude factor FK, fc, kurtosis,)

统计[0, 100] 之间的学生人数并且求出最值和均值(Statistics [100], the number of students and find the best value and the mean)

计算牛顿和拉格朗日插值方法,用户输入插值结点(calculated Newton and Lagrange interpolation methods, user input interpolation nodes)

FDTD Solutions 是一款三维麦克斯韦方程求解软件，可以分析紫外、可见、红外至太赫兹和微波频率段电磁波与具有亚波长典型尺寸复杂结构的相互作用。 FDTD Solutions 使得设计师能够从容地面对光子设计复杂的挑战问题。快速原型制造和高精度仿真大大降低对费用高昂的原型试验的依赖，因而可以对设计概念进行快速评价，进而缩短产品研发周期，降低费用。 FDTD Solutions 可以帮助你成功应对各种复杂的应用，从基础光子学研究，到目前工业界领先应用领域如成像、照明、生物光子学、光伏、以及众多其他应用。(FDTD Solutions is a three-dimensional software for solving Maxwell' s equations, we can analyze the ultraviolet, visible, infrared and microwave to terahertz frequencies of electromagnetic waves having a typical size of subwavelength interaction of complex structures. FDTD Solutions allows designers to calmly face the complex photonic design challenges. Rapid prototyping and simulation precision greatly reduce dependence on costly prototype testing, which can quickly uate design concepts, and thus shorten the product development cycle and reduce costs. FDTD Solutions can help you successfully deal with a variety of complex applications, leading application areas such as imaging, lighting, biophotonics, photovoltaics, and many other applications basic photonics research, the current industry.)

A FORTRAN IV function to compute the probability of a standard normal deviate

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

迭代算法用在曲面，曲线拟合，很好的一个算法(The iterative algorithm used in the surface, curve fitting, a good algorithm)