A real polynomial decision algorithm using arbitrary-precision floating point arithmetic

DOI10.1023/A:1009924521389MaRDI QIDQ1971088zbMATH OpenOpenAlexFDO

Authors Adam Strzeboński

Publication date 13 November 2000

Published in Reliable Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1009924521389

zbMATH Keywords

cylindrical algebraic decomposition algorithmMathematicareal polynomial decision algorithmsystem of real polynomial equations and inequalities

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to systems of equations (65H10) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 1253988
• scientific article
• scientific article; zbMATH DE number 1305086
• Nonstandard decision methods for the solvability of real polynomial equations
• scientific article; zbMATH DE number 1263361

Cited in

(4)

• Accurate simple zeros of polynomials in floating point arithmetic
• Arbitrary precision real arithmetic: design and algorithms
• scientific article; zbMATH DE number 1684388 (Why is no real title available?)
• scientific article; zbMATH DE number 1859211 (Why is no real title available?)

Describes a project that uses

Uses Software

• Mathematica

This page was built for publication: A real polynomial decision algorithm using arbitrary-precision floating point arithmetic

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