Computing a Factor of a Polynomial by Means of Multishift LR Algorithms

DOI10.1137/S0895479894277442zbMath0915.65037MaRDI QIDQ4389067

Luca Gemignani

Publication date: 11 May 1998

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

complexityalgorithmglobal convergencenumerical experimentsfactorization of polynomialseigenvalue computationmatrix transformsfunctional iterationsLR algorithms

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)

Related Items

Polynomial root computation by means of the LR algorithm, Computing a Hurwitz factorization of a polynomial

Uses Software

• na10