Based on stochastic process theory, the bounded convergence of forgetting factor least square algorithm (FFLS for short) is studied and the upper bound of the parameter tracking error is given.

In this paper, based on -, the uniform convergence of the Kth order weak bounded variation functions on the sequence Spaces were investigated. Some equivalent conditions were also obtained.

In many current textbook, the monotone bounded theorem is used to the proof the convergence of a kind of but this method is uneasy to series, understand.