New algorithm in the basin hopping Monte Carlo to find the global minimum structure of unary and, binary metallic nanoclusters

Abstract

The basin-hopping Monte Carlo algorithm was modified to more effectively determine a global minimum structure in pure and binary metallic nanoclusters. For a pure metallic Ag(55) nanocluster, the newly developed quadratic basin-hopping Monte Carlo algorithm is 3.8 times more efficient than the standard basin-hopping Monte Carlo algorithm. For a bimetallic Ag(42)Pd(13) nanocluster, the new algorithm succeeds in finding the global minimum structure by 18.3% even though the standard basin-hopping Monte Carlo algorithm fails to achieve it. (C) 2008 American Institute of Physics.