Weak convergence of the periodic multiplicative Selmer algorithm
arXiv:0812.4266 · doi:10.1515/integ.2011.080
Abstract
In order to prove weak convergence of the periodic multiplicative Selmer algorithm we ensure that the periodicity matrix is positive and establish a relation between its entries and eigenvalues. Since we can imply that the limit of these relations exist, we arrive at the desired result.
22 pages, 1 figure