Fast computation and convergence analysis of the infinite-product representation of the Schottky--Klein prime function
Abstract
The Schottky--Klein prime function is a standard tool for boundary-value problems on multiply connected circular domains. Because this function is represented as an infinite product over a Schottky group, numerical evaluation requires truncation to finitely many factors. The standard word-length truncation grows exponentially in cost and becomes inefficient when the boundary circles nearly touch one another or the unit circle. To address this difficulty, we assign to each group element a cross-ratio potential measuring the size of its contribution, and retain only terms below a prescribed threshold. We establish uniform closed-form bounds on the change in this potential when prepending Schottky-group generators, and from these bounds we derive an efficient enumeration algorithm. The resulting relative error decays exponentially with the threshold at a rate determined by the Hausdorff dimension of the limit set of the Schottky group. Numerical experiments demonstrate that the proposed formulation achieves substantial computational speedups over word-length truncation in challenging geometric configurations.
Related
- Simplifying the computation of weak-⋆ second subderivatives of convex functionals via Γ-convergence
- An infinite-dimensional representation of Ray-Knight theorems for the Bass-Burdzy flow
- Convergence of Random Products of Projections Under Infinite-Periodic Selections
- Well-Posedness and Strong Convergence of Infinite-Dimensional Port-Hamiltonian Primal-Dual Gradient Dynamics
- Convergence of a Critical Multitype Branching Particle System with Mixed Finite and Infinite Mean Lifetimes
BibTeX
@misc{yamamoto2026fast,
title = {{Fast computation and convergence analysis of the infinite-product representation of the Schottky--Klein prime function}},
author = {Shuntaro Yamamoto and Hiroyuki Miyoshi},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.00785},
eprint = {2609.00785},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.00785},
}
RIS
TY - UNPB
TI - Fast computation and convergence analysis of the infinite-product representation of the Schottky--Klein prime function
AU - Shuntaro Yamamoto
AU - Hiroyuki Miyoshi
PY - 2026
DA - 2026/09/01
PB - arXiv
DO - 10.48550/arxiv.2609.00785
UR - https://arxiv.org/abs/2609.00785
AB - The Schottky--Klein prime function is a standard tool for boundary-value problems on multiply connected circular domains. Because this function is represented as an infinite product over a Schottky group, numerical evaluation requires truncation to finitely many factors. The standard word-length truncation grows exponentially in cost and becomes inefficient when the boundary circles nearly touch one another or the unit circle. To address this difficulty, we assign to each group element a cross-ratio potential measuring the size of its contribution, and retain only terms below a prescribed threshold. We establish uniform closed-form bounds on the change in this potential when prepending Schottky-group generators, and from these bounds we derive an efficient enumeration algorithm. The resulting relative error decays exponentially with the threshold at a rate determined by the Hausdorff dimension of the limit set of the Schottky group. Numerical experiments demonstrate that the proposed formulation achieves substantial computational speedups over word-length truncation in challenging geometric configurations.
ER -