An iterated eigenvalue algorithm for approximating roots of univariate polynomials
type: Item
instance of: scholarly article
title: An iterated eigenvalue algorithm for approximating roots of univariate polynomials
zbMATH Open document ID: 1004.65060
author: Steven Fortune
published in: Journal of Symbolic Computation
publication date: 2002-09-17T00:00:00Z
review text: The author studies an iterative algorithm that approximates all roots of a univariate polynomial. The iteration is based on floating-point computation of the eigenvalues of a generalized companion matrix. A few interesting examples including ill-conditioned polynomials are carefully implemented for the algorithms.
Mathematics Subject Classification ID: 65H05
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 26C10
Mathematics Subject Classification ID: 30C15
zbMATH DE Number: 1801676
zbMATH Keywords: univariate polynomials
zbMATH Keywords: eigenvalue
zbMATH Keywords: root
zbMATH Keywords: numerical examples
zbMATH Keywords: iterative algorithm
zbMATH Keywords: companion matrix
reviewed by: Matthew He
describes a project that uses: LAPACK
describes a project that uses: EISPACK
describes a project that uses: Eigensolve
describes a project that uses: Hull
describes a project that uses: MPFUN
describes a project that uses: na20
MaRDI profile type: Publication
full work available at URL: jsco.2002.0526
OpenAlex ID: W2079536609
cites work: Q4841244
cites work: Design, analysis, and implementation of a multiprecision polynomial rootfinder
cites work: Q4230363
cites work: On condition numbers and the distance to the nearest ill-posed problem
cites work: Q4348513
cites work: Polynomial Roots from Companion Matrix Eigenvalues
cites work: A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem
cites work: Expressing a polynomial as the characteristic polynomial of a symmetric matrix
cites work: Polynomial root finding using iterated Eigenvalue computation
cites work: Q4072022
cites work: Polynomial zerofinding iterative matrix algorithms
cites work: A composite polynomial zerofinding matrix algorithm
cites work: A bibliography on roots of polynomials
cites work: Solving a Polynomial Equation: Some History and Recent Progress
cites work: Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
cites work: Matrix eigensystem routines - EISPACK guide. 2nd ed
cites work: Convergence conditions of some methods for the simultaneous computation of polynomial zero
cites work: Pseudozeros of polynomials and pseudospectra of companion matrices
cites work: The eigenstructure of an arbitrary polynomial matrix: Computational aspects
cites work: Q4953977
DOI: 10.1006/JSCO.2002.0526
description: scientific article; zbMATH DE number 1801676