Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Sampling algorithms, potential energy surfaces

Genetic algorithm (GA) is a kind of widely used method to determine the global minimum structure of a cluster. It can sample the potential energy surface efficiently and hop from one region of the PES to another region rather easily. It is inspired by Darwinian evolution theory that only the fittest individuals can survive. The basic philosophy of GA is to mimic the natural selection and evolution processes in nature. The essential idea of GA procedure is to allow a population of a number of individual candidates to evolve under a given selection rule that maximizes the fitness function. [Pg.250]

HyperChem provides three types of potential energy surface sampling algorithms. These are found in the HyperChem Compute menu Single Point, Geometry Optimization, and Molecular Dynamics. [Pg.160]

Keywords Ab initio molecular dynamics simulations Always stable predictor-corrector algorithm Associated liquids Basis set Bom-Oppenheimer molecular dynamics simulations Car-Parrinello molecular dynamics simulations Catalysis Collective variable Discrete variable representation Dispersion Effective core potential Enhanced sampling Fictitious mass First-principles molecular dynamics simulations Free energy surface Hartree-Fock exchange Ionic liquids Linear scaling Metadynamics Nudged elastic band Numerically tabulated atom-centered orbitals Plane waves Pseudopotential Rare event Relativistic electronic structure Retention potential Self consistent field SHAKE algorithm ... [Pg.109]

A force field can be coupled with molecular dynamics (MD) algorithms to sample local conformational space around the energy minimum of a macro-molecule. An MD algorithm involves the numerical integration of Newton s equation s of motion, where the acceleration of a particle is a = Fj/w, and the force Fj is the negative gradient of the potential surface. New atomic positions and velocities are calculated repeatedly with a small time step on the order of 10 " sec (1 fsec). The resulting set of time dependent coordinates is known as a trajectory. [Pg.59]


See other pages where Sampling algorithms, potential energy surfaces is mentioned: [Pg.2220]    [Pg.273]    [Pg.70]    [Pg.276]    [Pg.341]    [Pg.277]    [Pg.40]    [Pg.328]    [Pg.2220]    [Pg.47]    [Pg.155]    [Pg.398]    [Pg.16]    [Pg.409]    [Pg.41]    [Pg.13]    [Pg.382]    [Pg.276]    [Pg.137]    [Pg.370]    [Pg.389]    [Pg.405]    [Pg.324]    [Pg.93]    [Pg.383]    [Pg.779]    [Pg.555]    [Pg.161]    [Pg.161]    [Pg.187]    [Pg.51]    [Pg.52]    [Pg.547]    [Pg.354]    [Pg.319]    [Pg.61]    [Pg.268]    [Pg.361]    [Pg.197]    [Pg.140]    [Pg.2340]    [Pg.95]    [Pg.260]    [Pg.292]    [Pg.62]   


SEARCH



Algorithm sampling

Algorithms, sample

Surface samples

© 2024 chempedia.info