-
read_nc
用fortran语言读取NC格式的数据,与大家分享，希望能够共同进步哈，谢谢(Used fortran language to read NC data format to share with you, hoping to make progress together Ha, thank you)
- 2013-07-14 20:05:05下载
- 积分：1
-
JDJSQ
这是一个最最简单计算器，提供给大家参考一下(dadasddasdasd fafdsafasfafad)
- 2012-03-16 15:48:54下载
- 积分：1
-
NHMT
说明： 埃特金不等距插值，有例子，检验过，很顺利(Aitken non-equidistant interpolation, there are examples of tests, it is smooth)
- 2008-11-30 19:02:40下载
- 积分：1
-
自控课设
说明： 自动控制原理课程设计，建立倒立摆的非线性数学模型用SIMULINK图形库实现。(The course design of the principle of automatic control and the establishment of the nonlinear mathematical model of the inverted pendulum are realized by the Simulink graphic library.)
- 2020-06-20 12:31:50下载
- 积分：1
-
11087 统计逆序对
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.)
- 2019-01-07 23:52:06下载
- 积分：1
-
solver_mod
相场基础书籍的配套计算代码，对于学习相场法的基础同学来说极其有用(The supporting calculation code of the phase field basic book is extremely useful for the students who are studying the basic method of the phase field method.)
- 2020-06-25 12:40:02下载
- 积分：1
-
BEMforacoustics
求解声学问题的边界元源程序，可以为使用边界元法求解位势问题和弹性力学问题提供启发(problem solving acoustic BEM source, for the use of the boundary element method and the potential problems of elasticity to provide inspiration)
- 2006-11-15 19:06:28下载
- 积分：1
-
NSGA-II
NSGA-II is a popular non-domination based genetic algorithm for multi-
objective optimization.
- 2012-05-18 05:32:41下载
- 积分：1
-
kfenbu
产生K分布随机变量以及产生的随机变量与K分布密度函数的拟合程度(Generate the K-distribution fitting degree of the random variable and the random variable with distribution density function of the K)
- 2012-07-16 14:43:45下载
- 积分：1
-
共轭梯度法
说明： 共轭梯度法（Conjugate Gradient）是介于最速下降法与牛顿法之间的一个方法，它仅需利用一阶导数信息，但克服了最速下降法收敛慢的缺点，又避免了牛顿法需要存储和计算Hesse矩阵并求逆的缺点，共轭梯度法不仅是解决大型线性方程组最有用的方法之一，也是解大型非线性最优化最有效的算法之一。 在各种优化算法中，共轭梯度法是非常重要的一种。其优点是所需存储量小，具有步收敛性，稳定性高，而且不需要任何外来参数。(Conjugate gradient method Gradient) is a method between the steepest descent method and Newton's method. It only uses the first derivative information, but overcomes the disadvantage of slow convergence of steepest descent method, and avoids the disadvantage of storing and calculating Hesse matrix and solving inverse of Newton's method. Conjugate gradient method is not only one of the most useful methods to solve large-scale linear equations, but also the most effective method to solve large-scale nonlinear optimization One of the algorithms of. Among all kinds of optimization algorithms, conjugate gradient method is very important. It has the advantages of small storage, step convergence, high stability and no external parameters.)
- 2020-06-27 15:46:08下载
- 积分：1
