Univariate polynomial root-finding by arming with constraints

DOI10.1145/2331684.2331702MaRDI QIDQ2819625zbMATH OpenOpenAlexFDO

Authors Victor Y. Pan

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.2331702

zbMATH Keywords

arming with constraintscomputations on matricescomputations on polynomialsconvolutionPFDpolynomial root-finding and factorizationSylvester matrices

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of roots of polynomial equations (65H04) Numerical computation of solutions to systems of equations (65H10) Parallel numerical computation (65Y05)

Recommendations

• Root-finding by expansion with independent constraints
• Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• New progress in real and complex polynomial root-finding
• Simple and nearly optimal polynomial root-finding by means of root radii approximation

Cited in

(4)

• Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
• Real polynomial root-finding by means of matrix and polynomial iterations
• scientific article; zbMATH DE number 1262456 (Why is no real title available?)
• Root-finding by expansion with independent constraints

This page was built for publication: Univariate polynomial root-finding by arming with constraints

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