Re: [sage-devel] VOTE: move Sage development to Github

+1 for Github. Le 21/09/2022 à 19:23, David Roe a écrit : Dear Sage developers, Following extensive discussion, both recently  (prompted by issues upgrading the trac server) and over

Re: [sage-devel] Re: Naming conflict between Givaro and Factory

Clément Le 06/12/2021 à 17:21, Dima Pasechnik a écrit : > > > On Mon, 6 Dec 2021, 14:42 Clement Pernet, <mailto:clement.per...@gmail.com>> wrote: > > Thanks, I also recently realized it was coming from Singular. > > > Le 03/12/2021 à 16:10, Maarte

Re: [sage-devel] Re: Naming conflict between Givaro and Factory

ly re-ordering or carefully picking the includes. Is anyone from singular around here who sees an alternative way around it? I'll report the problem upstream. Clément > Op vrijdag 3 december 2021 om 11:54:08 UTC+1 schreef Clement Pernet: > > Hi, > > Working on > &

[sage-devel] Naming conflict between Givaro and Factory

Hi, Working on     https://trac.sagemath.org/ticket/32959 I hit a compilation error due to sage/local/include/factory/factory.h: #define IntegerDomain 1 which conflicts with sage/local/include/givaro/givinteger.h: using IntegerDomain = ZRing See the compilation log ; [sagelib-9.5.beta7] In

[sage-devel] Bug(s) in scalar product over GF(p)

Hi, The following simple session triggers what I think is at least one bug, if not two: sage: p=193379 sage: K=GF(p) sage: a=K(1) sage: b=K(191495) sage: c=K(109320) sage: d=K(167667) sage: e=103937 sage: a*c+b*d-e 102041 sage: vector([a,b])*vector([c,d])-e -91339 sage: -91339+e 12598 sage: vect

Re: [sage-devel] avx512 anyone? (Skylake-X or later)

Hi, I just successfully compiled and tested upstream develop (at 8df690fd2a4e7a0c36e7dbc05c22d4d977217065 ) on a Intel(R) Xeon(R) Gold 6126 CPU @ 2.60GHz server with AVX512. All tests passed. Is there any specific compilation to test for #27961 ? I'll give a look at the ticket later on. As a side n

[sage-devel] How would you like your parallel linear algebra ?

Hi, In https://trac.sagemath.org/ticket/27444 we are exposing the parallel versions (using OpenMP) of fflas-ffpack routines used in SageMath. This is only about multicore parallelism, based on OpenMP. We would like to discuss on the best design to expose them to the end user: 1. Should the de

Re: [sage-devel] Tools to compute Hilbert Poincaré series

Le 02/09/2018 à 14:13, Simon King a écrit : 5. Use Macaulay2 Bad: (a) The experimental spkg is broken, it won't install. (b) The installation instructions for Ubuntu on the project pages are rather verbose and require adding obscure repositories. (c

Re: [sage-devel] Error installing package linbox-1.4.2

Le 19/07/2017 à 22:32, François Bissey a écrit : One thing that I don’t remember seeing anywhere before and that I find suspicious “-fabi-version=6” in CFLAGS. For the record, this -fabi-version=6 option is forced by givaro (a dependency of LinBox) to avoid a demangling bug with the standard a

Re: [sage-devel] Experience from Sage Review Day 3: An online hacking event

Hi, Thanks Johan for this summary. I definitely second your statement: it was a successful meeting with a very high output / organization overhead ratio. For those interested in the details of this output: - the framapad: https://bimestriel.framapad.org/p/SageReviewDay3 - trac tickets with key

Re: [sage-devel] multithreading performance issues

To follow up on Jean-Pierre summary of the situation: The current version of fflas-ffpack in sage (v2.2.2) uses the BLAS provided as is. Running it with a multithreaded BLAS may result in a slower code than with a single threaded BLAS. This is very likely due to memory transfer and coherence pr

Re: [sage-devel] linbox 64-bit charpoly

Hi, Update: I think I finally found the bug that led some rare computations to hang forever: givaro's random iterator was seed from the 6 digits of the current time microseconds, and could, with proba 10^-6 be seeded with 0, and the congurential generator would then always output 0, causing the

Re: [sage-devel] sage infrastructure at UW

Le 06/06/2016 17:17, Ralf Stephan a écrit : > On Monday, June 6, 2016 at 4:22:02 PM UTC+2, Dima Pasechnik wrote: > > Or perhaps someone pulled a full private copy recently? > > > Around end of April, I think, someone better? > > ralf@ark:~/sage/.git> find logs/refs/remotes/trac/| wc > 723

