-
The Integral Collocation method of [this paper](https://arxiv.org/abs/1812.06243) is implemented in volesti under
`include/ode_solvers/integral_collocation.hpp`.
The current state of the solver do…
-
Currently, it is not clear whether `NRoot` provides `n`-th roots, polynomial root-finding (not present), or arbitrary powers (present, but unimplemented for `Algebraic` = throws).
-
Many interesting functions in graphics are implemented by solving high-order polynomials. For example, finding the point of a cubic Bezier that is closest to a given point (the "nearest-point" problem…
-
Currently `RationalField` has significantly less functionality then `NumberField_relative` and
`NumberField_absolute` . This is annoying since this means that if you want to write code that works …
-
Hi,
I’m trying to find the roots of a polynomial, and nalgebra has overall worked great.
Recently, I’ve found that my calculations hang on certain inputs, for which numpy immediately returns a v…
-
### 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
2 months ago
-
Implement the ring of Puiseux polynomials. Those are usual
polynomials, except that exponents can be any rational number.
```
sage: S = PolynomialRing(QQ, ['a','b','c']); S
Multivariate Puise…
-
Implement projection to homology classes via local iFFT
```
H(x) = sum_k h(k) x(k)
where x(k) = prod_i ei^(ki xi)
```
This extends the representation of local observables as polynomials in the bina…
-
## What set of functions should be considered elementary?
So far we have:
- [x] `polynomials`
- [x] `n-th roots`
- [x] `sin`
- [x] `cos`
- [x] `exponential functions`
- [x] `log`
- [x]…
-
```
sage: Pol. = QQ[]
sage: pol = (-28524712624242039055315336000413967778733418480863118977869865132075390079059109742198859964232127005/1451626239969468099340993140755597642170368*n^85 + 10612905…