-
1bjdj
mumford source code........
- 2009-09-26 17:59:21下载
- 积分：1
-
diag
滤波程序，从同事那里要的，大家一起交流学习(BADNELL & BURGESS D.A.M.T.P. CAMBRIDGE
C
C DIAGONALIZATION OF REAL SYMMETRIC N-BY-N MATRIX Z.
C
C METHOD: HOUSEHOLDER REDUCTION TO TRI-DIAGONAL FORM AND SHIFTED
C QL ALGORITHM TO DETERMINE THE E-VALUES AND E-VECTORS.
C
C BASED ON MARTIN, REINSCH & WILKINSON: NUM. MATH. 11, 181-95 (1968).
C
C INPUT REQUIRED. N, IUP AND Z. ONLY LOWER TRIANGLE OF Z NEED BE SUPPLIED.
C MATRIX Z OVERWRITTEN BY EIGENVECTORS OF Z.
C IUP=1/-1 ASC/DESCENDING SORT, 0 NO SORT.
C MXMAT, IS THE ROW DIMENSION OF Z IN THE CALLING ROUTINE.
C
C OUTPUT. Z AND D, WHERE Z CONSISTS OF COLUMN EIGENVECTORS
C AND D CONSISTS OF CORRESPONDING EIGENVALUES.
C
C NOTE: E IS A WORKING ARRAY.
C)
- 2012-07-29 20:36:54下载
- 积分：1
-
111
三种帧同步算法的MATLAB代码,具有良好的算法效果，可以使用，请大家下载(Three kinds of frame synchronization algorithm MATLAB code, a good algorithm results, you can use, please download)
- 2021-03-12 11:19:25下载
- 积分：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
-
Faran
Faran散射模型，能够计算液体中球形物体的散射声压(The Faran scattering model, able to calculate the scattering of spherical objects in the liquid sound pressure)
- 2013-05-10 09:07:56下载
- 积分：1
-
fitqr
说明： 基于矩阵QR分解的最小二乘拟合MATLAB源程序(based on QR decomposition of the matrix least squares fitting MATLAB source )
- 2006-05-12 21:57:50下载
- 积分：1
-
Time_Series_Analysis
ARIMA算法的Python实现，预测时间序列数据。
附两个数据：
AirPassengers
UK Traffic flow(The Python implementation of the ARIMA algorithm predicts the time series data.
Two data are attached.
AirPassengers
UK Traffic flow)
- 2020-10-20 09:17:25下载
- 积分：1
-
AIA
基于最小二乘法求解相移量算法，最小二乘求相移图相位(phase shift algorithm based on the least squares method, least squares seeking phase shift diagram phase)
- 2013-04-08 18:38:11下载
- 积分：1
-
cycle-model
ABAQUS中的循环模型umat，并附有解释，实现循环加载下的模拟(Cycle model in ABAQUS umat, along with explanation, to achieve the simulation under cyclic loading)
- 2020-11-29 15:09:34下载
- 积分：1
-
NDG
说明： 一维波动方程的间断有限元计算，包括网格的划分，数值积分的计算等。(Discontinuous finite element method for one-dimensional wave equation, including mesh division, numerical integration calculation and so on.)
- 2021-04-21 19:28:49下载
- 积分：1
