Weak convergence of the periodic multiplicative Selmer algorithm
From MaRDI portal
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.
This page was built for publication: Weak convergence of the periodic multiplicative Selmer algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6212081)
