A bibliography on roots of polynomials

A comparison of methods for accelerating convergence of Newton's method for multiple polynomial roots

ACM SIGNUM Newsletter

Polynomial root finding using iterated Eigenvalue computation

Proceedings of the 2001 international symposium on Symbolic and algebraic computation

Univariate polynomials: nearly optimal algorithms for factorization and rootfinding

Proceedings of the 2001 international symposium on Symbolic and algebraic computation

An iterated eigenvalue algorithm for approximating roots of univariate polynomials

Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001

Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding

Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001

A 2002 update of the supplementary bibliography on roots of polynomials

Journal of Computational and Applied Mathematics

Letter to the Editor: comments on some recent methods for the simultaneous determination of polynomial zeros

Journal of Computational and Applied Mathematics

Enclosing clusters of zeros of polynomials

Journal of Computational and Applied Mathematics

Ten methods to bound multiple roots of polynomials

Journal of Computational and Applied Mathematics

Polynomiography and applications in art, education, and science

ACM SIGGRAPH 2003 Educators Program

Algorithm 835: MultRoot---a Matlab package for computing polynomial roots and multiplicities

ACM Transactions on Mathematical Software (TOMS)

Improved algorithms for computing determinants and resultants

Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops

On truncated Taylor series and the position of their spurious zeros

Applied Numerical Mathematics

Animation of mathematical concepts using polynomiography

SIGGRAPH '04 ACM SIGGRAPH 2004 Educators program

Scaled generalized Bernstein polynomials and containment regions for the zeros of polynomials

Journal of Computational and Applied Mathematics

Real root-finding

Proceedings of the 2007 international workshop on Symbolic-numeric computation

An efficient higher order family of root finders

Journal of Computational and Applied Mathematics

On a cubically convergent derivative-free root finding method

International Journal of Computer Mathematics

Fast approach for computing roots of polynomials using cubic clipping

Computer Aided Geometric Design

The approximate irreducible factorization of a univariate polynomial: revisited

Proceedings of the 2009 international symposium on Symbolic and algebraic computation

On truncated Taylor series and the position of their spurious zeros

Applied Numerical Mathematics

The amended DSeSC power method for polynomial root-finding

Computers & Mathematics with Applications

Polynomial based analog source-channel codes

IEEE Transactions on Communications

Topologically guaranteed univariate solutions of underconstrained polynomial systems via no-loop and single-component tests

Proceedings of the 14th ACM Symposium on Solid and Physical Modeling

Algebraic and numerical algorithms

Algorithms and theory of computation handbook

On the new fourth-order methods for the simultaneous approximation of polynomial zeros

Journal of Computational and Applied Mathematics

A simple but exact and efficient algorithm for complex root isolation

Proceedings of the 36th international symposium on Symbolic and algebraic computation

Inverse functions of polynomials and its applications to initialize the search of solutions of polynomials and polynomial systems

Numerical Algorithms

Root-finding by expansion with independent constraints

Computers & Mathematics with Applications

Solving polynomial systems using no-root elimination blending schemes

Computer-Aided Design

Solving polynomial systems using no-root elimination blending schemes

Computer-Aided Design

Global solutions of well-constrained transcendental systems using expression trees and a single solution test

GMP'10 Proceedings of the 6th international conference on Advances in Geometric Modeling and Processing

Global solutions of well-constrained transcendental systems using expression trees and a single solution test

Computer Aided Geometric Design

Univariate polynomial root-finding by arming with constraints

Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation

On the infinite families of zero bounds of complex polynomials

Journal of Computational and Applied Mathematics