Title :
A new parallel smoothing algorithm
Author :
Tewfik, A.H. ; Levy, B.C. ; Willsky, A.S.
Author_Institution :
Massachusetts Institute of Technology
Abstract :
This paper describes a new smoothing algorithm that uses a number of processors to smooth blocks of measurements in parallel with little communication between the processors. This procedure is found to have a total on-line computational complexity slightly higher than that of the non-parallel implementations. However, since several processors are used in parallel, the running time of this algorithm is much smaller than that of a single smoother solution.
Keywords :
Computational complexity; Computer errors; Concurrent computing; Costs; Information filtering; Information filters; Laboratories; Parallel algorithms; Partitioning algorithms; Smoothing methods;
Conference_Titel :
Decision and Control, 1986 25th IEEE Conference on
Conference_Location :
Athens, Greece
DOI :
10.1109/CDC.1986.267508