ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Network Numerical Analysis for the Smoother and the Lagged Joint-Process Estimator
Cited 0 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
이양선, 김동규, Leonard Barolli
발행일
201309
출처
Journal of Supercomputing, v.65 no.3, pp.1192-1204
ISSN
0920-8542
출판사
Springer
DOI
https://dx.doi.org/10.1007/s11227-012-0753-2
초록
Motivated by the fact that the a priori least-squares-order-recursive lattice (LSORL) smoother is more robust than the LSORL joint-process estimator with lagged desired signals in the finite precision, we model numerical properties of the two algorithms by virtue of previous efforts. Then, we give the reason why the smoother is substantially more robust than the lagged joint-process estimator by providing the explicit analysis for the performance difference of the two algorithms. © 2012 Springer Science+Business Media, LLC.
키워드
Estimator, LSORL, Smoother
KSP 제안 키워드
Explicit analysis, Finite precision, Least Squares(LS), Numerical Analysis, Performance difference, Process Estimator