algorithms:main
Differences
This shows you the differences between two versions of the page.
Next revision | Previous revision | ||
algorithms [2013/02/28 13:28] – created daniel | algorithms:main [2018/01/10 18:01] (current) – daniel | ||
---|---|---|---|
Line 1: | Line 1: | ||
- | __NOTOC__ | + | ~~NOTOC~~ |
+ | ====== Algorithms ====== | ||
+ | ---- | ||
+ | This page is a quote from the [[http:// | ||
+ | ---- | ||
- | {{Infobox | + | === Force Matching |
- | |bodystyle | + | |
- | |titlestyle | + | |
- | |headerstyle = | + | |
- | |labelstyle | + | |
- | |datastyle | + | |
- | |image | + | |
- | |imagestyle | + | |
- | |headerstyle | + | |
- | + | ||
- | |datastyle | + | |
- | |header1 = This page is a quote. | + | |
- | |header2 = | + | |
- | |data2 = [http:// | + | |
- | }} | + | |
- | {{Infobox | + | |
- | |bodystyle | + | |
- | |titlestyle | + | |
- | |headerstyle = | + | |
- | |labelstyle | + | |
- | |datastyle | + | |
- | |image | + | |
- | |header1 = | + | |
- | |data1 = This work is licensed under a Creative Commons Attribution-ShareAlike 3.0 Unported License. | + | |
- | }} | + | |
- | + | ||
- | == Force Matching == | + | |
As described above, classical MD calculations require effective potentials, | As described above, classical MD calculations require effective potentials, | ||
Line 47: | Line 25: | ||
approach, where only few parameters can be determined reliably. | approach, where only few parameters can be determined reliably. | ||
- | The method of including forces from ab-initio calculations in the | + | The method of including forces from ab-initio calculations in the potential generation |
- | potential generation is called | + | is called |
- | Adams<ref>Ercolessi, F. and Adams, J. B.: Interatomic Potentials from First-Principles Calculations: | + | ((Ercolessi, F. and Adams, J. B.: Interatomic Potentials from First-Principles Calculations: |
- | potential for Aluminium. In the following section, this method is described in | + | where it was used to determine a glue potential for Aluminium. In the following section, |
- | detail. | + | this method is described in detail. |
To determine a potential with force matching one needs first a potential | To determine a potential with force matching one needs first a potential | ||
- | model, where the potential is given by a set of '' | + | model, where the potential is given by a set of $n$ parameters |
These parameters might be the values of the potential functions at sampling | These parameters might be the values of the potential functions at sampling | ||
- | points or parameters of an analytic potential. This set < | + | points or parameters of an analytic potential. This set $\boldsymbol\xi$ is then |
adjusted to optimally reproduce quantities calculated from DFT in a number of | adjusted to optimally reproduce quantities calculated from DFT in a number of | ||
reference calculations. This optimisation is realised by minimising the sum of | reference calculations. This optimisation is realised by minimising the sum of | ||
Line 63: | Line 41: | ||
The function to be minimised is the so-called target | The function to be minimised is the so-called target | ||
- | function | + | function |
- | < | + | $$Z(\boldsymbol\xi)=Z_{F}(\boldsymbol\xi)+Z_{C}, |
where | where | ||
- | < | + | $$Z_{F}(\boldsymbol\xi)=\sum_{k=1}^{m}u_{k}(F_{k}(\boldsymbol\xi)-F^{0}_{k})^{2}, |
- | < | + | $$Z_{C}(\boldsymbol\xi)=\sum_{r=1}^{N_{c}}w_{r}(A_{r}(\boldsymbol\xi)-A^{0}_{r})^{2}.$$ |
- | Here, the index '' | + | Here, the index $k$ in $Z_{F}$, the sum of reference contributions to the |
target function, runs over all reference information, | target function, runs over all reference information, | ||
cohesive energies, force vector components or entries of the stress tensor. | cohesive energies, force vector components or entries of the stress tensor. | ||
- | < | + | $F^{0}_{k}$ are the reference values and $F_{k}(\boldsymbol\xi)$ the |
- | corresponding values calculated from the potential, and the < | + | corresponding values calculated from the potential, and the $u_{k}$ are the |
- | weights attached to each contribution to < | + | weights attached to each contribution to $Z_{F}$. Additional minimisation |
- | criteria are accounted for in < | + | criteria are accounted for in $Z_{C}$, where $A_{r}(\boldsymbol\xi)$ is the actual and |
- | < | + | $A^{0}_{r}$ the nominal value of a quantity, the importance of which is |
- | controlled by the weights | + | controlled by the weights |
to implement constraints on the potential functions, like for example fixing | to implement constraints on the potential functions, like for example fixing | ||
the gauge degrees of freedom of glue potentials (see Sec. 2.2.2, Eq. (2.38)). | the gauge degrees of freedom of glue potentials (see Sec. 2.2.2, Eq. (2.38)). | ||
- | The target function | + | The target function |
evaluation of the target function is quite costly, the algorithms used must be | evaluation of the target function is quite costly, the algorithms used must be | ||
efficient to reduce computing time. A selection of suitable algorithms is | efficient to reduce computing time. A selection of suitable algorithms is | ||
Line 92: | Line 70: | ||
2.3.3 elaborates on this topic. | 2.3.3 elaborates on this topic. | ||
- | == Optimisation == | + | === Optimisation === |
Few mathematical topics have such a widespread effect on many subjects in | Few mathematical topics have such a widespread effect on many subjects in | ||
science and engineering like optimisation. Finding the optimal | science and engineering like optimisation. Finding the optimal | ||
Line 102: | Line 81: | ||
For quantitative treatment of an optimisation problem one defines a target | For quantitative treatment of an optimisation problem one defines a target | ||
- | function | + | function |
- | conditions, function parameters, | + | conditions, function parameters, |
generality, the minimum of the target function solves the optimisation | generality, the minimum of the target function solves the optimisation | ||
problem, thereby reducing it to minimising a function of several variables -- | problem, thereby reducing it to minimising a function of several variables -- | ||
a well-known task with many well-documented algorithms. | a well-known task with many well-documented algorithms. | ||
- | == < | + | ---- |
- | In older versions of '' | + | === compat-mode === |
- | < | + | In older versions of //potfit// the error sum has been calculated as |
- | This behaviour can still be enabled by setting the < | + | $$Z_{F}(\boldsymbol\xi)=\sum_{k=1}^{m}[u_{k}(F_{k}(\boldsymbol\xi)-F^{0}_{k})]^2.$$ |
- | = Algorithms available in '' | + | This behaviour is no longer supported. The '' |
+ | |||
+ | ==== Algorithms available in potfit | ||
Currently there are three optimization algorithms available: | Currently there are three optimization algorithms available: | ||
- | # [[Simulated Annealing]] | + | - [[algorithms: |
- | # [[Differential Evolution]] | + | |
- | # [[Method of Least Squares]] (conjugate gradients) | + | |
Usually two of them are run subsequently, | Usually two of them are run subsequently, | ||
Differential Evolution may run into troubles with tabulated potentials but works fine for analytic ones. | Differential Evolution may run into troubles with tabulated potentials but works fine for analytic ones. | ||
- | |||
- | ----- | ||
- | |||
- | < | ||
- |
algorithms/main.1362054491.txt.gz · Last modified: 2013/02/28 13:28 by daniel