-
A-Novel-Quaternion-Kalman-Filter
一篇关于qkf文献, 量测方程四元素线性推导过程。 (A Novel Quaternion Kalman Filter)
- 2016-09-01 10:58:48下载
- 积分:1
-
newton
数值分析的牛顿法,是用C编写的,希望大家互相参考!!1(Pleiades值tub cavity Xu Yang Lai Hey, Did using C met写cavity, submerged mode希望deceive gaze intently EC banana!! 1)
- 2008-05-14 13:25:28下载
- 积分:1
-
3
说明: 下三角复矩阵求逆的ASIC设计及实现
论文 pdf(Lower triangular complex matrix inverse of the ASIC Design and Implementation of)
- 2009-09-25 22:51:57下载
- 积分:1
-
光孤子传播过程 非线性薛定谔方程
说明: 本模拟是采用分步傅里叶的解,求光孤子在光线内传输过程数值求解薛定谔方程。方程是激光器在光纤中传输的过程。(In this simulation, the fractional Fourier solution is used to solve the Schrodinger equation. The equation is the process of laser transmission in fiber.)
- 2020-03-11 18:35:53下载
- 积分:1
-
kalman
卡尔曼滤波的源程序,卡尔曼滤波是以最小均方误差为估计的最佳准则,来寻求一套递推估计的算法。它适合于实时处理和计算机运算。
(Kalman filtering of source code, Kalman filter based on minimum mean square error for estimating the best criteria to search for a recursive estimation algorithm. It is suitable for real-time processing and computing.)
- 2008-05-20 22:16:52下载
- 积分:1
-
ieee14
十四节点潮流计算程序,采用了经典的牛拉法潮流计算方法 配以注释(14 nodes trend calculation procedure, using the classic cattle Rafah flow calculation method together with the comments)
- 2012-06-13 16:33:18下载
- 积分: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
-
kalman
实现卡尔曼滤波算法,可以进行参数估计、插值、滤波和预报(The Kalman filter algorithm, parameter estimation, interpolation, filtering and prediction)
- 2012-12-27 19:24:51下载
- 积分:1
-
SVMcgForRegress
支持向量机中的支持向量回归函数对数据进行预测(Support Vector Regression Function in Support Vector Machine to Predict Data)
- 2019-05-12 16:42:10下载
- 积分:1
-
Landweber
电容层析成像的landweber算法演示程序,并有详细的说明。(The capacitive tomography of the landweber algorithm demonstrates the program and has a detailed description.)
- 2020-12-31 09:59:04下载
- 积分:1