On Jan 24, 1:24 am, Bill Hart wrote:
> Here are the times for the other GCD's on Magma on the Opteron 2.4Ghz:
>
> 2D:
>
> 0.00089s
> 0.00374s
> 0.0256s
> 0.08549s
>
> 3D:
>
> 0.00185s
> 0.0069s
> 0.05491s
>
> 4D:
>
> 0.006s
> 0.028s
> 0.071s
>
> I don't have giac times on the Opteron to compare
I think we should use chinese remainder to work in smaller groups.
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to
sage-devel-unsubscr...@googlegroups.com
For more options, visit t
On Sat, Jan 24, 2009 at 1:59 AM, YannLC wrote:
>
> I think we should use chinese remainder to work in smaller groups.
Huh?
William
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email t
To make it clearer, use Pohlig-Hellman algorithm
http://en.wikipedia.org/wiki/Pohlig-Hellman_algorithm
On Jan 24, 11:05 am, William Stein wrote:
> On Sat, Jan 24, 2009 at 1:59 AM, YannLC wrote:
>
> > I think we should use chinese remainder to work in smaller groups.
>
> Huh?
>
> William
--~--
mabshoff wrote:
>
>
> On Jan 23, 2:58 pm, Jaap Spies wrote:
>
> Hi Jaap,
>
>> Alex Ghitza wrote:
>>> Upgrading from sage-3.3.alpha0 went smoothly and passed all tests except the
>>> known toy_d_basis.py, on:
>> Same here on Fedora 9, Fedora 10 and Ubuntu 8.10 32 bits.
>
> Good. Was that an u
On Sat, Jan 24, 2009 at 5:18 AM, Sage wrote:
> #4457: [with patch, needs review] tutorial: add find_root() to "2.4.1 Solving
> Equations"
> ---+
> Reporter: dhbradshaw |Owner: mhansen
> Type: enhancement
2009/1/24 mabshoff :
>
>
>
> On Jan 23, 1:51 pm, John Cremona wrote:
>
> Hi John,
>
>> I tried sage-upgarde from a successful build from source of
>> 3.3.alpha0. Seemed to work ok but the banner and version() still say
>> 3.3.alpha0. Same after applying the suggested fix
>> athttp://wiki.sagem
On Jan 24, 6:43 am, John Cremona wrote:
> 2009/1/24 mabshoff :
>
>
>
>
>
> > On Jan 23, 1:51 pm, John Cremona wrote:
>
> > Check the local/bin repo for two heads and merge merge. This should
> > fix the problem.
>
> In local/bin I see
>
> j...@ubuntu%hg heads
> changeset: 1085:26c569d78f0a
>
I wrote a trac ticket #5088 , and there is a patch waiting for review
(based on 3.2.3). We can now compute discrete logs in GF(2**63)
lightning fast.
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this grou
timings added
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to
sage-devel-unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-deve
A few comments about numerical solutions. Users will want to know the
numerical method that is being used. Also, there are two ways to
define the equation bein solved:
#Sage expression
find_root(sin(x)-cos(x), 0, pi)
#Python function
find_root(lambda x: sin(x)-cos(x), 0, pi)
The second is subst
On Sat, Jan 24, 2009 at 11:46 AM, Luiz Felipe Martins
wrote:
>
> A few comments about numerical solutions. Users will want to know the
> numerical method that is being used. Also, there are two ways to
> define the equation bein solved:
>
> #Sage expression
> find_root(sin(x)-cos(x), 0, pi)
>
> #
Let me follow up on this discussion:
I looked at some papers on computing simplicial homology (including
what seems like a pretty nice one by Dumas, Heckenbach, Saunders, and
Welker, the authors of a GAP package for homology computations).
These papers are all focused on Smith normal form, which
I have some code which is producing a bad matrix, and I need some help
figuring out what's going on.
Say the matrix is 'd'.
sage: d.base_ring()
Finite Field of size 2
sage: d.nrows()
0
sage: d.ncols()
0
sage: d.rank()
1
I can get another 0x0 matrix, this one over GF(3), for which the rank
funct
On Jan 24, 2009, at 8:46 AM, Luiz Felipe Martins wrote:
> A few comments about numerical solutions. Users will want to know the
> numerical method that is being used. Also, there are two ways to
> define the equation bein solved:
>
> #Sage expression
> find_root(sin(x)-cos(x), 0, pi)
>
> #Python
On Jan 24, 2009, at 1:57 PM, Robert Bradshaw wrote:
> On Jan 24, 2009, at 8:46 AM, Luiz Felipe Martins wrote:
>
>> A few comments about numerical solutions. Users will want to know the
>> numerical method that is being used. Also, there are two ways to
>> define the equation bein solved:
>>
>> #S
On Sat, Jan 24, 2009 at 1:57 PM, Robert Bradshaw
wrote:
>
> On Jan 24, 2009, at 8:46 AM, Luiz Felipe Martins wrote:
>
>> A few comments about numerical solutions. Users will want to know the
>> numerical method that is being used. Also, there are two ways to
>> define the equation bein solved:
>>
On Jan 23, 2009, at 03:00 , mabshoff wrote:
>
> Hello folks,
>
> here goes alpha1 with another massive amount of fixes. No details from
> me since I need to get some sleep, but overall 113 tickets have been
> fixed in 3.3 for now. Tomorrow's SD12 seesion will concentrate on
> reviews, so expect
On Jan 24, 2009, at 3:01 PM, William Stein wrote:
> On Sat, Jan 24, 2009 at 1:57 PM, Robert Bradshaw
> wrote:
>>
>> On Jan 24, 2009, at 8:46 AM, Luiz Felipe Martins wrote:
>>
>>> A few comments about numerical solutions. Users will want to know
>>> the
>>> numerical method that is being used.
Hi all,
So last night, inspired by Martin Albrecht and Opera, I made two new
search plugins for Firefox. You can read about them here:
http://wiki.sagemath.org/firefox-trac
Here's what it does: once these are set up, just type "t 1000" into
the address bar to go immediately to trac ticket #1000
I tried doing the following:
sage: p = Primes()
sage: p??
and it hangs. So after 4-5 seconds I hit Ctrl-C, at which point it
shows me what I want.
But then I tried again and let it sit for longer. It started using
100% of my CPU. After 30s or so, I hit Ctrl-C and it gave me a
Traceback. See bel
On Fri, Jan 23, 2009 at 7:12 PM, Nick Alexander wrote:
>
>
> On 23-Jan-09, at 7:33 AM, William Stein wrote:
>
>>
>> On Fri, Jan 23, 2009 at 7:26 AM, Robert Miller
>> wrote:
>>>
I've used it several times and see no reason at
all to remove it.
>>>
>>> Redundancy is one reason I can thin
On Sat, Jan 24, 2009 at 6:03 PM, Franco Saliola wrote:
>
> On Fri, Jan 23, 2009 at 7:12 PM, Nick Alexander wrote:
>>
>>
>> On 23-Jan-09, at 7:33 AM, William Stein wrote:
>>
>>>
>>> On Fri, Jan 23, 2009 at 7:26 AM, Robert Miller
>>> wrote:
> I've used it several times and see no reason
On Sun, Jan 25, 2009 at 2:34 AM, Craig Citro wrote:
> Here's what it does: once these are set up, just type "t 1000" into
> the address bar to go immediately to trac ticket #1000, and type "trac
> foo" to search trac for foo.
You can achieve this with a "keyword search" in Firefox, which is an
Hello folks,
here goes alpha2 with plenty of interesting patches. As usual sources
as well as a sage.math specific binary can be found in
http://sage.math.washington.edu/home/mabshoff/release-cycles-3.3/
Upgrades should also work as usual. There are 30+ tickets in trac with
positive review a
In 3.3.alpha0, COPYING.txt in the top directory still has a reference
to SageX in it, in the second line. This is now #5094, and presumably
if there are any others still hiding somewhere they can be added to
this. This is not a duplicate of #857.
- kcrisman
--~--~-~--~~~
Following up, here is the first version of the paper on parallel
sparse polynomial multiplication:
http://www.cecm.sfu.ca/~rpearcea/sdmp/sdmp_pmul.pdf
Thank you for the use of the machine. We did acknowledge the NSF
grant. Does anyone here feel like discussing high performance
parallel algorith
27 matches
Mail list logo
