![]() |
|
|
#122 |
|
Jul 2003
So Cal
2×34×13 Posts |
Yes, you are right. I got these two threads confused.
|
|
|
|
|
|
#123 |
|
Apr 2010
Over the rainbow
1010001010002 Posts |
When i'm working on -nps of frmky, I sometime get the line
Code:
poly 12000048 376871999634151963 54459810153912782101909120209246657 poly 12000048 550823574178211821 54459810153912781740531311604282959 line minimize failed poly 12000048 483290353796105167 54459810153912782069489787201019936 poly 12000048 330555862632842411 54459810153912781975255654553967780 |
|
|
|
|
|
#124 |
|
Tribal Bullet
Oct 2004
DD516 Posts |
It means the size optimization on that particular example was numerically unstable enough that the optimization gave up and used the current output as the answer. Probably it isn't good enough though.
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Polynomial Discriminant is n^k for an n-1 degree polynomial | carpetpool | Miscellaneous Math | 14 | 2017-02-18 19:46 |
| Help choosing motherboard please. | Flatlander | GPU Computing | 4 | 2011-01-26 08:15 |
| Choosing the best CPU for sieving | siew | Factoring | 14 | 2010-02-27 10:07 |
| MPQS: choosing a good polynomial | ThiloHarich | Factoring | 4 | 2006-09-05 07:51 |
| Choosing amount of memory | azhad | Software | 2 | 2004-10-16 16:41 |