A bibliography on roots of polynomials
From MaRDI portal
Publication:1313191
DOI10.1016/0377-0427(93)90064-IzbMath0788.65056OpenAlexW2090960299MaRDI QIDQ1313191
Publication date: 7 February 1994
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(93)90064-i
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to numerical analysis (65-00)
Related Items
An efficient method to find solutions for transcendental equations with several roots, Eigenvalue condition numbers and pseudospectra of Fiedler matrices, Scaled generalized Bernstein polynomials and containment regions for the zeros of polynomials, A rational cubic clipping method for computing real roots of a polynomial, Revisiting the problem of zeros of univariate scalar Béziers, An algorithm for locating all zeros of a real polynomial, On a cubically convergent derivative-free root finding method, The amended DSeSC power method for polynomial root-finding, RESOLUTION OF MULTIPLE ROOTS OF NONLINEAR POLYNOMIAL SYSTEMS, On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros, An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros, Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil, Enclosing clusters of zeros of polynomials, Ten methods to bound multiple roots of polynomials, Fast approach for computing roots of polynomials using cubic clipping, Inverse functions of polynomials and its applications to initialize the search of solutions of polynomials and polynomial systems, Finding all real roots of a polynomial by matrix algebra and the Adomian decomposition method, Inverse power and Durand-Kerner iterations for univariate polynomial root-finding, Root-finding by expansion with independent constraints, Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration., Algorithm 954, A supplementary bibliography: on roots of polynomials, Numerical computation of polynomial zeros by means of Aberth's method, Chebyshev-like root-finding methods with accelerated convergence, Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications, An efficient higher order family of root finders, An iterated eigenvalue algorithm for approximating roots of univariate polynomials, Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding, Improved algorithms for computing determinants and resultants, A computational comparison of the first nine members of a determinantal family of root-finding methods, On the new fourth-order methods for the simultaneous approximation of polynomial zeros, Removing multiplicities in \(\mathbb C\) by double Newtonization, Computing roots of polynomials by quadratic clipping, An updated supplementary bibliography on roots of polynomials, On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial, The polynomial pivots as initial values for a new root-finding iterative method, On truncated Taylor series and the position of their spurious zeros, Containment regions for zeros of polynomials from numerical ranges of companion matrices, Comments on some recent methods for the simultaneous determination of polynomial zeros
