Polynomial roots: The ultimate answer?

DOI10.1016/0024-3795(93)00341-VMaRDI QIDQ1899387zbMATH OpenFDO

Authors Luigi Brugnano, Donato Trigiante

Publication date 9 October 1995

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(93)00341-V

zbMATH Keywords

block diagonal matrixconvergenceeigenvaluesnumerical resultsQR factorizationroots of a polynomialtridiagonal matrix

Mathematics Subject Classification ID

Integral representations of finite groups (20C10) 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 eigenvalues and eigenvectors of matrices (65F15) Numerical computation of solutions to single equations (65H05)

Review text

The authors present a procedure which is able to find all the roots of a polynomial along with the respective multiplicities. The procedure consists in the construction of a block diagonal matrix whose blocks are tridiagonal with only simple eigenvalues. The tridiagonal matrix may be constructed either numerically or formally. Once the block diagonal matrix is obtained, the order of convergence of the proposed procedure is that of the QR factorization method for tridiagonal matrices and for simple eigenvalues. Finally, some numerical results are analysed.

Recommendations

• scientific article; zbMATH DE number 4173314
• scientific article; zbMATH DE number 1505492
• scientific article; zbMATH DE number 3014392
• Polynomial root-finding and polynomiography
• scientific article; zbMATH DE number 1003258
• Polynomial root finding by means of continuation
• Root-refining for a polynomial equation
• Roots of polynomials with dominant term
• A systematic approach to the exact roots of polynomials

Cites work

• A Globally Convergent Method for Simultaneously Finding Polynomial Roots
• A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• scientific article; zbMATH DE number 3137333 (Why is no real title available?)
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• Reduction of a General Matrix to Tridiagonal Form
• Reduction to Tridiagonal Form and Minimal Realizations
• Simultaneous determination of polynomial roots and multiplicities: An algorithm and related problems

Cited in

(9)

• Bounds for the zeros of polynomials from eigenvalues and singular values of some companion matrices
• A method for finding the zeros of polynomials using a companion matrix.
• A composite polynomial zerofinding matrix algorithm
• When should a polynomial’s root nearest to a real number be real itself?
• General polynomial roots and their multiplicities inO(N)memory andO(N²)Time^∗
• Continued fractions as dynamical systems
• Computing multiple roots of inexact polynomials
• Finding all real roots of a polynomial by matrix algebra and the Adomian decomposition method
• Computing the Jordan structure of an eigenvalue

This page was built for publication: Polynomial roots: The ultimate answer?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1899387)