%0 Journal Article %A Liberol , Boris D. %A Rudenko , Oleg G. %A Bezsonov , Alexander A. %D 2018 %I Begell House %K regularized one-step adaptive algorithms of Kaczmarz and Nagumo–Noda, identification problem, regularization parameter, maximum convergence rate %N 10 %P 60-76 %R 10.1615/JAutomatInfScien.v50.i10.50 %T Study of Convergence of One-Step Adaptive Identification Algorithms %U https://www.dl.begellhouse.com/journals/2b6239406278e43e,292e187019dceffb,2dd9daf4530b44ab.html %V 50 %X The question of convergence of the regularized one-step adaptive algorithms of Kaczmarz and Nagumo–Noda, used for solving the identification problem, is studied. Estimates of the rate of algorithms convergence are obtained, and it is shown that the introduction of the regularization parameter together with improving the computational stability of the algorithms slightly retards the process of identification. The presence of information about statistical properties of useful signals and interferences enables the selection of the algorithm parameters providing their maximum convergence rate. %8 2018-12-31