Numerical impluimentation of a new algorithm for polynomials with multiple roots

DOI10.1080/10236199508808019zbMath0866.12007OpenAlexW1980618446MaRDI QIDQ4890062

Luigi Brugnano

Publication date: 20 October 1996

Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10236199508808019

zbMATH Keywords

algorithmLanczos methodtridiagonal matricesmultiplicitiesEuclidean algorithmnumerical implementationroots of a complex polynomial

Mathematics Subject Classification ID

Related Items (2)

Computing multiple roots of inexact polynomials ⋮ General polynomial roots and their multiplicities inO(N)memory andO(N²)Time^∗

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Matrix interpretations and applications of the continued fraction algorithm
• Reduction to Tridiagonal Form and Minimal Realizations
• A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
• Reduction of a General Matrix to Tridiagonal Form
• An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices

This page was built for publication: Numerical impluimentation of a new algorithm for polynomials with multiple roots