Efficient moves for global geometry optimization methods and their application to binary systems

Details Efficient moves for global geometry optimization methods and their application to binary systems Efficient moves for global geometry optimization methods and their application to binary systems

2010-06-29

arxiv.org/abs/1006.5675v1

Physics

Condensed Matter

Statistical Mechanics

8 pages, 5 figures, essential info on global optimization and applications to binary cluster systems

Scientific paper

We show that molecular dynamics based moves in the Minima Hopping (MH) method are more efficient than saddle point crossing moves which select the lowest possible saddle point. For binary systems we incorporate identity exchange moves in a way that allows to avoid the generation of high energy configurations. Using this modified Minima Hopping method we reexamine the binary Lennard Jones (BLJ) benchmark system with up to 100 atoms and we find a large number of new putative global minima structures.

Affiliated with

Also associated with

No associations

Rating

Efficient moves for global geometry optimization methods and their application to binary systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient moves for global geometry optimization methods and their application to binary systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient moves for global geometry optimization methods and their application to binary systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-315178