scientific article; zbMATH DE number 1263362

MaRDI QIDQ4234243zbMATH OpenFDO

Authors Renaud Rioboo

Publication date 16 September 1999

zbMATH Keywords

implementationreal algebraic closurereal algebraic numbersreal roots of a polynomial

Mathematics Subject Classification ID

Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Ordered fields (12J15) Symbolic computation and algebraic computation (68W30)

Recommendations

• Towards faster real algebraic numbers
• scientific article; zbMATH DE number 2151239
• Computing with algebraically closed fields
• Complexity of computation on real algebraic numbers
• Construction of real algebraic numbers in Coq

Cited in

(17)

• Equality in computer algebra and beyond.
• Does computer algebra help at all learning about real numbers?
• Dynamic evaluation and real closure.
• Towards faster real algebraic numbers
• Effective asymptotics of linear recurrences with rational coefficients
• Symbolic-numeric integration of rational functions
• Construction of real algebraic numbers in Coq
• On the number of zeros of abelian integral for some Liénard system of type (4,3)
• scientific article; zbMATH DE number 1200270 (Why is no real title available?)
• An Intuitionistic Axiomatisation of Real Closed Fields
• Poincaré bifurcation of some nonlinear oscillator of generalized Liénard type using symbolic computation methods
• scientific article; zbMATH DE number 2151239 (Why is no real title available?)
• Accurate solution of polynomial equations using Macaulay resultant matrices
• Affine transformations of algebraic numbers
• Computer Algebra in Scientific Computing
• Finding at least one point in each connected component of a real algebraic set defined by a single equation
• Computing with algebraically closed fields

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4234243)