Computer Physics Communications Program LibraryPrograms in Physics & Physical Chemistry |

[Licence| Download | New Version Template] aeyr_v1_0.tar.gz(152 Kbytes) | ||
---|---|---|

Manuscript Title: corr3p_tr: A particle approach for the three-body problem | ||

Authors: S. Edvardsson, Kristoffer Karlsson, H. Olin | ||

Program title: corr3p_tr | ||

Catalogue identifier: AEYR_v1_0Distribution format: tar.gz | ||

Journal reference: Comput. Phys. Commun. 200(2016)259 | ||

Programming language: ANSI C. | ||

Computer: Linux 64bit PC. | ||

Operating system: Linux 64bit. | ||

RAM: 300 M bytes | ||

Keywords: Second order dynamical system, Schrödinger Equation, mass polarization, correlation, exotic atoms, S-states. | ||

PACS: 31.15.Fx, 31.25.-v, 31.25.Eb, 31.25.Jf. | ||

Classification: 2.7, 2.8, 2.9. | ||

Nature of problem:The Schrödinger equation for an arbitrary three-particle system is solved using finite differences and a fast particle method for the eigenvalue problem [15]. | ||

Solution method:A fast eigensolver is applied (see Appendix). This solver works for both symmetrical and nonsymmetrical matrices (which opens up for more accurate nonsymmetrical finite difference expressions to be applied at the boundaries). The three-particle Schrödinger equation is transformed in two major steps. First step is to introduce the function Q (r, where μ = cos (0_{1}, r_{2}, μ) = r_{1}r_{2} (1 - μ^{2}) φ (r_{1}, r_{2}, μ)_{12}). The cusps (r are then transformed into boundary conditions. The derivatives of _{1} = r_{2}, μ = 1)Q are then continuous in the whole computational space and thus the finite difference expressions are well defined. Three-particle coalescence (r is treated in the same way. The second step is to replace _{1} = r_{2} = 0, μ)Q (r with (2√_{1}, r_{2}, μ)x)_{1}x_{2}^{-1} Q (x. The space _{1}, x_{2}, μ)(x) is much more appropriate for a finite difference approach since the square roots _{1}, x_{2}, μx allow the boundaries to be much further out. The non-linearity of the _{1} = √r_{1}, x_{2} = √r_{2}x-grid also leads to a finer description near the nucleus and a coarser one further out thus resulting in a saving of grid points. Also, in contrast to the usual variable r_{12}, we have instead used μ which is an independent variable. This simplifies the mathematics and numerical treatments.
Several different grids can naturally run completely independent of each other thus making parallel computations trivial. From several grid results the physical property of interest is extrapolated to continuum space. The extrapolations are made in a matlab m-script where all computations can be made symbolically so the loss of decimal figures are minimized during this process. The computer code, including correlation effects and mass polarization, is highly optimized and deals with either triangular or quadratic domains in (x._{1}, x_{2}) | ||

Restrictions:The amount of CPU time may become unreasonable for states needing boundary conditions very far beyond the origin. Also if the condition number of the corresponding Hamiltonian matrix is very high, the number of iterations will grow. The use of double precision computations also puts a limit on the accuracy of extrapolated results to about 6-7 decimal figures. | ||

Unusual features:The numerical solver is based on a particle method presented in [15,16,26]. In the Appendix we provide specific details of dealing with eigenvalue problems. The program uses a 64bit environment (Linux 64bit). Parallel runs can be made conveniently through a simple bash script. | ||

Additional comments:The discretized wavefunction is complete on every given grid. New interactions can therefore conveniently be added to the Hamiltonian without the need to seek for an appropriate basis set. | ||

Running time:Given a modern CPU such as Intel core i5 and that the outer boundary conditions of r and _{1}r is limited to, say 16 atomic units, the total CPU time of totally 10 grids of a serial run is typically limited to a few minutes. One can then expect about 6-7 correct figures in the extrapolated eigenvalue. A single grid of say _{2}h converges in less than 1 s (with an error in the eigenvalue of about 1 percent). Parallel runs are possible and can further minimize CPU times for more demanding tasks._{1} = h_{2} = h_{3} = 1/16 | ||

References: | ||

[15] | S. Edvardsson, M. Gulliksson, and J. Persson. J. Appl. Mech. ASME, 79:021012, 2012. | |

[16] | S. Edvardsson, M. Neuman, P. Edstrom, and H. Olin. Solving equations through particle dynamics. Submitted to Comp. Phys. Commun., 2015. | |

[26] | M. Gulliksson, S. Edvardsson, and A. Lind. http://arxiv.org/abs/1303.5317, 2013. |

Disclaimer | ScienceDirect | CPC Journal | CPC | QUB |