Efficient isolation of polynomial's real roots.
From MaRDI portal
Publication:1421215
DOI10.1016/j.cam.2003.08.015zbMath1040.65041OpenAlexW2077961479WikidataQ55894335 ScholiaQ55894335MaRDI QIDQ1421215
Paul Zimmermann, Fabrice Rouillier
Publication date: 26 January 2004
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2003.08.015
algorithmnumerical examplesunivariate polynomialbisection methodDescartes's rule of signsinterval-arithmetic filterisolation of real root
Interval and finite arithmetic (65G30) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)
Related Items
Continuous amortization and extensions: with applications to bisection-based root isolation, Near optimal subdivision algorithms for real root isolation, A rational cubic clipping method for computing real roots of a polynomial, Revisiting the problem of zeros of univariate scalar Béziers, Real algebraic numbers and polynomial systems of small degree, On multiple roots in Descartes' rule and their distance to roots of higher derivatives, A certified numerical algorithm for the topology of resultant and discriminant curves, Guaranteed collision detection with toleranced motions, A symbolic-numerical algorithm for isolating real roots of certain radical expressions, A Geometric Approach for Analyzing Parametric Biological Systems by Exploiting Block Triangular Structure, The first rational Chebyshev knots, A deterministic algorithm for isolating real roots of a real polynomial, On the topology and isotopic meshing of plane algebraic curves, Improved bounds for the CF algorithm, Exact symbolic-numeric computation of planar algebraic curves, A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration, Computing Chebyshev knot diagrams, Condition numbers for the cube. I: Univariate polynomials and hypersurfaces, Involutions of polynomially parametrized surfaces, Fast approach for computing roots of polynomials using cubic clipping, On the topology of real algebraic plane curves, An algorithm for addressing the real interval eigenvalue problem, Efficient and accurate computation of upper bounds of approximation errors, Symbolic Methods for Solving Algebraic Systems of Equations and Applications for Testing the Structural Stability, On the computing time of the continued fractions method, Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers, Trees and jumps and real roots., SLV, On the complexity of the Descartes method when using approximate arithmetic, Finding solutions of fuzzy polynomial equations systems by an Algebraic method, A general approach to isolating roots of a bitstream polynomial, SqFreeEVAL: An (almost) optimal real-root isolation algorithm, How to count the number of zeros that a polynomial has on the unit circle?, Vincent's theorem of 1836: overview and future research, A generic position based method for real root isolation of zero-dimensional polynomial systems, A Symbolic Computation Approach Towards the Asymptotic Stability Analysis of Differential Systems with Commensurate Delays, New bounds for the Descartes method, Root refinement for real polynomials using quadratic interval refinement, Computing real roots of real polynomials, Solving a sparse system using linear algebra, On the maximum computing time of the bisection method for real root isolation, Bound the number of limit cycles bifurcating from center of polynomial Hamiltonian system via interval analysis, Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm, On the complexity of real root isolation using continued fractions, Univariate real root isolation in an extension field and applications, A quadratic clipping step with superquadratic convergence for bivariate polynomial systems, Certified non-conservative tests for the structural stability of discrete multidimensional systems, Improved algorithms for computing determinants and resultants, Real solution isolation with multiplicity of zero-dimensional triangular systems, On the computation of an arrangement of quadrics in 3D, Topics in computational algebraic number theory, Certified approximation of parametric space curves with cubic \(B\)-spline curves, Complexity in iteration of polynomials, Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping, Exact, efficient, and complete arrangement computation for cubic curves, Intersecting quadrics: an efficient and exact implementation, From fixation probabilities to \(d\)-player games: an inverse problem in evolutionary dynamics, Real Root Isolation of Regular Chains, Logcf: an efficient tool for real root isolation, Thirty years of polynomial system solving, and now?, ISOLATE, A formal study of Bernstein coefficients and polynomials, Complete numerical isolation of real roots in zero-dimensional triangular systems, Quadric Arrangement in Classifying Rigid Motions of a 3D Digital Image, Isolating the real roots of the piecewise algebraic variety, Motivations for an arbitrary precision interval arithmetic and the MPFI library, Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
Uses Software
Cites Work
