Polynomial zerofinders based on Szegö polynomials

Files
Ammar_Polynomial zerofinders based on Szeg.pdf (184.71 KB)
Authors
Ammar, G.S.
Calvetti, D.
Gragg, W.B.
Reichel, L.
Advisors
Second Readers
Subjects
Szegö-Hessenberg matrix
companion matrix
eigenvalue problem
continuation method
parallel computation
Date of Issue
2014
Date
Publisher
Language
Abstract
Type
Article
Description
The computation of zeros of polynomials is a classical computational problem. This paper presents two new zerofinders that are based on the observation that, after a suitable change of variable, any polynomial can be considered a member of a family of Szegö polynomials. Numerical experiments indicate that these methods generally give higher accuracy than computing the eigenvalues of the companion matrix associated with the polynomial.
URI
https://hdl.handle.net/10945/41067
Series/Report No
Department
Organization
Identifiers
NPS Report Number
Sponsors
Funding
Format
Citation
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections
Publications