-
In #20086 a `nth_root` method was proposed to be able to take fractional powers of polynomials. Though this was not implemented for all polynomial rings. On sage-7.3.beta0 we have
```
sage: x = pol…
-
If `v` is an interval, I propose to evaluate `f(v)` as `f(x+c)(v-c)` with `c` the center of `v`. It's slower, but much more accurate.
Component: **algebra**
Author: **Jeroen Demeyer**
Branch/Comm…
-
This overlaps a bit with tod_ops.detrend. But expanding to higher level polynomials would be useful
-
Because of really dangerous memory bugs of #211 for $-variables, I would like to avoid stage4 sortings as much as possible. But I am not sure which parameters are really relevant for that. And it is p…
tueda updated
4 months ago
-
```julia
using SpeedyWeather
function SpeedyTransforms.transform_simple!( # SPECTRAL TO GRID
grids::FullGaussianArray, # gridded output
specs::LowerTriangularArray, …
-
Now that GAM is in master, we could use polynomial, especially, orthogonal polynomials with a similar structure.
It would also be a good case for extending and generalizing the supporting code, e.g. …
-
Consider the following example:
```
sage: var('a,b,c')
(a, b, c)
sage: time d=expand((a+b+c+1)^100)
CPU times: user 2.45 s, sys: 0.07 s, total: 2.52 s
Wall time: 2.53 s
```
I thought it would be mo…
-
According to [the main website](https://software-carpentry.org/), Software Carpentry's goal is to teach basic lab skills "for research computing."
For this reason, I would remove or replace the exa…
-
#### Problem:
Currently there is no cost on the 6 splines defining the linear and angular acceleration of the base. There are constraints on the base (range-of-motion, dynamic), but if these constra…
-
| | |
|--------------------|----|
| Bugzilla Link | [PR15560](https://bugs.llvm.org/show_bug.cgi?id=15560) |
| Status | NEW |
| Importance | P normal |
|…