A CMV--based eigensolver for companion matrices
classification
🧮 math.NA
keywords
companionmatrixalgorithmappliedcmv--basedcmv-likecomputationallydesign
read the original abstract
In this paper we present a novel matrix method for polynomial rootfinding. By exploiting the properties of the QR eigenvalue algorithm applied to a suitable CMV-like form of a companion matrix we design a fast and computationally simple structured QR iteration.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.