-
from @robfalck:
### Desired capability or behavior.
### Summary of Issue
The initial implementation of the Solved ODE assumes TAS as the control input. For constant EAS and constant Mach phase…
-
Currently the Haskell implementation has tests in `quartic_tests.hs` in the form of QuickCheck properties that verify that solutions to random polynomials are indeed roots.
It is necessary to also …
-
This issue describes the roadmap to serialization in OSCAR. Comments are very welcome.
A proof of concept implementation (for selected types) exists in OSCAR for a while; it builds on a working se…
-
I've been struggling with some unexpected results in my computations with polynomials over the symbolic ring. Eventually, I came to the conclusion that it should not be possible to *coerce* polynomi…
-
The design choice made for p-adics and power series is that `O(p^n)` and `O(x^n)` behave similarly to zero in comparisons. All of
- `a.is_zero()`
- `not a`
- `a == a.parent().zero()`
- `not (a != a.…
-
For matrices, it is very easy to pass back and forth between sparse and dense representations.
```
sage: M = Matrix([[2,3],[4,5]])
sage: M.is_dense()
True
sage: M.is_sparse()
False
sage: M1 = M.spa…
-
On my laptop, it takes almost 1 second to create a polynomial of degree 10000 over F_125:
```
sage: k = GF(5^3)
sage: S. = k[]
sage: L = [ k.random_element() for _ in range(10000) ]
…
-
```
pts = [(1,2),(2,3),(3,2),(4,3),(5,2),(6,3)]
R.=QQ[]
f = R.lagrange_polynomial(pts)
SR(f)
2. If one has a non-symbolic polynomial currently, it won't plot with
the new plotting syntax.
plo…
-
The `factor` function failed to factorize a polynom with symbolic coefficient when the identity `a**x + a**y = a**(x + y)` is applied from left to right. It’s like `factor` is unable to *undo* this id…
-
Bastian Germann added the following to the Debian package for BRiAl:
```
diff --git a/sage-brial/brial/gbcore.py b/sage-brial/brial/gbcore.py
index fd3c3d0c..9006e8d6 100644
--- a/sage-brial/brial…