Polynomial root computation by means of the LR algorithm

DOI10.1007/BF02510216zbMath0874.65038MaRDI QIDQ1359970

Luca Gemignani

Publication date: 15 July 1997

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

convergenceparallel computationLR algorithmpolynomial root finding

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) Parallel numerical computation (65Y05) Real polynomials: location of zeros (26C10)

Related Items

Computing a Hurwitz factorization of a polynomial

Uses Software

• na10
• NAPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of algorithms of decomposition type for the eigenvalue problem
• Das Verfahren der Treppeniteration und verwandte Verfahren zur Lösung algebraischer Eigenwertprobleme
• On the calculation of Jacobi matrices
• Pseudozeros of polynomials and pseudospectra of companion matrices
• A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
• The shifted QR algorithm for Hermitian matrices
• An analysis of the shifted LR algorithm
• Principles for Testing Polynomial Zerofinding Programs
• Computing a Factor of a Polynomial by Means of Multishift LR Algorithms
• A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
• On a companion operator for analytic functions