2008-11-15, 09:42 | #1 |
Oct 2008
2×7 Posts |
About random number (random seed) in Msieve
Hello!
I have question about Block Lanczos algorithm (Montgomery) : As i know during run Block Lanczos algorithm - we select random a matrix Y (size nxN, N = 64), therefore we use this matrix to run Block Lanczos algorithm. So i want to ask: Can we know matrix Y that we initialized is best to run Block Lanczos algorithm? (I mean: if we use matrix Y, we always run Block Lanczos algorithm success.) And oppose, can we know matrix Y is bad to run Block Lanczos algorithm? (if we use bad matrix Y, Block Lanczos algorithm can fail!). Thank for your reading. |
2008-11-15, 13:56 | #2 |
Tribal Bullet
Oct 2004
DCE_{16} Posts |
Block Lanczos only works with high probability, and the most that anyone has proved is that failure is extremely rare when the initial vector is chosen randomly. There is no way to tell when failure will happen, otherwise proving convergence would not be an interesting problem :)
More here |
Thread Tools | |
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
random comments, random questions and thread titles made for Google | jasong | Lounge | 46 | 2017-05-09 12:32 |
odds of random number being prime | jasong | jasong | 32 | 2009-12-01 06:43 |
Odds that a random number is prime | Number theory | Homework Help | 4 | 2009-08-28 22:04 |
Random number thread - poll | 10metreh | Factoring | 13 | 2008-11-13 07:06 |
Odds of a prime number being random | Orgasmic Troll | Lounge | 6 | 2007-08-11 04:09 |