-
see also https://github.com/statsmodels/statsmodels/pull/7296#issuecomment-770160443
evaluated on a grid, similar to histogram, provides histogram smoothing
scipy.Bpoly works also if we only hav…
-
## Representing polynomials
Currently we do not have any data structure to represent polynomials. We can only encode monomials (multivariate or univariate).
Considering the variables `(x_1,x_2,x_3…
-
A lot of conflicts:
```
sage: S. = QQ[]
sage: from itertools import product
sage: values = [S(t) for t in product((0,1/2,1,2), repeat=5)]
sage: len(set(map(hash,values)))
565
sage: len(values)
1024…
-
### Is there an existing issue for this?
- [X] I have searched the existing issues for a bug report that matches the one I want to file, without success.
### Did you read the documentation and troub…
-
`TaylorRec{T,N}` is an implementation of multivariate Taylor polynomials as a recursive dense representation, including tests. It is in the "TaylorRec" branch.
The idea is to generate a polynomial in…
-
First implementation of the Algebra of multivariate polynomials invariant under the action of a permutation group.
From a permutation group and a ring, the goal is to implement an algebra on which …
-
Let f be a polynomial in two variables x and y over a ring R.
Consider the following three commands
i) f(2,3)
ii) f(x=2,y=3)
iii) f.subs(x=2,y=3)
They give the same results but not the …
-
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…
-
for univariate polynomials we have the class `Polynomial`:
```
sage: R. = QQ[]
sage: isinstance(x+1, Polynomial)
True
```
However for multivariate polynomials we have to write:
```
sage: R. = QQ[]…
-
This one is just about as fundamental as the Laplacian. For complex spherical harmonics and Zernike polynomials, it's diagonal. Other multivariate OPs may have nontrivial representations. In polar coo…