Weak convergence of the periodic multiplicative Selmer algorithm

Mathematics – Number Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

22 pages, 1 figure

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Weak convergence of the periodic multiplicative Selmer algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Weak convergence of the periodic multiplicative Selmer algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Weak convergence of the periodic multiplicative Selmer algorithm will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-539554

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.