Logcf: an efficient tool for real root isolation
From MaRDI portal
Publication:2287381
DOI10.1007/s11424-019-7361-7zbMath1494.68310arXiv1209.3555OpenAlexW2995945776WikidataQ126589028 ScholiaQ126589028MaRDI QIDQ2287381
Han-Wen Zhang, Bican Xia, Liyun Dai, Zhe Fan
Publication date: 20 January 2020
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.3555
Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: factorization (12D05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A deterministic algorithm for isolating real roots of a real polynomial
- Bounds for absolute positiveness of multivariate polynomials
- Efficient isolation of polynomial's real roots.
- Complexity of real root isolation using continued fractions
- Real solution isolation using interval arithmetic
- A new method for real root isolation of univariate polynomials
- On the complexity of real root isolation using continued fractions
- Computing Real Roots of Real Polynomials ... and now For Real!
- Architecture-aware classical Taylor shift by 1
- SLV
- Computer Algebra in Scientific Computing
This page was built for publication: Logcf: an efficient tool for real root isolation