A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
On the computational aspects of two recent smoothing algorithms
1973
IEEE Transactions on Automatic Control
Preserved Fulltext
Zeros Zo zi z^ zz z* zi z$ zi z% Error (%) 0.269 0.320 0.278 0.308 0.261 0.308 0.256 0.289 Poles pa pi V-V* Vi P= Pi Vt Ps Error (%)0.275 0.297 0.273 0.290 0.335 0.283 0.274 0.311 0.0 where t.he largest error is in estimating p4 (0.335 percent). Abstract-This note is concerned with a consideration of the computational requirements of iixed-lag and fixed-point smoothing algorithms reported recently by the authors.
doi:10.1109/tac.1973.1100333
fatcat:mmkk7f5kxfd25c5u5qootx5rni