Papers › Pole-fitting for complex functions: enhancing standard techniques by...
Pole-fitting for complex functions: enhancing standard techniques by artificial-neural-network classifiers and regressors
S. Kaidisch, T. U. Hilger, A. Krassnigg, W. Lucha
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Motivated by a use case in theoretical hadron physics, we revisit an application of a pole-sum fit to dressing functions of a confined quark propagator. More precisely, we investigate approaches to determine the number and positions of the singularities closest to the origin for a function that is only known numerically on a specific finite grid of values on the positive real axis. For this problem, we compare the efficiency of standard techniques, like the Levenberg-Marquardt algorithm, to a pure artificial-neural-network approach as well as a combination of these two. This combination is more efficient than any of the two techniques separately. Such an approach is generalizable to similar situations, where the positions of poles of a function in a complex variable must be quickly and reliably estimated from real-axis information alone.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections