首页 | 本学科首页   官方微博 | 高级检索  
     


Parallelization of the global extremum searching process
Authors:Yu. G. Evtushenko  V. U. Malkova  A. A. Stanevichyus
Affiliation:(1) Dorodnitsyn Computer Center, Russian Academy of Sciences, Moscow, Russia
Abstract: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.
Keywords:89.20.Ff
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号