potfit wiki

open source force-matching

User Tools

Site Tools

algorithms:main

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
algorithms [2013/08/21 11:03] – remove compat mode danielalgorithms:main [2018/01/10 18:01] (current) – daniel
Line 86: Line 86:
 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.
 +
 +----
  
 === compat-mode === === compat-mode ===
Line 98: Line 100:
  
 Currently there are three optimization algorithms available: Currently there are three optimization algorithms available:
-  - [[Simulated Annealing]] +  - [[algorithms:simann|Simulated Annealing]] 
-  - [[Differential Evolution]] +  - [[algorithms:diffevo|Differential Evolution]] 
-  - [[Method of Least Squares]] (conjugate gradients)+  - [[algorithms:lsq|Method of least squares]] (conjugate gradients)
  
 Usually two of them are run subsequently, with the choice between 1 and 2, while 3 is always run. Simulatead Annealing can be used for both tabulated and analytic potentials, Usually two of them are run subsequently, with the choice between 1 and 2, while 3 is always run. Simulatead Annealing can be used for both tabulated and analytic potentials,
 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.1377075831.txt.gz · Last modified: 2013/08/21 11:03 by daniel