On 02.07.2022 19:08, Waldek Hebisch wrote:
> On Sat, Jul 02, 2022 at 10:10:11PM +0800, Qian Yun wrote:
...
>
> What I would like to call:
> - matrix-matrix multiplication from BLAS
> - routines like solve, SVD, eigenvalue decomposition from Lapack
> - multiplication for polys over Z_p
>
>
On 7/5/22 20:20, Ralf Hemmecke wrote:
Hi Qian,
that sounds amazing. Are you going to document is somewhat so that one
then would only have to write a little scritpt for "git pisect run" and
would have the bad git-sha1 in about 3 min.
I'm still improve the process, but here is a few hints
Hi Qian,
that sounds amazing. Are you going to document is somewhat so that one
then would only have to write a little scritpt for "git pisect run" and
would have the bad git-sha1 in about 3 min.
BTW, I wonder how you are actually mapping the non-linear commit graph
of FriCAS to your
The total time for sb-fasteval is 13.4 seconds,
compile SMP.lsp reduce it to 9.9s,
then compile PR.lsp reduce it further to 8.3s,
IDPO.lsp to 7.1s,
PGCD.lsp to 6.3s,
KERNEL.lsp to 5.6s,
LIST.lsp to 5.2s,
FM.lsp to 4.9s,
INT.lsp to 4.7s,
FRAC.lsp to 4.6s,
POLYVEC.lsp to 4.4s.
This integral
In case it is, my first feeling is. No bug, don't fix it. If a user
wants a proper variable name, he should use UnivariatePolynomial,
because that explicitly requires a variable name for the output.
Sorry, this is _very_ wrong. Any fixed name could clash with
user variable names, so library