Dipartimento di Sistemi e Informatica

Similar documents
Packing circles in a square: new putative optima obtained via global optimization

The global optimization of Morse clusters by potential energy transformations

Global Minimum Structures of Morse Clusters as a Function of the Range of the Potential: 81 e N e 160

SOLVING MOLECULAR DISTANCE GEOMETRY PROBLEMS BY GLOBAL OPTIMIZATION ALGORITHMS

Close-packing transitions in clusters of Lennard-Jones spheres

Analysis of the Lennard-Jones-38 stochastic network

Geometry Optimization and Conformational Analysis of (C 60 ) N Clusters Using a Dynamic Lattice-Searching Method

Competition between face-centered cubic and icosahedral cluster structures

Analysis of Crossover Operators for Cluster Geometry Optimization

Global minima for rare gas clusters containing one alkali metal ion

arxiv:cond-mat/ v1 6 Jan 2000

arxiv:cond-mat/ v2 23 Sep 2002

A Conformational Analysis Method for Understandingthe Energy Landscapes of Clusters

Improved bounds for interatomic distance in Morse clusters

Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern

On the relation between concavity cuts and the surrogate dual for convex maximization problems

A Dynamic Lattice Searching Method for Fast Optimization of Lennard Jones Clusters

arxiv:cond-mat/ v1 27 Mar 1998

The effect of the range of the potential on the structures of clusters

Structural optimization of Lennard-Jones clusters by a genetic algorithm. Abstract

J.C. Hamilton Sandia National Laboratories, Livermore, California 94551

Structure Prediction and Global Optimization

Gaussian Distributions and Global. Optimization: An exploration into improved. performance

Modeling the structure of clusters of C 60 molecules

Quantum Disordering versus Melting in Lennard-Jones Clusters.

Identifying communities within energy landscapes

Paths, Permutations and Trees. Enumerating Permutations Avoiding Three Babson - Steingrímsson Patterns

Title. Author(s)Takeuchi, Hiroshi. CitationChemical Physics, 457: Issue Date Doc URL. Rights. Type. Additional There Information

Math 120A: Extra Questions for Midterm

Cold Fusion and Palladium Atom Clusters

Discrete planning (an introduction)

A simple example of a polyhedral network or polynet, constructed from truncated octahedra and hexagonal prisms.

ISTITUTO DI ANALISI DEI SISTEMI ED INFORMATICA

If one wants to study iterations of functions or mappings,

q lm1 q lm2 q lm3 (1) m 1,m 2,m 3,m 1 +m 2 +m 3 =0 m 1 m 2 m 3 l l l

On Ekeland s variational principle

arxiv: v2 [cond-mat.soft] 28 Feb 2017

Data Mining Chapter 4: Data Analysis and Uncertainty Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University

EXERCISES ON THE OUTER AUTOMORPHISMS OF S 6

Fullerenes with distant pentagons

Colloid Chemistry. La chimica moderna e la sua comunicazione Silvia Gross.

The effect of the range of the potential on the structure and stability of simple liquids: from clusters to bulk, from sodium to C 60

OBJ: SWBAT review on converting radicals to exponential form and learn to identify, graph, and model power functions Homework Requests: Questions

J. Phys. Chem. A XXXX, xxx, 000 A. Effects of Quantum Delocalization on Structural Changes in Lennard-Jones Clusters

Influence of the atom atom interaction anisotropy on the structure and stability of Ar Cl clusters

Lesson 1 WHAT S A GROUP?

Hidden Symmetry in Disordered Matter

A Formal Analysis for Capturing Replay Attacks in Cryptographic Protocols

Basic Principles of Quasicrystallography

The Dispersion Metric and the CMA Evolution Strategy

NEW CARBON NANOPARTICLE - ICOSAHEDRAL DIAMOND

Strontium clusters: Many-body potential, energetics, and structural transitions

Symmetry Adapted Orbitals

ENCOURAGING THE GRAND COALITION IN CONVEX COOPERATIVE GAMES

Pressure Dependent Study of the Solid-Solid Phase Change in 38-Atom Lennard-Jones Cluster

