On 11/20/23 20:48, Waldek Hebisch wrote:
Extra remark: it should be possible to get much of effect of RealClosure by considering pairs of AlgebraicNumber and floating point approximation. Namely, we can compute minimal polynomial of algebraic number and moderately accurate floating point approximation uniquely determines corresponding exact root. In case when we get reducible polynomials we could use floating point approximations to find right factor.
Does this mean the right thing to do is to have two kinds of algebraic numbers? For first kind, its position is not fixed (like current status of 'rootOf), for the other kind, the position is fixed (you described above). Because some computation doesn't care which root is which (for example sum of all roots or a polynomial), while other computation cares. - Qian -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/fricas-devel/906ea4a1-4f1a-4137-bef4-c6c8993b6de4%40gmail.com.
