A bibliography on roots of polynomials

From MaRDI portal
Publication:1313191


DOI10.1016/0377-0427(93)90064-IzbMath0788.65056MaRDI QIDQ1313191

John Michael McNamee

Publication date: 7 February 1994

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)


30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)

65H05: Numerical computation of solutions to single equations

26C10: Real polynomials: location of zeros

65-00: General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to numerical analysis


Related Items

On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros, On a cubically convergent derivative-free root finding method, RESOLUTION OF MULTIPLE ROOTS OF NONLINEAR POLYNOMIAL SYSTEMS, Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications, A computational comparison of the first nine members of a determinantal family of root-finding methods, A supplementary bibliography: on roots of polynomials, Numerical computation of polynomial zeros by means of Aberth's method, An iterated eigenvalue algorithm for approximating roots of univariate polynomials, Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding, Removing multiplicities in \(\mathbb C\) by double Newtonization, Computing roots of polynomials by quadratic clipping, On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial, Enclosing clusters of zeros of polynomials, Ten methods to bound multiple roots of polynomials, Inverse power and Durand-Kerner iterations for univariate polynomial root-finding, Containment regions for zeros of polynomials from numerical ranges of companion matrices, Comments on some recent methods for the simultaneous determination of polynomial zeros, Improved algorithms for computing determinants and resultants, An updated supplementary bibliography on roots of polynomials, An algorithm for locating all zeros of a real polynomial, An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros, Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration., Scaled generalized Bernstein polynomials and containment regions for the zeros of polynomials, The amended DSeSC power method for polynomial root-finding, An efficient higher order family of root finders, On truncated Taylor series and the position of their spurious zeros