From the propagation of uncertainties to the propagation of distributions

Non-convex Robust PCA: Provable Bounds

New bounds for Morse clusters

EVOLUTIONARY DISTANCES

Distance in the Plane

Generation of crystal structures using known crystal structures as analogues

Mathematical Modelling in Nanotechnology

CSC321 Lecture 8: Optimization

Density dependence of dielectric permittivity of water and estimation of the electric field for the breakdown inception

Supplemental Document to the Paper A Game-Theoretic Approach for Regulating Hazmat Transportation

Structural transition in (C 60 ) n clusters

Experiments on Stabilization of the Hanging Equilibrium of a 3D Asymmetric Rigid Pendulum

Ch. 9- Molecular Geometry and Bonding Theories

Department of Chemical Engineering University of California, Santa Barbara Spring Exercise 2. Due: Thursday, 4/19/09

The expansion of the Universe, and the big bang

CORES, JOINS AND THE FANO-FLOW CONJECTURES

Supplemental Material Controlled Self-Assembly of Periodic and Aperiodic Cluster Crystals

The effect of mutual angular misalignment in the quantized sliding of solid lubricants

VICTORIA UNIVERSITY OF WELLINGTON Te Whare Wananga o te Upoko o te Ika a Maui

Optimal Control of Partiality Observable Markov. Processes over a Finite Horizon

Molecular Dynamic Simulations in JavaScript

ENERGETICS AND DYNAMICS OF CAGED Zn 4 IN i-sczn

Some statistics on permutations avoiding generalized patterns

Krammers-Wannier Duality in Lattice Systems

E8 Physics and Quasicrystals Icosidodecahedron and Rhombic Triacontahedron Frank Dodd (Tony) Smith Jr

CE 530 Molecular Simulation

Reading 11 : Relations and Functions

ON THE FORWARD AND BACKWARD ALGORITHMS OF PROJECTION PURSUIT 1. BY MU ZHU University of Waterloo

An Introduction to Percolation

Prof. Matteo Focardi Dipartimento di Matematica U. Dini Viale Morgagni 67/a Firenze, Italia

Supplemental Material Controlled Self-Assembly of Periodic and Aperiodic Cluster Crystals

Symmetries and Polynomials

arxiv:cond-mat/ v2 8 Jan 2004

An eightfold path to E 8

Automatic Differentiation and Neural Networks

Hausdorff Measure. Jimmy Briggs and Tim Tyree. December 3, 2016

Accuracy and transferability of GAP models for tungsten

On finite Steiner surfaces

MATH 614 Dynamical Systems and Chaos Lecture 2: Periodic points. Hyperbolicity.

Local order in a supercooled colloidal fluid observed by confocal microscopy

Exploration of population fixed-points versus mutation rates for functions of unitation

Structural Transitions and Melting in LJ Lennard-Jones Clusters from Adaptive Exchange Monte Carlo Simulations

Newton s Third Law, Momentum, Center of Mass

Exploring the energy landscape

What is the solar system?

Transcription:

Dipartimento di Sistemi e Informatica New global optima for Morse clusters at ρ =8 M. Locatelli 1 and F. Schoen 2 Technical Report DSI 3/2003 1 locatell@di.unito.it - Dip. Informatica - Università ditorino 2 schoen@ing.unifi.it - Dip. Sistemi e Informatica, Università degli Studi di Firenze 1

Abstract We recently discovered 5 new putative globally optimum configurations for Morse clusters at ρ = 8. This report contains some algorithmic details as well as the structures determined with our method.

