I'm building Sage 7.6 on my laptop, and there was an error making openblas
that directed me to the log files for that package. The log file said that
detecting CPU failed, and to set TARGET explicitly. It also suggested I
email this google group to explain the problem, with the relevant part of
mppp also uses a small value optimisation. The number of limbs that can be
stored without dynamic memory allocation can be selected at compile time,
and the benchmarks on the website are done using 1 limb (64 bits) of static
storage.
I can think of a few things that might influence positively mppp
Thanks everyone :). I got it here, a working sage 6.9 arm version for
Raspbian Jessie
https://raspberrypi.stackexchange.com/questions/69183/is-there-any-raspberry-pi-version-of-sagemath?noredirect=1#comment109029_69183
:)
On Sunday, July 2, 2017 at 7:07:54 PM UTC+6, Pavel Sayekat wrote:
>
> Is
On Thu, Jul 13, 2017 at 5:59 AM, 'B. L.' via sage-devel
wrote:
> Dear Sage-Developers,
>
> I'd like to report two issues that I came across when working with the
> coding theory classes of SAGE.
>
> The Sage Reference Manual: Coding Theory, Release 7.6 [1] explains on p. 31:
> weight_enumerator [.
So why is it faster than Flint say? Except for the overhead in the Flint
fmpz type, which uses a single word initially and only upgrades to an mpz_t
on overflow, it should currently be doing more allocations than Flint. And
Flint should be faster for something like a dot product, especially if t
Dear Sage-Developers,
I'd like to report two issues that I came across when working with the
coding theory classes of SAGE.
1. The Sage Reference Manual: Coding Theory, Release 7.6 [1] explains on
p. 31:
weight_enumerator [...] This is the bivariate, homogeneous polynomial in
𝑥 and
