Consecutive algorithms of smoothing of data

In article the MONS method offered B.V. Khakimovs for creation of a smoothing spline on experimental data in which serial processing of experimental points, and its some modifications is made is investigated. The numerical experiments showing are made that results of work of considered algorithms are close to the results received by exact optimization of square functionality of a mistake at much lower computing complexity. Besides, it appeared that the formula offered B.V. Khakimovs for calculation of the size of a step gives approximately the same mistake, as use of the step found optimization of functionality of a mistake at several times lower computing complexity.