Methodology After the success obtained in solving minimum energy conformation problems for Lennard-Jones clusters (see [LS02] and [LS03]) we recently adapted our twophase monotonic basin-hopping strategy to the minimization of Morse molecular clusters. We recall that, given two particles, the pairwise Morse interaction between them is defined as v(r; ρ) = ( e ρ(1 r) 1) 2 1 where ρ is a parameter and r is the distance between the center of the two particles. A system consisting of N particles has a Morse potential given by M N (ρ) = N N i=1 j=i+1 v( X i X j ; ρ) where X i and X j represent the three-dimensional coordinates of the centers of particle i and j respectively. Finding the coordinates of N particles in such a way as to globally minimize M N (ρ) for a fixed value of ρ is an extremely challenging global optimization problem which has attracted much theoretical as well as algorithmic research in the last few years. The problem becomes harder and harder as ρ increases. In http://www-wales.ch.cam.ac.uk/~jon/ structures/morse.html the current putative optima for N [5, 80] are reported, with tables indicating explicitly the putative optima for ρ = 3, 6, 10, 14 and an indication of the range of ρ values in which those optima are believed to be optimum. In the same web site it is reported that The location of all the global minimum at ρ 0 =3, 6, 10 and 14 for clusters with up to 80 atoms would be a significant achievement and one which no unbiased global optimization algorithm has yet managed. Indeed we managed to obtain all the putative optima with a two-phase algorithm, whose details will appear elsewhere. While searching for optimum conformation at ρ = 14 we discovered five new conformations which, for ρ =8 ad an energy which is lower than the one reported in the tables. In any case these optima were obtained using a two phase algorithm in which, during what we call the first phase, a modified potential is optimized and, during the second phase, a local optimization is performed from the optimum found in the first phase. The first phase potential is a modification of the Morse one and, in the experiments whose results are displayed in this report, we used to optimize with a ρ value larger than the one used in the second phase. In particular we ran two-phase methods using ρ = 14 in the first phase and ρ = 8 in the second. Results Without going in much detail on the parameters used, we report here the comparison between the energy of the new structures found and the previous putative optimum reported in the Cambridge Clusters Database (CCD): 1

N putative new optimum optimum 24-84.5623-84.60748 25-88.73944-89.04075 45-180.88844-181.03242 48-195.68894-195.84211 51-210.5258-210.6169 Pictures 1 5 report the new and previous optimum configurations in all the figures the structure in red on the right is the putative optimum contained in the CCD, while the structure in green on the left is the new putative optimum we discovered. It is readily seen that for N =24, 45, 48, 51 the old and new structures are very similar. Indeed, once we found them, we ran our two phase non monotonic method directly using ρ = 8 and indeed very easily found again these structures. They are all based on icosahedral lattices and they can also be easily found with a forward procedure. [Doy03] suggests that on going from 44B 45B 46B and 47B 48B 49B two atoms are added. If the order in which these atoms is added is reversed one gets the new structures (the codes used here are those of the CCD). The new 24-atom structure is an icosahedron with an anti-mackay overlayer, but with the new atom on 23A in a slightly different position to 24A. The 51-atom structure is another icosahedral structure and can be formed by adding an atom to 50B. A slightly different analysis should be done for the new 25-atom structure, which, as can be seen from the pictures, is quite different from the previously known putative optimum. Again [Doy03] reports that the new 25-atom structure can either be thought of as 23B (two face-sharing icosahedra) with two atoms added next to the middle of the cluster, or as three interpenetrating icosahedra with the a bent line joining the centers (for 23A it is an equilateral triangle). This structure appears to be a stable one for a different potential function, namely the Dzugutov potential (http://www-wales.ch.cam.ac.uk/ ~jon/structures/dzugutov/structures.html). The fact that not only our procedure was able to improve the putative optimum for N = 25, but also that it discovered a Dzugutov optimum might induce to think that, with very little modification, our method should perform quite well also on Dzugutov clusters. This possibility will be explored in the future. 2

Figure 1: N =24 Figure 2: N =25 3

Figure 3: N =45 Figure 4: N =48 4

Figure 5: N =51 5

Bibliography [Doy03] J.P.K. Doye. Personal communication, 2003. [LS02] [LS03] Marco Locatelli and Fabio Schoen. Fast global optimization of difficult Lennard-Jones clusters. Computational Optimization and Applications, 21(1):55 70, 2002. Marco Locatelli and Fabio Schoen. Efficient algorithms for large scale global optimization: Lennard-Jones clusters. Computational Optimization and Applications (to appear), 2003. 6