Polynomial root computation by means of the LR algorithm
type: Item
instance of: scholarly article
title: Polynomial root computation by means of the LR algorithm
zbMATH Open document ID: 0874.65038
DOI: 10.1007/BF02510216
author: L. Gemignani
published in: BIT
publication date: 1997-07-15T00:00:00Z
Mathematics Subject Classification ID: 65H05
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 26C10
Mathematics Subject Classification ID: 30C15
zbMATH DE Number: 1033763
zbMATH Keywords: polynomial root finding
zbMATH Keywords: parallel computation
zbMATH Keywords: LR algorithm
zbMATH Keywords: convergence
describes a project that uses: NAPACK
describes a project that uses: na10
MaRDI profile type: Publication
cites work: Das Verfahren der Treppeniteration und verwandte Verfahren zur Lösung algebraischer Eigenwertprobleme
cites work: An analysis of the shifted LR algorithm
cites work: The shifted QR algorithm for Hermitian matrices
cites work: Computing a Factor of a Polynomial by Means of Multishift LR Algorithms
cites work: Q3994560
cites work: A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
cites work: A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
cites work: Principles for Testing Polynomial Zerofinding Programs
cites work: On the calculation of Jacobi matrices
cites work: Q4137395
cites work: Q5653524
cites work: On a companion operator for analytic functions
cites work: Pseudozeros of polynomials and pseudospectra of companion matrices
cites work: Convergence of algorithms of decomposition type for the eigenvalue problem
cites work: Q5674306
description: scientific article; zbMATH DE number 1033763