Difference between revisions of "PATHSAMPLE"
Jump to navigation
Jump to search
import>Ss2029 |
|||
| (6 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| − | A driver for OPTIM to create stationary point databases using discrete path sampling and perform kinetic analysis. PATHSAMPLE is |
+ | A driver for OPTIM to create stationary point databases using discrete path sampling and perform kinetic analysis. PATHSAMPLE is documented [http://www-wales.ch.cam.ac.uk/PATHSAMPLE.2.1.doc/ here]. |
== Tutorials == |
== Tutorials == |
||
| Line 10: | Line 10: | ||
* [[Finding an initial path between two end points (minima)]] |
* [[Finding an initial path between two end points (minima)]] |
||
* [[Adding partially finished OPTIM stationary points to a PATHSAMPLE database]] |
* [[Adding partially finished OPTIM stationary points to a PATHSAMPLE database]] |
||
| − | * [[Optimising a path]] |
+ | * [[Optimising a path]] -- SHORTCUT, UNTRAP and FREEPAIRS |
* [[Calculating rate constants (GT and fastest path)]] |
* [[Calculating rate constants (GT and fastest path)]] |
||
* [[Calculating rate constants (SGT, DGT, and SDGT)]] |
* [[Calculating rate constants (SGT, DGT, and SDGT)]] |
||
| Line 19: | Line 19: | ||
* [[If you lost file min.data, but still you have points.min]] |
* [[If you lost file min.data, but still you have points.min]] |
||
* [[path.info file is not read, causes PATHSAMPLE to die]] |
* [[path.info file is not read, causes PATHSAMPLE to die]] |
||
| − | * [[BLJ60 example setup]] |
||
* [[BLJ60 example input]] |
* [[BLJ60 example input]] |
||
Latest revision as of 11:33, 14 May 2019
A driver for OPTIM to create stationary point databases using discrete path sampling and perform kinetic analysis. PATHSAMPLE is documented here.
Tutorials
These tutorials are under development. Please correct any mistakes you find and, of course, feel free to add more!
- Adding a model for PATHSAMPLE
- List of output files for PATHSAMPLE
- Loading OPTIM's min.data.info files into PATHSAMPLE
- Using BHINTERP to find minima between two end points
- Finding an initial path between two end points (minima)
- Adding partially finished OPTIM stationary points to a PATHSAMPLE database
- Optimising a path -- SHORTCUT, UNTRAP and FREEPAIRS
- Calculating rate constants (GT and fastest path)
- Calculating rate constants (SGT, DGT, and SDGT)
- Removing minima and transition states from the database
- Relaxing existing minima with new potential and creating new database
- Relaxing existing transition states with new potential and creating new database
- If things go wrong...
- If you lost file min.data, but still you have points.min
- path.info file is not read, causes PATHSAMPLE to die
- BLJ60 example input