- Energy minimization
Energy minimization (energy optimization) methods are common techniques to compute the equilibrium configuration of
molecules. The basic idea is that a stable state of a molecular system should correspond to a local minimum of their potential energy. This kind of calculation generally starts from an arbitrary state of molecules, then the mathematical procedure of optimizationallows us to move atoms ("to vary variables") in a way to reduce the net forces (the gradientsof potential energy) to nearly zero. Like molecular dynamicsand Monte-Carlo approaches, periodic boundary conditionshave been allowed in energy minimization methods, to make small systems. A well established algorithm of energy minimization can be an efficient tool for molecular structure optimization.
molecular dynamicssimulations, which are based on Newtonian dynamic laws and allow calculating atomic trajectory with kinetic energy, molecular energy minimization does not include the effect of temperature, and hence the trajectories of atoms during the calculation do not really make any physical sense, i.e. we can only obtain a final state of system that corresponds to a local minimum of potential energy. From physical point of view, this final state of the system corresponds to the configuration of atoms when the temperature of system infinitely approximate to zero, e.g. as shown in Figure 1, if there is a cantilevered beam vibrating between positions 1 and 2 around an equilibrium position 0 with an initial kinetic motion, no matter we start with the state 1, the state 2 or any other state between these two positions, the result of energy minimization for this system will always be the state 0.
algorithmsof gradient are the most popular methods for energy minimization. The basic idea of gradient methods is to move atoms by the total net forces acting on them. The force on atoms is calculated as the negative gradient of total potential energy of system, as follows:
where r"i" is the position of atom "i" and "U"tot is the total potential energy of the system.
An analytical formula of the gradient of potential energy is preferentially required by the gradient methods. If not, one needs to calculate numerically the
derivatives of the energy function. In this case, the Powell's direction set methodor the downhill simplex methodcan generally be more efficient than the gradient methods.
Simple gradient method (
steepest descent, gradient descent)
Here we have a single function of the potential energy to minimize with 3N independent
variables, which are the 3 components of the coordinatesof N atoms in our system. We calculate the net force on each atom F at each iterationstep "t", and we move the atoms in the direction of F with a multiple factor "k". "k" can be smaller at the beginning of calculation if we begin with a very high potential energy. Note that similar strategy can be used in molecular dynamicsfor reducing the probability of divergenceproblems at the beginning of simulations.
We repeat this step in the above equation "t" = 1,2,... until F reaches to zero for every atom. The potential energy of system goes down in a long narrow valley of energy in this procedure.
Despite that it is as well called “steepest descent”, the simple gradient
algorithmis in fact very time-consuming if we compare it to the conjugate gradientapproach, it is therefore known as a "not very good" algorithm. However, its advantage is its numerical stability, i.e., the potential energy can never increase if we take a reasonable "k". Thus, it can be combined with a conjugated gradient algorithm for solving the numerical divergence problem when two atoms are too close to each other. Conjugate gradient method
The conjugate gradient algorithm includes two basic steps: adding an
orthogonal vectorto the direction of research, and then move them in another direction nearly perpendicular to this vector. These two steps are as well known as: "step on the valley floor and then jump down". Figure 2 shows a highly simplified comparison between the conjugated and the simple gradient on a 1D energy curve.
In this algorithm, we minimize the energy function by moving the atoms as follows,
and "gamma" is updated using the
Here we note that "gamma" can also be calculated by using the Polak-Ribiere formula, however, it is less efficient than the Fletcher-Reeves one for certain energy functions. At the beginning of calculation (when "t" = 1), we can make the search direction vector h0 = 0.
This algorithm is very efficient. However, it is not quiet stable with certain potential functions, i.e. it sometimes can step so far into a very strong repulsive energy range (e.g. when two atom are too close to each other), where the
gradienton this point is almost infinite. It can directly result a typical data-overrun error during the calculation. For resolving this problem, we can combine the conjugated gradient algorithm with the simple one. Figure 3 shows the schematics of this combined predicting algorithm. We note for implementation that the steps 2 and 5 can be combined to one single step.
The atoms in our system can have different degrees of freedom. For example, in case of a tube suspended over two supports, we need to fix certain number of atoms "N*" at the tube ends during the calculation. In this case, it is enough not to move these "N*" atoms in the step 4 or 8 in Figure 3, but we still calculate their interaction with other atoms in the steps 2 and 5. i.e. from mathematical point of view, we change the total number of variables in the energy function from "3N" to "3N-3N*"using the boundary condition, by which the values of these "3N*" unknown variables are taken as known constants. Note that one can even fix atoms in only one or two directions in this way.
Moreover, one can equally adding other boundary conditions to the minimized energy function, such as adding external forces or external electric fields to the system. In these cases, the terms in potential energy function will be changed but the number of variables remains constant.
Here an example of the application of the energy minimization method in molecular modeling in
nanoscienceis shown in Figure 4.
Further information about the application of this method in
nanoscienceand Computational Codes programmed in Fortranfor students is available in the following external links.
* [http://www.nrbook.com/a/bookfpdf.php Numerical Recipes in Fortran 77]
* Payne et al , "Iterative minimization techniques for ab initio total-energy calculations: Molecular dynamics and conjugate gradients", "Reviews of Modern Physics" 64 (4), pp. 1045–1097. (1992)
* Atich et al, "Conjugate gradient minimization of the energy functional: A new method for electronic structure calculation", "Physical Review B" 39 (8), pp. 4997–5004, (1989)
* Chadi, "Energy-minimization approach to the atomic geometry of semiconductor surfaces", "Physical Review Letters" 41 (15), pp. 1062–1065 (1978)
Wikimedia Foundation. 2010.
Look at other dictionaries:
Energy engineering — is a broad field of engineering dealing with energy efficiency, energy services, facility management, plant engineering, environmental compliance and alternative energy technologies. Energy engineering projects often combine expertise from civil … Wikipedia
Energy drift — In molecular dynamics, orbit, and particle simulations, energy drift is the gradual change in the total energy of a closed system. According to the laws of mechanics, the energy should be a constant of motion and should not change. However, the… … Wikipedia
Principle of minimum energy — The principle of minimum energy is essentially a restatement of the second law of thermodynamics. It states that for a closed system, with constant external parameters and entropy, the internal energy will decrease and approach a minimum value at … Wikipedia
Waste-to-energy — (WtE) or energy from waste (EfW) refers to any waste treatment that creates energy in the form of electricity or heat from a waste source. Such technologies reduce or eliminate waste that otherwise would be transferred to a greenhouse gas… … Wikipedia
Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia
Chemical equilibrium — In a chemical reaction, chemical equilibrium is the state in which the concentrations of the reactants and products have not yet changed with time. It occurs only in reversible reactions, and not in irreversible reactions. Usually, this state… … Wikipedia
CHARMM — (Chemistry at HARvard Macromolecular Mechanics) is the name of a widely used set of force fields for molecular dynamics as well as the name for the molecular dynamics simulation and analysis package associated with them.cite journal | author =… … Wikipedia
Nucleic acid design — can be used to create nucleic acid complexes with complicated secondary structures such as this four arm junction. These four strands associate into this structure because it maximizes the number of correct base pairs, with A s matched to T s and … Wikipedia
Non-topological soliton — In quantum field theory, a non topological soliton (NTS) is a field configuration possessing, contrary to a topological one, a conserved Noether charge and stable against transformation into usual particles of this field for the following reason … Wikipedia
Force field (chemistry) — In the context of molecular mechanics, a force field (also called a forcefield) refers to the functional form and parameter sets used to describe the potential energy of a system of particles (typically but not necessarily atoms). Force field… … Wikipedia