An iterative method for constructing information sets of singularly perturbed systems. II (Q1881824)

For Part I see Autom. Remote Control 61, No. 5, Part 1, 730--741 (2000); translation from Avtom. Telemekh. 2000, No. 5, 20--31 (2000; Zbl 1057.93035). In the paper, the minimax filtering problem for a quasi-linear singularly perturbed system is solved by means of an appropriate iterative procedure. At every step of the procedure an auxiliary problem is considered for the system of equations in variations. The solution to such an auxiliary problem defines the support function of the attainability set of the system and is found with the help of decomposition into blocks of the fundamental matrix. The applied technique is common for singularly perturbed problems and permits us to find asymptotic approximations of the information set of the system with any required accuracy. The proposed procedure admits computer simulation to be performed.