-
Is there any way to take the nth derivative of a function (without making a function for each individual derivative). i.e.
```math
f(x) = x^3
```
```math
f_n(n, x) = \frac{d^n}{{dx}^n} ( f(x) …
-
The polynomial values are computed in a loop:
https://github.com/deepsphere/deepsphere-cosmo-tf2/blob/3facedf3747abe3e065c45d3368d4d0b1ddf9a2d/deepsphere/gnn_layers.py#L127
For commonly used deg…
-
This could be pretty useful. In Base, `exp(z::Matrix{BigFloat})` doesn't exist but we could support it with some minor modifications of the rational algorithms
```julia
julia> using LinearAlgebra
…
-
We currently have a module SparsePoly used exclusively for the gcd function in MPoly. However, there is no particular reason why we couldn't try using MPoly to represent sparse polynomials. One would …
-
The hard-coded polynomial was taken from bchlib's example. This limits the supported range of fuzziness thresholds and should rather be chosen dynamically based on the FCS parameters.
-
In Sage 6.3 we have
```
sage: R. = QQ[]
sage: I = R.ideal(y^2 - 2*y + 1, x + 1/4*y - 5/4)
sage: solve(I.gens(), [SR(x) for x in R.gens()], solution_dict=true)
[]
```
But in 6.1.1 we got
```
sage: …
-
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…
-
Hi, this project is very impressive, thanks for sharing this.
I wanted to ask if this implementation supports the multi-interval Remez algorithm. For example, is it possible to approximate sing(x) fu…
-
``` py
from sympy import S, trigsimp
M = S("""Matrix([[d_L*g*m_L*sin(theta1(t)) +
d_T*g*m_T*((-sin(theta2(t))*sin(theta3(t)) +
cos(theta2(t))*cos(theta3(t)))*sin(theta1(t)) + (sin(theta2(t))*cos(thet…
-
```
There is currently no exponentiation operator, which makes denoting polynomials
quite hard, e.g. if x is of type poly we could write
y := x^^3 + 3*x^^2 + 2*x + 1
at the moment we have to write
…