-
conj
fortran编写的共轭梯度法模块，直接套用，可以直接读矩阵文件(the conjugate gradient method of fortran written modules, ready-made, you can directly read the matrix file)
- 2015-12-08 12:36:20下载
- 积分：1
-
11087 统计逆序对
说明： 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.)
- 2019-01-07 23:52:06下载
- 积分：1
-
82859165cifa
编程序，按如下要求来求解n元一次线性方程组（假设方程组具有唯一解）。 （1）方程个数n之值由用户通过键盘输入； （2）方程组存放在“增广矩阵”A之中，而n行n+1列的A存储空间通过new来动态分配，且A的各元素值也由用户通过键盘输入
(Allocation procedures, the following requirements to solve the n-a system of linear equations (assuming a unique solution of equations). (1) the number n of the value equation by the user through the keyboard input (2) equations stored in the augmented matrix A, while n line n+ 1 column A storage space through the new dynamically allocated, and A The value of each element by the user through the keyboard input)
- 2011-06-21 22:50:34下载
- 积分：1
-
Finite element mesh generation
全面介绍有限元网格生成算法的英文教材，可以作为网格生成算法的编程资料(finite element mesh generation has not been taken as a formal subject of teaching in universities,as it encompasses several disciplines including classical geometry, computational geometry and topology, finite element method, data structures and algorithms, computer programming and, to a certain extent, even computer graphics.)
- 2018-01-29 10:55:18下载
- 积分：1
-
贝叶斯聚焦算法IEEE Bayesian-Focusing
最新的关于贝叶斯聚焦算法IEEE文章。该算法通过利用信号DOA概率密度函数实现加权的阵列波前差值法，能实现宽带相干信号的DOA估计，并能减小阵列聚焦误差，提高宽带阵列频域波束形成鲁棒性。(In this paper, we present and study a Bayesian focusing transformation (BFT) for coherent wideband array processing, which takes into account the uncertainty of the direction
of arrivals (DOAs). The Bayesian focusing method minimizes the
mean-square error of the transformation over the probability densityfunctions(pdfs)oftheDOAs,thusachievingimprovedfocusing
accuracy over the entire bandwidth)
- 2021-04-07 23:19:01下载
- 积分：1
-
Gauss
matlab中高斯迭代法使用的m文件，可以用于方程组近似值的求解。(m file matlab Gauss iterative method can be used for approximation of solving equations.)
- 2012-06-04 18:55:14下载
- 积分：1
-
mpc
说明： 通过建立车辆运动学模型，使用MPC算法模拟仿真导引车辆达到指定点(Through the establishment of vehicle kinematics model, the MPC algorithm is used to simulate and guide the vehicle to the designated point.)
- 2019-05-28 15:59:25下载
- 积分：1
-
testcode
This is a test code for parallel computation in fortran. Thanks
- 2013-06-26 01:29:32下载
- 积分：1
-
minmod
minmod限制器函数，计算流体力学TVD格式中的开关函数。(minmod limiter function)
- 2012-07-04 01:11:38下载
- 积分：1
-
mahalanobis
一种新的计算马氏距离的算法，算法采用二次协方差矩阵操作，进而使距离考加入相对性因素。(a new Mahalanobis distance calculation algorithm, the algorithm using quadratic covariance matrix operations, thereby enabling the relative distance to take factors.)
- 2006-09-30 23:22:22下载
- 积分：1
