Polynomial root computation by means of the LR algorithm

DOI10.1007/BF02510216MaRDI QIDQ1359970zbMATH OpenFDO

Authors L. Gemignani

Publication date 15 July 1997

Published in BIT (Search for Journal in Brave)

zbMATH Keywords

convergenceparallel computationpolynomial root findingLR algorithm

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05)

Recommendations

• Computing a Factor of a Polynomial by Means of Multishift LR Algorithms
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• A parallel algorithm for simple roots of polynomials
• New progress in real and complex polynomial root-finding

Cites work

• scientific article; zbMATH DE number 41472 (Why is no real title available?)
• scientific article; zbMATH DE number 3565290 (Why is no real title available?)
• scientific article; zbMATH DE number 3383473 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
• A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
• An analysis of the shifted LR algorithm
• Computing a Factor of a Polynomial by Means of Multishift LR Algorithms
• Convergence of algorithms of decomposition type for the eigenvalue problem
• Das Verfahren der Treppeniteration und verwandte Verfahren zur Lösung algebraischer Eigenwertprobleme
• On a companion operator for analytic functions
• On the calculation of Jacobi matrices
• Principles for Testing Polynomial Zerofinding Programs
• Pseudozeros of polynomials and pseudospectra of companion matrices
• The shifted QR algorithm for Hermitian matrices

Cited in

(2)

• Probabilistic algorithm for finding roots of linearized polynomials
• Computing a Hurwitz factorization of a polynomial

Describes a project that uses

Uses Software

• NAPACK
• na10

This page was built for publication: Polynomial root computation by means of the LR algorithm

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