提出了具有一般相关量测噪声的线性系统的平滑估计算法, 该算法是在系统正向和逆向滤
波估计结果的基础上,利用线性无偏最小方差估计获得的.由于量测噪声的相关性,使得其后验均
值不一定等于其先验均值,而它的后验均值又无法通过计算得到, 因而提出的算法是一个次优算
法.在正、 逆向滤波结果已知时,所提出的算法计算量小,易于实现.仿真实例说明,该算法的估计结
果要优于正、 逆向滤波估计结果,以及量测噪声不相关的Kalman 平滑估计结果
Based on the forw ard and backw ard f i ltering est imates a smoothing algorithm is developed
for linear systems w i th general correlated measurement noises by using the l inear unbiased minimum
v ariance est imation formula. Because of the correlat ion of the measurment noises the posterior mean of
the noise is not alw ays equal to its prior one and can t be calculated. Hence, the proposed algorithm is
subopt imal . When the forward and backward f il tering result s are know n, the proposed algorithm has
low computional complex ity and can be real ized easi ly. T hrough a simulat ion example i t is indicated
that the result of the proposed smoothing algorithm is bet ter than that of the forward, backward filter
ing or Kalman smoothing algorithm, where the measurement noises are assumed to be uncorrelated (2012-08-08, Visual C++, 351KB, 下载7次)
Sorting by Heapsort and Mergesort algorithms.
===================================
Input file：H01dat.txt
----------------------------
包含第一列為n a b
第二列以後為a1 a2 a3 a4 ...... an
n：要排序的輸入資料數。
ai：要排序的資料，以space 或換行隔開，程式要能自行判斷資料輸入到n筆為止。
-------------------------------------Output：使用標準輸出〈即輸出到螢幕〉
-------------------------------------a：若a = 1，使用heapsort；若a = 2，使用mergesort。
b：若b = 1，則顯示排序後的結果〈由小到大〉；
若b = 2 且a = 1，則輸出Heapsort前兩次的過程(包含Heapify 過程)；
若b = 2 且a = 2，Megersort 則輸出前五次sort 的過程。
Sorting by Heapsort and Mergesort algorithms. =================================== Input file: H01dat.txt--------------------------- nab the second column contains the first column after the a1 a2 a3 a4 ...... an n: to the number of input data sorted. ai: to sort the data, separated by space or newline, the program must be able to judge for themselves the information input to the n pen up.------------------------------------- Output: standard output < that is output to the screen> ------------------------------------ a: if a = 1, using the heapsort if a = 2, using mergesort. b: If b = 1, then display the results sorted < steeled> if b = 2 and a = 1, the output Heapsort during the last two (including Heapify process) if a = b = 2 and 2, Megersort sort the output process of the previous five. (2011-01-24, C/C++, 7KB, 下载1次)