-
## Algorithm
> Algoritma konuları için katkıda bulunmak isteyen arkadaşlar repomuzda issue olarak bulunan konulardan birini seçerek hangi konuyu istediğini yorum olarak bildirmesi yeterli. Bunun sebe…
-
I've been working on Polynomial Smith Form implementations that use the polynomial matrix and polynomial matrix mul domain. I've run into an issue where the polynomial matrix mul will fail seemingly …
gmh33 updated
6 years ago
-
### Steps To Reproduce
```sage
var('x,t')
y = 2.66778786276411e493*t^3*x - 1.93258971534823e247*x
integrate(y, t, 0, 1, algorithm='libgiac')
```
It fails with `algorithm=a` for each `a` in `…
-
# Issue Title
Create Fractional Riccati Differential Equation Solver using Jacobi Tau Method
## Issue Description
### Overview
Develop a solver for fractional Riccati differential equations (FREs) ba…
-
Imported from SourceForge on 2024-07-04 17:01:43
Created by **[robert_dodier](https://sourceforge.net/u/robert_dodier/)** on 2015-07-02 15:17:14
Original: https://sourceforge.net/p/maxima/bugs/2989
-…
rtoy updated
4 months ago
-
Things that were unclear/ambiguous to me during this assignment:
- > The inclusion of the public key in the polynomial.
and
> Check whether the address is included in the polynomial. To d…
-
Hi Jonathan：
It has been a long time since the last question. I have got a problem recently. When there are only enough data for the input variables (more than 1 dimension), how can I compute the …
-
### Steps To Reproduce
> ARM64 M1 macOS && [Arch Linux](https://archlinux.org/) ARM64
```shell
sage: pari.allocatemem(20000000000)
PARI stack size set to 20000000000 bytes, maximum size set to 2…
n-WN updated
4 months ago
-
## 🐛 Bug Report
I've been developing an experimental version of Miri that can execute foreign functions by interpreting LLVM bytecode. I was testing it on this crate, and it didn't find any borrowi…
-
ToDo: Increase arithmetic speed by using high performance algorithms for polynomial multiplication and division.