Hello, William
by the way, what do you think about using in SAGE both double and
multiple precision versions of ALGLIB?
I have fully functional multiple precision version of ALGLIB which
relies on MPFR for floating point computations. It includes multiple
precisionlinear algebra,
On Sat, May 8, 2010 at 1:40 AM, Sergey Bochkanov
wrote:
> Hello, William
>
> by the way, what do you think about using in SAGE both double and
> multiple precision versions of ALGLIB?
>
> I have fully functional multiple precision version of ALGLIB which
> relies on MPFR for floating po
Hi!
I wonder whether the following is a bug or a feature:
sage: P. = QQ[]
sage: R = CC.extension(x^3+x^2+1,'a'); R
Univariate Quotient Polynomial Ring in a over Complex Field with 53
bits of precision with modulus a^3 + a^2 + 1.00
Even though CC is algebraically complete, it is
The documentation for extension says that K.extension(f) creates and
returns K[x]/(f), which in this case would be an algebra , isomorphic
to CC\osum CC\osum CC.
I have no problem with that in principle, though the documentation
could be clearer.
John
On 8 May 2010 11:15, Simon King wrote:
> H
On 05/08/2010 03:42 AM, William Stein wrote:
On Sat, May 8, 2010 at 1:40 AM, Sergey Bochkanov
wrote:
Hello, William
by the way, what do you think about using in SAGE both double and
multiple precision versions of ALGLIB?
I have fully functional multiple precision version of ALGLIB w
FYI
-- Forwarded message --
From: Rogério Brito
Date: 2010/5/8
Subject: sagemath: moving to team maintainance?
To: 573...@bugs.debian.org, debian-scie...@lists.debian.org
Hi, Tim.
I see that you don't seem to have the time to package sagemath and it
could be in a better state.
Hello, William.
> My first thought is that it would be *awesome* to have _efficient_
> multiprecision linear algebra, etc., in Sage.
> This is the sort of thing people expect from Sage, but are often
> disappointed to find that we don't have.
As for the efficiency, I may say that perf
Hi Sergey,
On Sat, May 8, 2010 at 10:13 PM, Sergey Bochkanov
wrote:
> (3) - OOP overhead. Multiple precision ALGLIB makes use of OOP to
> implement multiple precision expressions like "x=y+z". However, it
> leads to excessive creation of temporaries, so I will replace OOP by
> somethin
Hello everybody !!! :-)
There are several tickets needing review in Graph Theory at the moment...
Some of them only take several lines, fixe a bug or docstrings, some are
bigger... The problem is that times goes by, patches too, and as many of
them overlap it grows quickly very hard to rebase them
On Sat, May 8, 2010 at 6:47 PM, Nathann Cohen wrote:
> Hello everybody !!! :-)
>
> There are several tickets needing review in Graph Theory at the moment...
> Some of them only take several lines, fixe a bug or docstrings, some are
> bigger... The problem is that times goes by, patches too, and as
> If you could
> reply with a series of links to the trac tickets, in the priority you
> think is appropriate, it would be helpful.
Sadly, the "most important" are the older ones, and the hardest to
review... But for all the LP tickets one can find lengthy explanations
there in the dedicated chapt
Let me also add to the list of "very easy reviews" the following ones from LP :
Improve the arguments for the default type of a variable in
MixedIntegerLinearProgram
http://trac.sagemath.org/sage_trac/ticket/7789
CPLEX can now be silenced
http://trac.sagemath.org/sage_trac/ticket/8880
plus they
Using Sage 4.4.1 (it built fine) on a Sun Blade 2000 (dual 1.2 GHz), I tried to
run 'ptestlong'. I got this failure: (There may be others, I just started the
tests). I've never before run ptestlong, so I don't know how reliable it is on
Solaris. (I've tended to avoid anything parallel in Sage, a
13 matches
Mail list logo
