Parallelization of the global extremum searching process

The parallel algorithm for searching the global extremum of the function of several variables is designed. The algorithm is based on the method of nonuniform coverings proposed by Yu. G. Evtushenko for functions that comply with the Lipschitz condition. The algorithm is realized in the language C and message passing interface (MPI) system. To speed up computations, auxiliary procedures for founding the local extremum are used. The operation of the algorithm is illustrated by the example of atomic cluster structure calculations.