-
It is weird that you implement the taylor polynomials mentioned in your paper in this way:
```
w_x = tf.tile(_variable_on_cpu('weight_x', shape, initializer), [batch_size, num_point, K_knn, 1])
w…
-
Defect Description: if decimals are given as inputs it is taking floor value and performing operations instead of throwing errors.
Steps_to_reproduce:1.Go to Polynomial Operations.
2.Click on Simula…
-
Based on discussions with @mezzarobba and @fredrik-johansson:
- [ ] A module for generic Ore polynomials: `gr_ore_poly`
- [ ] differential operators in `d/dz` and in `z*d/dz`, with `gr_poly`s as…
-
The current way of solving bilinear sum-of-squares problems implies that the s-polynomials need to be specified with the monomials of a certain degree, this may be problematic because if these are cho…
-
With semirings implemented (#14507), it seems not too wide a stretch to ask for algebraic constructions involving them, such as (semi)algebras over semirings, and polynomials over semirings acting o…
-
OM Tree construction and a native sage implementation of padic polynomial factoring using it. This factorization works for polynomials over Zp as well as over unramified and totally ramified extens…
-
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…
-
One would expect the performance of casting the usual way (as in test 1 below) to be at least not much worse than test 2:
```
sage: QQX=QQ['x']
sage: QP=Qp(3,30);
sage: R=QP.residue_field();
sage: …
-
In the past (i.e., some months ago), functions `polyfit`, `polyval`, etc. worked. I have the impression that `polyfit` has been replaced by `fit`, and that `polyval` has been eliminated.
I have tri…
B-LIE updated
4 years ago
-
Chebyshev polynomials should be drop-in replaceable with Legendre ones. Right now it doesn't work, the curves go crazy pretty quick.