The amended DSeSC power method for polynomial root-finding

DOI10.1016/j.camwa.2004.09.011zbMath1077.65049OpenAlexW2150665371MaRDI QIDQ2387379

Pan, Victor Y.

Publication date: 2 September 2005

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2004.09.011

zbMATH Keywords

algorithmconvergenceeigenvaluesFrobenius matrixmultiple rootspolynomial root-finderroot clusters

Mathematics Subject Classification ID

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)

Related Items

An iterative method to compute the dominant zero of a quaternionic unilateral polynomial, Efficient polynomial root-refiners: a survey and new record efficiency estimates, Root-squaring with DPR1 matrices, Additive preconditioning, eigenspaces, and the inverse iteration, Rational inversion of the Laplace transform, New progress in real and complex polynomial root-finding, Real polynomial root-finding by means of matrix and polynomial iterations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A supplementary bibliography: on roots of polynomials
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• A bibliography on roots of polynomials
• Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
• A 2002 update of the supplementary bibliography on roots of polynomials
• Improved initialization of the accelerated and robust QR-like polynomial root-finding
• Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
• An updated supplementary bibliography on roots of polynomials
• Computation of approximate polynomial GCDs and an extension
• Optimal and nearly optimal algorithms for approximating polynomial zeros
• Multivariate polynomials, duality, and structured matrices
• Generalizations of an algorithm of Sebastião e Silva
• Matrix Algorithms
• Solving a Polynomial Equation: Some History and Recent Progress