Empirical study of an evaluation-based subdivision algorithm for complex root isolation

DOI10.1145/2331684.2331710MaRDI QIDQ2819634zbMATH OpenOpenAlexFDO

Authors Narayan Kamath, Irina Voiculescu, Chee K. Yap

Publication date 29 September 2016

Published in Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2331684.2331710

zbMATH Keywords

subdivision algorithmsinterval Newton methodscomplex root isolationCeval algorithmsolving bi-variate systems

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Recommendations

• A simple but exact and efficient algorithm for complex root isolation
• Near optimal subdivision algorithms for real root isolation
• A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
• SqFreeEVAL: An (almost) optimal real-root isolation algorithm
• Near optimal subdivision algorithms for real root isolation

Cited in

(4)

• A simple but exact and efficient algorithm for complex root isolation
• Near optimal subdivision algorithms for real root isolation
• Evaluation algorithm of root canal shape based on Steklov spectrum analysis
• Exact symbolic-numeric computation of planar algebraic curves

Describes a project that uses

Uses Software

• MPSolve

This page was built for publication: Empirical study of an evaluation-based subdivision algorithm for complex root isolation

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