On Wednesday 12 December 2007 18:24, William Stein wrote:
> Anyway, Yi just made this planet sage blog thing:
> http://sage.math.washington.edu/home/yqiang/psage/output/
> So I looked at it, and saw Martin Albrecht's blog posts, which I
> hadn't looked at before. Those led me to the Giac sit
On Dec 12, 2007 9:00 AM, Martin Albrecht <[EMAIL PROTECTED]> wrote:
>
> On Wednesday 12 December 2007, William Stein wrote:
> > On Dec 12, 2007 8:47 AM, Joel B. Mohler <[EMAIL PROTECTED]> wrote:
> > > On Wed, Dec 12, 2007 at 10:12:07AM -0600, Daniel R. Grayson wrote:
> > > > The Macaulay2 code for
On Wednesday 12 December 2007, William Stein wrote:
> On Dec 12, 2007 8:47 AM, Joel B. Mohler <[EMAIL PROTECTED]> wrote:
> > On Wed, Dec 12, 2007 at 10:12:07AM -0600, Daniel R. Grayson wrote:
> > > The Macaulay2 code for factorization just calls the Singular-Factory
> > > library that we link agai
On Dec 12, 2007 8:47 AM, Joel B. Mohler <[EMAIL PROTECTED]> wrote:
>
> On Wed, Dec 12, 2007 at 10:12:07AM -0600, Daniel R. Grayson wrote:
> > The Macaulay2 code for factorization just calls the Singular-Factory library
> > that we link against. So I don't know why it should be faster than
> > Si
On Wed, Dec 12, 2007 at 10:12:07AM -0600, Daniel R. Grayson wrote:
> The Macaulay2 code for factorization just calls the Singular-Factory library
> that we link against. So I don't know why it should be faster than Singular!
I did wonder about that. However, my testing indicates that M2 consist
The Macaulay2 code for factorization just calls the Singular-Factory library
that we link against. So I don't know why it should be faster than Singular!
> Date: Mon, 3 Dec 2007 07:47:14 -0800
> From: "William Stein" <[EMAIL PROTECTED]>
> To: sage-devel@googlegroups.com, [EMAIL PROTECTED],
>
The GCD is used in the first stage of any factoring algorithm, to find
the content (GCD of all the coefficients) and to factor into
squarefree factors (using GCD(f, f') where f' is the derivative).
But your example is special. The example you give can be factored by
hand in 5 minutes because ther
On Tuesday 04 December 2007 02:31, William Stein wrote:
> > I think we discussed this on the list before. For univariate you want
> > van hoeij's algorithm and for multivariate some variant of GCDHEU or
> > EZGCD.
> >
> > I think the algorithm Singular are using, EZGCD, is probably pretty
> > good
Good point! I am confusing the two issues somewhat.
The confusion arises in that there is an EZ-GCD and an EZ
factorisation algorithm, and EEZ-GCD and an EEZ factorisation
algorithm. In fact Magma uses a variant of the latter to factor
multivariate polynomials. The EEZ-GCD algorithm was derived b
Yes, indeed Magma does this.
Bill.
On 4 Dec, 02:52, "Stephen Forrest" <[EMAIL PROTECTED]> wrote:
> On Dec 3, 2007 8:53 PM, Bill Hart <[EMAIL PROTECTED]> wrote:
>
>
>
> > On 3 Dec, 17:15, "William Stein" <[EMAIL PROTECTED]> wrote:
>
> > > This is not so good, really. We should be aiming to beat
On Dec 3, 2007 5:53 PM, Bill Hart <[EMAIL PROTECTED]> wrote:
>
>
>
> On 3 Dec, 17:15, "William Stein" <[EMAIL PROTECTED]> wrote:
>
> > This is not so good, really. We should be aiming to beat maple/magma,
> > which do this factorization in 0.01 seconds or so. Where are our reverse
> > engineerin
On Dec 3, 2007 8:53 PM, Bill Hart <[EMAIL PROTECTED]> wrote:
>
> On 3 Dec, 17:15, "William Stein" <[EMAIL PROTECTED]> wrote:
>
> > This is not so good, really. We should be aiming to beat maple/magma,
> > which do this factorization in 0.01 seconds or so. Where are our reverse
> > engineering ex
On 3 Dec, 17:15, "William Stein" <[EMAIL PROTECTED]> wrote:
> This is not so good, really. We should be aiming to beat maple/magma,
> which do this factorization in 0.01 seconds or so. Where are our reverse
> engineering experts? How come Maple is so fast at this?
I think we discussed this
On Dec 3, 8:44 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> On Dec 3, 2007 11:39 AM, mabshoff
>
>
> > CoCoA or [Ap]CoCoALib? CoCoA is trivial to do, but it will be binary.
>
> I was thinking CoCoALib, sorry.
>
ok.
> > ApCoCoALib compiles out of the box on all of the above and more, but I
On Dec 3, 2007 11:39 AM, mabshoff
<[EMAIL PROTECTED]> wrote:
> On Dec 3, 8:32 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> > On Dec 3, 2007 11:15 AM, mabshoff
> > <[EMAIL PROTECTED]> wrote:
> > > On Dec 3, 7:49 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> > > > On Dec 3, 2007 10:08 AM, Joe
On Dec 3, 8:32 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> On Dec 3, 2007 11:15 AM, mabshoff
>
>
>
> <[EMAIL PROTECTED]> wrote:
> > On Dec 3, 7:49 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> > > On Dec 3, 2007 10:08 AM, Joel B. Mohler <[EMAIL PROTECTED]> wrote:
> > > > On Mon, Dec 03,
On Dec 3, 2007 11:15 AM, mabshoff
<[EMAIL PROTECTED]> wrote:
> On Dec 3, 7:49 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> > On Dec 3, 2007 10:08 AM, Joel B. Mohler <[EMAIL PROTECTED]> wrote:
> > > On Mon, Dec 03, 2007 at 09:19:38AM -0800, mabshoff wrote:
> > > > On Dec 3, 6:15 pm, "William St
On Dec 3, 7:49 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> On Dec 3, 2007 10:08 AM, Joel B. Mohler <[EMAIL PROTECTED]> wrote:
>
>
>
>
>
> > On Mon, Dec 03, 2007 at 09:19:38AM -0800, mabshoff wrote:
> > > On Dec 3, 6:15 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> > > > On Dec 3, 2007 8:
On Dec 3, 2007 10:08 AM, Joel B. Mohler <[EMAIL PROTECTED]> wrote:
>
> On Mon, Dec 03, 2007 at 09:19:38AM -0800, mabshoff wrote:
> > On Dec 3, 6:15 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> > > On Dec 3, 2007 8:56 AM, mabshoff
> > > <[EMAIL PROTECTED]> wrote:
> > > > Cpu time = 0.80, User t
On Mon, Dec 03, 2007 at 09:19:38AM -0800, mabshoff wrote:
> On Dec 3, 6:15 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> > On Dec 3, 2007 8:56 AM, mabshoff
> > <[EMAIL PROTECTED]> wrote:
> > > Cpu time = 0.80, User time = 1
> >
> > This is not so good, really.
>
> I know, but it seems to beat
> > We should be aiming to beat maple/magma,
> > which do this factorization in 0.01 seconds or so.
>
> I agree. But then there is the question of short vs. long term
> solutions.
>
> > Where are our reverse
> > engineering experts? How come Maple is so fast at this?
> >
Here's a new 2007 pape
On Dec 3, 6:15 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> On Dec 3, 2007 8:56 AM, mabshoff
>
>
>
> <[EMAIL PROTECTED]> wrote:
>
> > On Dec 3, 5:24 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> > > On Dec 3, 2007 8:01 AM, mabshoff
>
> > > <[EMAIL PROTECTED]> wrote:
>
> > > > On Dec 3, 4:
On Dec 3, 2007 8:56 AM, mabshoff
<[EMAIL PROTECTED]> wrote:
>
>
>
> On Dec 3, 5:24 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> > On Dec 3, 2007 8:01 AM, mabshoff
> >
> >
> >
>
> > <[EMAIL PROTECTED]> wrote:
> >
> > > On Dec 3, 4:47 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> > > > On Dec
On Dec 3, 5:24 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> On Dec 3, 2007 8:01 AM, mabshoff
>
>
>
> <[EMAIL PROTECTED]> wrote:
>
> > On Dec 3, 4:47 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> > > On Dec 3, 2007 7:04 AM, Joel B. Mohler <[EMAIL PROTECTED]> wrote:
>
> > > > I've been rese
On Dec 3, 2007 8:01 AM, mabshoff
<[EMAIL PROTECTED]> wrote:
>
>
>
> On Dec 3, 4:47 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> > On Dec 3, 2007 7:04 AM, Joel B. Mohler <[EMAIL PROTECTED]> wrote:
> >
> > > I've been researching this slow mpolynomial factorization a bit more and
> > > haven't c
On Dec 3, 4:47 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> On Dec 3, 2007 7:04 AM, Joel B. Mohler <[EMAIL PROTECTED]> wrote:
>
> > I've been researching this slow mpolynomial factorization a bit more and
> > haven't come up with any good news. Hans (from singular) replied to my
> > forum
On Dec 3, 2007 7:04 AM, Joel B. Mohler <[EMAIL PROTECTED]> wrote:
> I've been researching this slow mpolynomial factorization a bit more and
> haven't come up with any good news. Hans (from singular) replied to my forum
> post at
> http://singular.mathematik.uni-kl.de/forum/viewtopic.php?t=1652
>
27 matches
Mail list logo
