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

DOI10.1137/S0895479894277442zbMATH Open0915.65037MaRDI QIDQ4389067FDOQ4389067

Authors: L. Gemignani 

Publication date: 11 May 1998

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

Recommendations

• Polynomial root computation by means of the LR algorithm
• On One Method for Factorization of Algebraic Polynomials
• Analysis of approximate factorization algorithm. I
• scientific article; zbMATH DE number 1262457

zbMATH Keywords

algorithmcomplexityglobal convergencenumerical experimentseigenvalue computationfactorization of polynomialsmatrix transformsfunctional iterationsLR algorithms

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• Polynomial root computation by means of the LR algorithm
• Computing a Hurwitz factorization of a polynomial

Uses Software

• na10

This page was built for publication: Computing a Factor of a Polynomial by Means of Multishift LR Algorithms

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