A new parallel smoothing algorithm

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.