I definitely wouldn't expect nontrivial polynomial arithmetic to work
reliably over RR without special measures. There are definitely methods for
algebraic geometry with floats, but it needs very special attention to
numerical stability. That is already true for linear algebra over RR and
for p
In Sage 10.4, we tried to inject a RR number into a RR polynomial ring
quotient. It
works fine when the ideal had one (monomial) generator but precision is
lost when
it had two generators.
One generator example (works):
eps = var("eps")
edBaseRing=PolynomialRing(RR,[eps])
edIdeal=ideal(edBas
On Wed, Mar 5, 2025 at 12:51 PM Seth Chaiken wrote:
>
> In Sage 10.4, we tried to inject a RR number into a RR polynomial ring
> quotient. It
> works fine when the ideal had one (monomial) generator but precision is lost
> when
> it had two generators.
It's not a bug - it's half-expected that
Thanks for your reply! I had done just what you recommended.
I then coded a loop to successively take off leading polynomial terms and,
for each one, print the floating point approximation of the rational polynomial.
Seth
From: sage-support@googlegroups.com