Re: [sage-devel] What can we assume about our C compiler

The Givaro-LinBox-fflas-ffpack ecosystem now requires C++11 support. I'm hitting this problem, while working on #17635, upgrading the spkgs of these 3 libraries. Therefore: > 1) Do we want to mandate c++11 support Y[X] N[ ] > > 2) if yes what c++11 features do we want? Feature complete [X] as

Re: [sage-devel] Re: speed regression testing

Hi Jean-Pierre and all, > Grat! > At some point, I pushed patches on linbox-devel (or something like that), but > never got any reply. > IIRC they were just tiny patches to ease ocmpilation on unusual archs. > I did not check recently, but one year ago or so they did not make it > upstream. > It

Re: [sage-devel] Re: speed regression testing

Hi, Let me clarify a few things: - LinBox's approach to link against numerical BLAS has never changed, and probably will not in the near future. - LAPACK is not BLAS: BLAS provides optimized numerical matrix multiplication kernels (that LinBox uses) and other basic routines, whereas LAPACK provi

Re: [sage-devel] Integer matrices using FLINT

Hi, Just to mention that fflas-ffpack and LinBox have been improving recently, wrt computation speed of most basic routines, and in particular with addition and improvement of kernels for efficient matmul over Z and large Z/pZ. Benchmarketing is in progress, but matmul seems to compare favorabl

[sage-devel] 3 postdoc or research engineer positions open in Grenoble, Lyon and Paris, France

Hi, I'd like to advertise these 3 job offers that should interest the sage developper community. In particular, some of the code development in these jobs concerns parallelization of libraries either used in sage (LinBox; fpLLL) or of potential interest for sage (FGb). Part of the job include i

[sage-devel] Re: Matrix multiplication

Great!! I have to be in Grenoble during that period for teaching but I'll try to arrange some free time to hang around on IRC and work remotely with you guys during that period. Clément On Jul 18, 12:05 pm, Martin Albrecht wrote: > > When I get a chance I will take a look at redoing the template

[sage-devel] Re: Matrix multiplication

Hi Ivo, On Jul 18, 1:32 pm, hedtke wrote: > With the in-memory variant I mean: "Boyer, Dumans, Pernet and Zhou: Memory > efficient scheduling of Strassen-Winograd's matrix multiplication algorithm. > International Symposium on Symbolic and Algebraic Computation 2009." > > This needs only a cons

[sage-devel] Re: Matrix multiplication

Hi, Most questions about finite fields matmul have been answered, in short: - one could quickly fix the pb that sage does not use linbox by default (I'm surprised by this fact) - in the current state, operands are converted from ints to double, hence a overhead in both time and memory. - Burcin &

Re: [sage-devel] Re: Adjoint of a matrix

Interesting discussion, I never realized that we are using two interpretations for this same word depending on the context! My 2 cents: In my favorite linear algebra book: F. R. Gantmacher, The theory of matrices. (1959) The adjoint of a matrix is defined 2 times with the two meanings!!! (at le

Re: [sage-devel] Re: inconsistent results for characteristic polynomial?

As an undergrad in France, I learned the definition of charpoly as det ( M- xI ) and remember, that our professor mentionned the other convention as exotic. Since then, I've worked on compting the charpoly during my phd thesis and always chose to use the definition det (xI-M) which I found much

Re: [sage-devel] Bug in PARI's frobenius normal form

5/32, -17/64, -1/32, 31/32, -21/64; 0, 0, 1/32, 5/64, 31/128, -17/64, -1/64, -21/128; 0, 0, 1/32, 5/64, -1/128, 15/64, -1/64, -21/128; 0, 0, 1, 5/2, -1/4, -1/2, -1/2, -21/4]] gp: F=FB[1]; B=FB[2]; gp: B^-1 * F*B == A 1 In your On 18 May 2010 17:07, Clement Pernet wrote: Hi there, Sa

[sage-devel] Bug in PARI's frobenius normal form

