/usr/share/python-ase/doc/ase/neb.rst is in python-ase-doc 3.9.1.4567-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 | ===================
Nudged elastic band
===================
.. module:: ase.neb
:synopsis: Nudged Elastic Band method.
The Nudged Elastic Band method is a technique for finding transition paths
(and corresponding energy barriers) between given initial and final states.
The method involves constructing a "chain" of "replicas" or "images" of the
system and relaxing them in a certain way.
Relevant literature References:
1. H. Jonsson, G. Mills, and K. W. Jacobsen, in 'Classical and Quantum
Dynamics in Condensed Phase Systems', edited by B. J. Berne,
G. Cicotti, and D. F. Coker, World Scientific, 1998 [standard
formulation]
2. 'Improved Tangent Estimate in the NEB method for Finding Minimum
Energy Paths and Saddle Points', G. Henkelman and H.
Jonsson, J. Chem. Phys. 113, 9978 (2000) [improved tangent
estimates]
3. 'A Climbing-Image NEB Method for Finding Saddle Points and Minimum
Energy Paths', G. Henkelman, B. P. Uberuaga and H.
Jonsson, J. Chem. Phys. 113, 9901 (2000)
4. 'Improved initial guess for minimum energy path calculations.',
S. Smidstrup, A. Pedersen, K. Stokbro and H. Jonsson,
J. Chem. Phys. 140, 214106 (2014)
The NEB class
=============
This module defines one class:
.. autoclass:: NEB
Example of use, between initial and final state which have been previously
saved in A.traj and B.traj::
from ase import io
from ase.neb import NEB
from ase.optimize import MDMin
# Read initial and final states:
initial = io.read('A.traj')
final = io.read('B.traj')
# Make a band consisting of 5 images:
images = [initial]
images += [initial.copy() for i in range(3)]
images += [final]
neb = NEB(images)
# Interpolate linearly the potisions of the three middle images:
neb.interpolate()
# Set calculators:
for image in images[1:4]:
image.set_calculator(MyCalculator(...))
# Optimize:
optimizer = MDMin(neb, trajectory='A2B.traj')
optimizer.run(fmax=0.04)
Be sure to use the copy method (or similar) to create new instances
of atoms within the list of images fed to the NEB. Do *not* use something
like [initial for i in range(3)], as it will only create references to
the original atoms object.
Notice the use of the :meth:`~NEB.interpolate` method to obtain an
initial guess for the path from A to B.
Interpolation
=============
.. method:: NEB.interpolate()
Interpolate path linearly from initial to final state.
.. method:: NEB.interpolate('idpp')
From a linear interpolation, create an improved path
from initial to final state using the IDPP approach [4].
.. method:: NEB.idpp_interpolate()
Generate an idpp pathway from a set of images. This differs
from above in that an initial guess for the IDPP, other than
linear interpolation can be provided.
Only the internal images (not the endpoints) need have
calculators attached.
.. seealso::
:mod:`ase.optimize`:
Information about energy minimization (optimization). Note that you
cannot use the default optimizer, BFGSLineSearch, with NEBs. (This is
the optimizer imported when you import QuasiNewton.) If you would
like a quasi-newton optimizer, use BFGS instead.
:mod:`ase.calculators`:
How to use calculators.
:ref:`tutorials`:
* :ref:`diffusion_tutorial`
* :ref:`neb2`
* :ref:`idpp_tutorial`
.. note::
If there are `M` images and each image has `N` atoms, then the NEB
object behaves like one big Atoms object with `MN` atoms, so its
:meth:`~ase.atoms.Atoms.get_positions` method will return a `MN \times 3`
array.
Trajectories
============
The code::
from ase.optimize import BFGS
optimizer = BFGS(neb, trajectory='A2B.traj')
will write all images to one file. The Trajectory object knows about
NEB calculations, so it will write `M` images with `N` atoms at every
iteration and not one big configuration containing `MN` atoms.
The result of the latest iteration can now be analysed with this
command: :command:`ase-gui A2B.traj@-5:`.
For the example above, you can write the images to individual
trajectory files like this::
for i in range(1, 4):
qn.attach(io.PickleTrajectory('A2B-%d.traj' % i, 'w', images[i]))
The result of the latest iteration can be analysed like this:
.. highlight:: bash
::
$ ase-gui A.traj A2B-?.traj B.traj -n -1
.. highlight:: python
Restarting
==========
Restart the calculation like this::
images = io.read('A2B.traj@-5:')
Climbing image
==============
The "climbing image" variation involves designating a specific image to behave
differently to the rest of the chain: it feels no spring forces, and the
component of the potential force parallel to the chain is reversed, such that
it moves towards the saddle point. This depends on the adjacent images
providing a reasonably good approximation of the correct tangent at the
location of the climbing image; thus in general the climbing image is not
turned on until some iterations have been run without it (generally 20% to 50%
of the total number of iterations).
To use the climbing image NEB method, instantiate the NEB object like this::
neb = NEB(images, climb=True)
.. note::
Quasi-Newton methods, such as BFGS, are not well suited for climbing image
NEB calculations. FIRE have been known to give good results, although
convergence is slow.
Parallelization over images
===========================
Some calculators can parallelize over the images of a NEB calculation.
The script will have to be run with an MPI-enabled Python interpreter
like GPAW_'s gpaw-python_. All images exist on all processors, but
only some of them have a calculator attached::
from ase.parallel import rank, size
from ase.calculators.emt import EMT
# Number of internal images:
n = len(images) - 2
j = rank * n // size
for i, image in enumerate(images[1:-1]):
if i == j:
image.set_calculator(EMT())
Create the NEB object with ``NEB(images, parallel=True)`` and let the
master processes write the images::
if rank % (size // n) == 0:
traj = io.PickleTrajectory('neb%d.traj' % j, 'w', images[1 + j],
master=True)
optimizer.attach(traj)
For a complete example using GPAW_, see here_.
.. _GPAW: http://wiki.fysik.dtu.dk/gpaw
.. _gpaw-python: https://wiki.fysik.dtu.dk/gpaw/documentation/manual.html#parallel-calculations
.. _here: https://wiki.fysik.dtu.dk/gpaw/tutorials/neb/neb.html
.. _nebtools:
Analysis of output
==================
A class exists to help in automating the analysis of NEB jobs. See the :ref:`Diffusion Tutorial <diffusion_tutorial>` for some examples of its use.
.. autoclass:: NEBtools
:members:
|