Right, it solves that, but it only returns up to 64 vectors in the
null space. It's highly cache efficient these days and works for
absolutely enormous matrices. However, I think the latest version he
has, does all sorts of things specific to the number field sieve. So I
am not sure if it is worth
Hi Martin,
I downloaded the clean tarball and added an extra test, but I get:
mul: m: 4096, l: 3528, n: 4096, k: 0, cutoff: 1024
FAIL: Strassen != M4RM
FAIL: Strassen != Naive
:-(
Also I later replaced the following lines of strassen.c:
a -= a%RADIX;
b -= b%RADIX;
c -= c%RADIX;
wit
On May 20, 9:21 pm, mhampton <[EMAIL PROTECTED]> wrote:
> One thing that might work for you, if you have some interest in it, is
> adding either more native polyhedral functionality to Sage, or improve
> the interface to the polymake package. I am actively working on those
> things, but my time
One thing that might work for you, if you have some interest in it, is
adding either more native polyhedral functionality to Sage, or improve
the interface to the polymake package. I am actively working on those
things, but my time is quite limited and it would be good to have more
people working
Hi Brian,
Thanks for reading and responding to my comments.
On Wed, May 21, 2008 at 8:11 AM, Brian Granger <[EMAIL PROTECTED]> wrote:
>> IPython1 is a Python library that Sage ships that builds on MPI.
>> Maybe Fernando or Brian (who I've just cc'd) can comment.
>> We also build on Twisted, which
mabshoff wrote:
> Hello folks,
>
> the 3.0.2 release cycle so far has been a little slower than usual
> and there are a couple contributing factors. While some of us are
> waiting on the coercion rewrite to progress, others had obligations
> with school and the end of the semester seems to have k
> IPython1 is a Python library that Sage ships that builds on MPI.
> Maybe Fernando or Brian (who I've just cc'd) can comment.
> We also build on Twisted, which is somewhat relevant for
> certain types of problems..
A few comments along these lines:
- mpi these days is actually really easy to bu
On Tue, May 20, 2008 at 12:43 PM, Mark V <[EMAIL PROTECTED]> wrote:
> Hi Devs,
>
> I suppose the issues below could be described as related to the question:
> Is SAGE being written as a desktop application, or being written as a
> grid/cloud application?
Sage should be both.
> From what I've gle
On Tue, May 20, 2008 at 3:48 PM, Mark V <[EMAIL PROTECTED]> wrote:
> Hi William,
> Thanks for taking time to respond so promptly.
>
> On Tue, May 20, 2008 at 1:17 PM, William Stein <[EMAIL PROTECTED]> wrote:
>> On Mon, May 19, 2008 at 6:57 PM, MarkV <[EMAIL PROTECTED]> wrote:
>>> Q1) Is the focus
How is the "live" html documentation generated? I see a URL like
http://localhost:8000/doc/live/tut/index.html
but I can't actually find a subdirectory "live" of any directory
called "doc". Either I'm not looking in the right place, or it's
actually coming from doc/html/tut/index.html, with so
On Tue, May 20, 2008 at 9:55 AM, Carl Witty <[EMAIL PROTECTED]> wrote:
>
> On May 20, 7:48 am, Simon King <[EMAIL PROTECTED]> wrote:
>> And of course, changing x into an int, you can get a lot more speed:
>> def FullCyloop(n):
>> cdef int i
>> cdef int x
>> for i from 0<=i> x=2
On May 20, 7:48 am, Simon King <[EMAIL PROTECTED]> wrote:
> And of course, changing x into an int, you can get a lot more speed:
> def FullCyloop(n):
> cdef int i
> cdef int x
> for i from 0<=i x=2+2
> return x
>
> yielding
> sage: timeit('x=FullCyloop(10^6)')
> 625 loops,
Hi Mikael,
On May 20, 4:31 pm, mabshoff <[EMAIL PROTECTED]> wrote:
> > ... this code
> > is outperformed by the fractal renderer I played with when I was 10!
>
> That is expected since the code is in Python. Writing the tight loops
> in Cython would likely speed it up a lot, especially if you av
On May 20, 4:20 pm, Mikael Vejdemo Johansson <[EMAIL PROTECTED]>
wrote:
Hi Mikael,
> Hi, blog post author here. Simon King just told me I'd been linked in
> I'm interested in hearing suggestions on how to make it even better.
> However, I haven't put any more thought into writing a -smart-
Hi, blog post author here. Simon King just told me I'd been linked in
here, and that I might want to peek in on the discussions on the list.
On May 18, 4:06 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> On Sun, May 18, 2008 at 3:27 AM, Michael Abshoff
> <[EMAIL PROTECTED]> wrote:
> > From
> >h
Hello, folks,
I've been a fan of SAGE for a while, but haven't taken the time to put
it to any good use. I've also been taken slightly aback at the pace
of development; it's a wonder to behold.
I'm taking the summer to pick up Python, dig into SAGE (has it
officially become "Sage" yet?), and ha
> > > By the way, I wrote some code ages ago for computing the row echelon
> > > form of sparse matrices over GF2 which essentially inverts 6000x6000
> > > sparse matrices in about a second.
> >
> > Excellent, is the code available somewhere? How dense are these matrices?
>
> My code is not downlo
My code is not downloadable anywhere that I am aware of. I used to use
it in my quadratic sieve before I switched to Jason P's block Lanczos
code (BL solves a more restricted problem but is fine for the QS). My
old code is some of the earliest mathematical C code that I wrote, so
can certainly be
Wow!
On Tue, May 20, 2008 at 1:15 AM, Joshua Kantor <[EMAIL PROTECTED]> wrote:
>
> The author of this
>
> http://www.davidson.edu/math/chartier/Starwars/
>
> project wanted code to render a 3d model of yoda for a demonstration
> of rotation matrices.
>
> A worksheet that does this can be found a
On Tuesday 20 May 2008, Bill Hart wrote:
> Martin,
>
> On the M4RI website you say that M4R inversion is asymptotically fast
> with time complexity n^3/log_2(n), but Strassen's method has
> complexity n^log2(7), which I would call asymptotically fast.
>
> Do you just mean asymptotically faster tha
Built and tested on three x86 machines running Gentoo. All three had
the exact same failures as the ones David reported earlier:
sage -t devel/sage/sage/server/simple/twist.py
sage -t devel/sage/sage/server/support.py
Best,
Alex
mabshoff wrote:
> Hello folks,
>
> the 3.0
21 matches
Mail list logo