Converging on bound states in coupled-channel calculations
Abstract
We develop a robust algorithm for locating bound states in coupled-channel calculations. Bound states exist at energies where an individual eigenvalue of a log-derivative or ratio matching matrix passes through zero. We describe an algorithm to identify the required eigenvalue of the matching matrix over the full range of energy where it exists. This allows much simpler programming than previous methods. We also consider the choice of the matching distance $R_\textrm{match}$, where the matching ...
Description / Details
We develop a robust algorithm for locating bound states in coupled-channel calculations. Bound states exist at energies where an individual eigenvalue of a log-derivative or ratio matching matrix passes through zero. We describe an algorithm to identify the required eigenvalue of the matching matrix over the full range of energy where it exists. This allows much simpler programming than previous methods. We also consider the choice of the matching distance , where the matching matrix is defined; coupled-channel methods are most efficient if is chosen to be in the classically allowed region for all channels that support bound states of interest, but not very close to a node in the wavefunction.
Source: arXiv:2606.26069v1 - http://arxiv.org/abs/2606.26069v1 PDF: https://arxiv.org/pdf/2606.26069v1 Original Link: http://arxiv.org/abs/2606.26069v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Jun 25, 2026
Chemistry
Chemistry
0