Positive root isolation for poly-powers by exclusion and differentiation

DOI10.1016/J.JSC.2017.07.007zbMATH Open1378.68200OpenAlexW2735589526MaRDI QIDQ2409014FDOQ2409014

Zhibin Li, Jing-Cao Li, Cheng-Chao Huang, Ming Xu

Publication date: 10 October 2017

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2017.07.007

zbMATH Keywords

systems biologyinterval arithmetictranscendental numbergeneralized polynomialreal root isolation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Systems biology, networks (92C42) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast projection methods for minimal design problems in linear system theory
• Partial cylindrical algebraic decomposition for quantifier elimination
• Solving zero-dimensional systems through the rational univariate representation
• Reachability analysis of rational eigenvalue linear systems
• On Schanuel's conjectures
• Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests
• Computing real roots of real polynomials
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• An algorithm for isolating the real solutions of semi-algebraic systems
• Transcendental Numbers. (AM-16)
• Complexity estimates depending on condition and round-off error
• Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
• Computing the real roots of a polynomial by the exclusion algorithm
• Symbolic reachability computation for families of linear vector fields
• How to recognize zero?
• Real root isolation for tame elementary functions
• Quantifier elimination for a class of exponential polynomial formulas
• Deciding polynomial-exponential problems
• Cylindrical decomposition for systems transcendental in the first variable
• Deciding polynomial-transcendental problems
• Nearly optimal refinement of real roots of a univariate polynomial
• Generalized Budan--Fourier theorem and virtual roots
• Complexity Analysis of Root Clustering for a Complex Polynomial
• Some decidable results on reachability of solvable systems
• Generalized polynomial approximation
• Eventual Disconjugacy of Selfadjoint Fourth Order Linear Differential Equations
• Positive Root Isolation for Poly-Powers

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Reachability analysis of linear systems
• Isolating all the real roots of a mixed trigonometric-polynomial
• Title not available (Why is that?)
• A conflict-driven solving procedure for poly-power constraints

Uses Software

• QEPCAD
• REACH
• ISOLATE

This page was built for publication: Positive root isolation for poly-powers by exclusion and differentiation

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