High-Performance Software Complex for Set Approximation

There are many applied problems that reduce to solving a system of equations or inequalities. Accurate obtaining of many solutions is not always feasible. Sometimes it requires for methods of set approximating. Most often, for each specific task, a special program is developed to build the necessary approximation. This work is devoted to the creation of universal algorithms for constructing approximations of any system of equations or inequalities consisting of continuous functions. In the work, technologies are used for parallel computing to reduce the operating time of these algorithms. Next, a comparative analysis is carried out between different implementations of each algorithm, as well as a comparison of the two obtained algorithms on the same applied task of constructing a robot workspace. The work area consists of many possible positions of the tool and is one of the key characteristics of the robot.