amazing!<div><br></div><div>im also in the same problematic but close to zero, 1^-10000, i have not tested yet but based on your experiments i guess i will have good results too</div><div>just being curious, did you paralelize ?<br>
<br><div class="gmail_quote">On Tue, Aug 10, 2010 at 4:35 PM, Stephen Montgomery-Smith <span dir="ltr"><<a href="mailto:stephen@missouri.edu">stephen@missouri.edu</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
Hi Guys,<br>
<br>
I just wrote some programs that use GiNaC to multiply polynomials whose degrees can get into the 1000's, and whose coefficients are as large as 10^10000. GiNaC performed extraordinarily well, and even went a little faster than Mathematica! I am very impressed!<br>
<br>
(If you are interested, I am trying to analyze results of Luria-Delbruck experiments using Bayesian statistics.)<br>
<br>
Stephen<br>
_______________________________________________<br>
GiNaC-list mailing list<br>
<a href="mailto:GiNaC-list@ginac.de" target="_blank">GiNaC-list@ginac.de</a><br>
<a href="https://www.cebix.net/mailman/listinfo/ginac-list" target="_blank">https://www.cebix.net/mailman/listinfo/ginac-list</a><br>
</blockquote></div><br></div>