Univariate real root isolation in an extension field and applications
type: Item
instance of: scholarly article
title: Univariate real root isolation in an extension field and applications
zbMATH Open document ID: 1408.68148
published in: Journal of Symbolic Computation
publication date: 2018-12-28T00:00:00Z
full work available at URL: st-rsef-jsc.pdf
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 13P15
zbMATH DE Number: 6997074
zbMATH Keywords: real root isolation
zbMATH Keywords: algebraic polynomial
zbMATH Keywords: field extension
zbMATH Keywords: separation bounds
zbMATH Keywords: Sturm sequences
zbMATH Keywords: Descartes' rule of sign
author: Adam Strzeboński
author: Elias P. Tsigaridas
describes a project that uses: ISOLATE
describes a project that uses: Mathematica
MaRDI profile type: Publication
OpenAlex ID: W2626508605
cites work: Q3535915
cites work: Algorithms in real algebraic geometry
cites work: Q5188226
cites work: Separating linear forms and rational univariate representations of bivariate systems
cites work: Complete numerical isolation of real roots in zero-dimensional triangular systems
cites work: Q3902405
cites work: On the asymptotic and practical complexity of solving bivariate systems over the reals
cites work: Q3447174
cites work: Computer Algebra in Scientific Computing
cites work: Almost tight recursion tree bounds for the Descartes method
cites work: Real Algebraic Numbers: Complexity Analysis and Experimentation
cites work: The DMM bound
cites work: On the Davenport-Mahler bound
cites work: Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic
cites work: Q4226967
cites work: Q4391224
cites work: Sylvester-Habicht sequences and fast Cauchy index computation
cites work: Q3697106
cites work: A deterministic algorithm for isolating real roots of a real polynomial
cites work: From approximate factorization to root isolation with application to cylindrical algebraic decomposition
cites work: On the complexity of isolating real roots and computing with certainty the topological degree
cites work: Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
cites work: Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
cites work: Nearly optimal computations with structured matrices
cites work: On the boolean complexity of real root refinement
cites work: Change of order for bivariate triangular sets
cites work: Towards faster real algebraic numbers
cites work: Efficient isolation of polynomial's real roots.
cites work: When Newton meets Descartes
cites work: Univariate real root isolation in an extension field
cites work: On the complexity of real root isolation using continued fractions
cites work: Q4660692
cites work: An algorithm for isolating the real solutions of semi-algebraic systems
cites work: Real solution isolation using interval arithmetic
cites work: Q4953977
DOI: 10.1016/J.JSC.2017.12.001
description: scientific article; zbMATH DE number 6997074