Computing clustered close-roots of univariate polynomials

DOI10.1145/1577190.1577217MaRDI QIDQ2959032zbMATH OpenOpenAlexFDO

Authors Tateaki Sasaki, Akira Terui

Publication date 3 February 2017

Published in Proceedings of the 2009 conference on Symbolic numeric computation (Search for Journal in Brave)

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

zbMATH Keywords

approximate square-free decompositionclose rootsDurand-Kerner's methoderror boundspolynomial root-finding

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Recommendations

• An algebraic method for separating close-root clusters and the minimum root separation
• Finding a cluster of zeros of univariate polynomials
• Simple and nearly optimal polynomial root-finding by means of root radii approximation
• Ten methods to bound multiple roots of polynomials
• Detection and validation of clusters of polynomial zeros

Cited in

(11)

• Closed formula for univariate subresultants in multiple roots
• Dilation method for finding close roots of polynomials based on constrained learning neural networks
• Tighter bounds of errors of numerical roots
• Near optimal subdivision algorithms for real root isolation
• Complexity Analysis of Root Clustering for a Complex Polynomial
• An algebraic method for separating close-root clusters and the minimum root separation
• scientific article; zbMATH DE number 6103907 (Why is no real title available?)
• New Practical Advances in Polynomial Root Clustering
• A theorem for separating close roots of a polynomial and its derivatives
• Rational cubic clipping with linear complexity for computing roots of polynomials
• Zero-clusters of polynomials: best approach in supercomputing era

This page was built for publication: Computing clustered close-roots of univariate polynomials

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