+1
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-devel@googlegroups.com.
On Tuesday, September 26, 2017 at 1:56:39 PM UTC-7, mforets wrote:
>
>
>
> El martes, 26 de septiembre de 2017, 22:38:23 (UTC+2), Samuel Lelievre
> escribió:
>>
>> Tue2017-09-26 10:29:17 UTC, Maarten Derickx:
>> > Seems to be back up again.
>>
>> Not sure if it's related but when I click on the
Tue2017-09-26 10:29:17 UTC, Maarten Derickx:
> Seems to be back up again.
Not sure if it's related but when I click on the branch at
https://trac.sagemath.org/ticket/21944
I get the following error:
Internal Server Error
The server encountered an internal error or misconfiguration
and was
On Tue, Sep 26, 2017 at 10:06 AM, 'Martin R' via sage-devel
wrote:
> Dear all,
>
> I would like to propose to make the package FriCAS optional. FriCAS
> provides some functionality which is otherwise either mostly missing (e.g.,
> guessing formulas, lazy
Tue 2017-09-26 14:06:36 UTC, Martin R:
> I would like to propose to make the package FriCAS optional.
+1
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to
The dense multicore examples will take months to run in Flint, since we
haven't written the code yet! :-)
But your explanation about the cost of conversion in the sparse case
certainly more than accounts for overall difference in performance.
Giac also has a symbolic front end, too, which
Now that you have given the precise conditions, I will check if they are
equivalent to whats in the smp code. They do look like what I was aiming
for.
As for caching the last entry, that code is still in there in a thread-safe
way. This optimisation had no effect on the timings when the
Dear all,
I would like to propose to make the package FriCAS optional. FriCAS
provides some functionality which is otherwise either mostly missing (e.g.,
guessing formulas, lazy powerseries), or not as complete as might be
desirable (e.g., symbolic integration, solving differential
On Tue, Sep 26, 2017 at 2:15 AM Eric Gourgoulhon
wrote:
> Yes it's a pity. A big project like Sage should have a changelog at each
> new release. My understanding is that
>
> 1/ the automated script generating the raw changelog from the git logs was
> lost somehow (during
Le mardi 26 septembre 2017 10:43:10 UTC+2, Bill Hart a écrit :
>
> We used to do this, and Daniel noticed that it wasn't really threadsafe.
>
It would be in my implementation, but inserting requires sometimes memory
allocation and it seems to slow down too much. Anyway, as explained
earlier,
Seems to be back up again.
On Tuesday, 26 September 2017 12:13:38 UTC+2, Jeroen Demeyer wrote:
>
> On 2017-09-26 12:10, Maarten Derickx wrote:
> > I can't seem to reach trac.sagemath.org , the page seems to take
> forever
> > to load. Do other people have this problem as wel?
>
> Me too.
>
>
On 2017-09-26 12:10, Maarten Derickx wrote:
I can't seem to reach trac.sagemath.org , the page seems to take forever
to load. Do other people have this problem as wel?
Me too.
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from
I can't seem to reach trac.sagemath.org , the page seems to take forever to
load. Do other people have this problem as wel?
Thanks,
Maarten
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails
Yes it's a pity. A big project like Sage should have a changelog at each
new release. My understanding is that
1/ the automated script generating the raw changelog from the git logs was
lost somehow (during some migration of server?)
2/ it requires some volunteer to maintain such a file
We used to do this, and Daniel noticed that it wasn't really threadsafe. I
don't know the current status of this. At some point he said it didn't make
any difference after he got the delayed insertion working.
I didn't check carefully, but maybe he stores it in the final heap location
now. But
Roman Pearce said he would put up some code to explain this. (The
conditions Daniel uses are quite complex in comparison.) I therefore think
that it's ok to quote the following from correspondence with Roman (since I
put up my blog):
[The idea is based on ] "Ellis Horowitz, A Sorting Algorithm
I found a way to get better timings by caching the index of the insertion
chain of the previous monomial. But now multi-threaded execution is slower
than 1 thread execution most certainly because of locks during insertion...
I will probably force 1 thread sparse multiplication.
--
You
17 matches
Mail list logo