Hi there, Sage is producing a wrong answer when asked to compute a Frobenius normal form of a matrix, with the transformation matrix: sage: sage: A=matrix(ZZ,8,[[6,0,-2,4,0,0,0,-2],[14,-1,0,6,0,-1,-1,1],\ [2,2,0,1,0,0,1,0],[-12,0,5,-8,0,0,0,4],[0,4,0,0,0,0,4,0],\ [0,0,0,0,1,0,0,0],[-14,2,0,-6,

[sage-devel] Re: GCC-4.5.0

Hi, I could not find a gcc-4.5 install on eno, to replicate the bug. On which machine did you run it? (before I start compile it!) Could you also attach the linbox config.log to ticket #8769 ? Thanks. Clément William Stein a écrit : Hi, Main point of this email: if anybody else is trying to

Re: [sage-devel] Error in building/installing linbox on Open Solaris 64 bit

Hi, This part of the interface is actually terrible. In particular, I don't see the rationale for the use of static's here. Hopefully this will be all gone when we'll switch to have LinBox and matrix_modn_dense support use natively the same matrix type (#4258). But given your compilation err

Re: [sage-devel] Linbox complains GMP is not installed on Solaris 10 (64-bit mode)

The spkg-install passes the argument --with-gmp="$SAGE_LOCAL" to configure, so there's no pb with the library location. It has to do with something deeper. I'd also like to read the section of config.log showing the failure. Clément François Bissey a écrit : On Thu, 14 Jan 2010 22:27:53 Dr.

[sage-devel] Re: Categories for the working programmer

>> - Did anyone keep a list or graph of the desired categories from >> sage days 7? >>For reference, the hierarchy for MuPAD-Combinat is available there: >>http://mupad-combinat.sourceforge.net/Papers/Categories.pdf > > I thought someone took a photo of it, but I don't know who. > I

[sage-devel] Re: Advanced topics in linear algebra algorithmic class

o. > > On Thu, Sep 25, 2008 at 8:12 PM, Clement Pernet > <[EMAIL PROTECTED]> wrote: >> Hi, >> >> I made a first attempt of video-ing my class of linear algebra 581 with >> the first lecture I gave yesterday. >> >> http://video.google.fr/videoplay?d

[sage-devel] Re: Advanced topics in linear algebra algorithmic class

Hi, I made a first attempt of video-ing my class of linear algebra 581 with the first lecture I gave yesterday. http://video.google.fr/videoplay?docid=-3011598682395680999 The overall quality is not great, so I am not sure it will be of any help. I'll still try to continue doing it for the next

[sage-devel] Advanced topics in linear algebra algorithmic class

Hi, I wanted to advertise a class that I am going to teach this fall semester, and which can be of interest for sage developers and users. As its title suggests, it will be about theoretical and practical topics on computational exact linear algebra. You can check out the web page with the sylla

[sage-devel] Re: SD10 Accomodation Again

Hi there, Bad news for the accomodation in Nancy: I called the Youth Hostel, and they do not have enough room for the period of the SD10: a jazz festival and several other events are happening in the same period, and the Hostel already has several groups registered and confirmed. There is about

[sage-devel] sagemath.org wiki offline

Hi, The wiki pages on sagemath.org are offline, apparently due to a lack of disk space kind of problem. For example the page http://www.sagemath.org:9001/days10 diplays a "[Errno 28] No space left on device" Can someone with root priviledges on sagemath.org clean some space? Clément --~--~-

[sage-devel] Re: SD10 Accomodation

The wiki page for the Youth Hostel accomodation in Nancy is on-line: http://wiki.sagemath.org/Days_10_Youth_Hostel_Page Please sign up before september 16, by editing your name and dates on it, so we can make the booking soon enough. Cheers, Clément Robert Bradshaw a écrit : > On Tue, 9 Sep 2

[sage-devel] Re: SD10 Accomodation

Hi, I have called the Youth hostel "Un petit coin de Paradis" that Martin pointed out. They only have 2 individual rooms that they don't usually book in advance. However, the dorms are rather small: several of 3 to 4 bedrooms, and a few larger ones. The cost is 14 euros/night, including bed-she

[sage-devel] Re: Sage 3.0.5/3.0.6.alpha0: doctest failure in ssmod.py

> I have applied the patch and rebuild LinBox and started running the > test 500 times to see. Can you guess if/how much this patch does > affect performance for charpoly mod p? > For the dimensions you are considering (and up to a thousand) I don't expect any performance loss. But the probabili

[sage-devel] Re: Sage 3.0.5/3.0.6.alpha0: doctest failure in ssmod.py

I am looking into it. Applying the patch at http://sage.math.washington.edu/home/pernet/Patches/charpoly_LUK.patch will disable the current probablistic charpoly algorithm. This could help diagnose the origin of the bug. Cheers Clement mabshoff a écrit : > > > On Jul 17, 10:34 pm, mabshoff

[sage-devel] Re: Sage 3.0.4.alpha1 released

me know if it does not. Clément Glenn H Tarbox, PhD a écrit : > On Fri, 2008-06-27 at 12:32 -0700, Clement Pernet wrote: >> Hi, >> >> Sorry about this. >> >> This can be fixed by a trivial patch, that I forgot to add to the ticket >> #3429. I am currentl

[sage-devel] Re: Sage 3.0.4.alpha1 released

Hi, Sorry about this. This can be fixed by a trivial patch, that I forgot to add to the ticket #3429. I am currently testing it before attaching it to the ticket. If you want to try it: http://sage.math.washington.edu/home/pernet/Patches/trac-3429-fix.patch Cheers, Clément John Cremona a é

[sage-devel] Re: New Sage website

First, I really think this web site looks much better, and mature. Great job! I asked my roomate, Alan, to review it, since he's quite a bit into web app. development. Here are his comments: " * in general: less pages, dont hide things 3 pages deep. everything on the site could be edited down t

[sage-devel] Re: SSE2 not so useless after all

Hi, > > Bill, I suppose that also means that now we actually beat (or are close to > beating) Magma on the C2D "for real". My M4RI times are quite similar on the > C2D as your times on your Opteron. But my version of Magma (on the C2D) is > much worse than your version of Magma (on the Optero

[sage-devel] Re: SSE2 not so useless after all

hi guys, I am finally up to date with this discussion (I was being interviewed, and then flying when it started). First, congrats for the great job you have achieved. I have started to dive into m4ri, and I really like the quality of the code. I have a few remarks * the loop unrolling techniq

[sage-devel] Re: Questions about various spkgs

Francois a écrit : > On May 8, 12:25 pm, Timothy G Abbott <[EMAIL PROTECTED]> wrote: > >> I'm working on getting several of the SAGE dependencies not already in >> Debian maintained in the main Debian archive. I had a few questions about >> the future of some spkgs: >> >> I've heard rumor that

[sage-devel] Re: Fast matrices over GF(p)

Hi, I still did not look at the code of Meat axe, but I remember having been really impressed a presentation at MSRI last year about MeatAxe. The timings were really impressive especially the matmul ones. So I am really surprised by your experience with slow matmul. >>> The strength of MTX in

[sage-devel] Re: spare square matrices that are permutations of block diagonal matrices.

Hi Gregory, I agree with you, this would be great to have in SAGE, and I was also thinking of writing something like that in LinBox sometime for the sparse charpoly. Mike Monagan & Al. already wrote something on the subject: http://www.cecm.sfu.ca/~monaganm/papers/CP8.pdf I am just getting se

[sage-devel] Re: [PATCH] Compile Linbox with gcc 4.3 trunk

Thanks Ismail for the report. The latest svn version of linbox is now fixed. Clement ismail dönmez a écrit : >Hi all, > >I applied attached patch to Linbox 1.1.4 tarball and I was able to >build & pass regression tests with gcc 4.3 trunk. > >Regards, >ismail > >> > > >

[sage-devel] Re: Raising matrices to a power

Hi there, The method using x^k mod charpoly (or minpoly) is clearly the only method I know about for that problem. If n is smallish, this is the good way to do it. For larger n (say n=O(k)), the computation of the n power of A in step 3 is the bottleneck (n^4 or n^(w+1) ops in Q, so roughly O(

[sage-devel] Re: matrix multiply with huge entries

Hi everyone, > We do have A._multiply_linbox(B), but we never > use it by default, since when we first wrapped it sadly turned out > to be slower than using our own multi-modular implementation. > This is the sort of thing that may change someday, I hope... Yep, that should change pretty soon! I

[sage-devel] LinBox Givaro and gcc-4.2

As announced on linbox-devel, the gcc-4.2 problem with LinBox has been fixed, and the up to date code can be retrieved from the svn server of LinBox. We are soon going to release version 1.1.4. Since LinBox and SAGE use intensively Givaro, we also fixed givaro code, that had the same problem. We

[sage-devel] Re: MSI packages for Windows and atlas

linbox package > here: http://www.sagemath.org/packages/experimental/ > It's probably just a matter of changing GMP_Integers to PID_Integer or > PID_integer or something like that (I asked Clement Pernet recently). > Then build everything, discover bugs, fix, write to linbox mailin