arXiv · 0812.4266
Weak convergence of the periodic multiplicative Selmer algorithm
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.
Explore related subjects
Keep this discovery
J. Christopher Kops. 2008-12-22. Weak convergence of the periodic multiplicative Selmer algorithm. https://doi.org/10.1515/integ.2011.080
Cite the original work for its findings. Save a collection to share your selection of sources.