When Newton meets Descartes

From MaRDI portal
Publication:5244548

DOI10.1145/2442829.2442872zbMath1323.65050arXiv1109.6279OpenAlexW1997509004MaRDI QIDQ5244548

Michael Sagraloff

Publication date: 27 March 2015

Published in: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.6279




Related Items (20)

Near optimal subdivision algorithms for real root isolationA symbolic-numerical algorithm for isolating real roots of certain radical expressionsOn the complexity of computing the topology of real algebraic space curvesOn the topology and isotopic meshing of plane algebraic curvesA note on Legendre-Fenchel conjugate of the product of two positive-definite quadratic formsImproved bounds for the CF algorithmA near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iterationIsolating clusters of zeros of analytic systems using arbitrary-degree inflationThe complexity of subdivision for diameter-distance testsNearly optimal refinement of real roots of a univariate polynomialCertified rational parametric approximation of real algebraic space curves with local generic position methodOn the complexity of the Descartes method when using approximate arithmeticSeparating linear forms and rational univariate representations of bivariate systemsA generic position based method for real root isolation of zero-dimensional polynomial systemsComputing real roots of real polynomialsFrom approximate factorization to root isolation with application to cylindrical algebraic decompositionUnivariate real root isolation in an extension field and applicationsInteger polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sortingTheorem of three circles in CoqOn soft predicates in subdivision motion planning




This page was built for publication: When Newton meets Descartes