A CMV--based eigensolver for companion matrices
Numerical Analysis
2018-11-15 v1
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.
Cite
@article{arxiv.1406.2820,
title = {A CMV--based eigensolver for companion matrices},
author = {Roberto Bevilacqua and Gianna M. Del Corso and Luca gemignani},
journal= {arXiv preprint arXiv:1406.2820},
year = {2018}
}
Comments
14 pages, 4 figures