A disadvantage to the majority of smoothing algorithms which have been presented is that computation must be performed off-line. For the case where smoothing is desired at a finite number of points, on-line algorithms for this fixed-point smoothing have been developed. This work prosents the developments associated with the error and sensitivity analysis of these algorithms. Examples illustrating the theory are presented.