Show simple item record

dc.contributor.authorAmmar, G.S.
dc.contributor.authorCalvetti, D.
dc.contributor.authorGragg, W.B.
dc.contributor.authorReichel, L.
dc.date.accessioned2014-05-05T15:53:45Z
dc.date.available2014-05-05T15:53:45Z
dc.date.issued2014
dc.identifier.urihttps://hdl.handle.net/10945/41067
dc.descriptionThe 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.en_US
dc.descriptionThe 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.en_US
dc.publisherMonterey, California. Naval Postgraduate Schoolen_US
dc.publisherMonterey, California. Naval Postgraduate Schoolen_US
dc.rightsThis 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.en_US
dc.titlePolynomial zerofinders based on Szegö polynomialsen_US
dc.typeArticleen_US
dc.contributor.departmentGraduate School of Business and Public Policy (GSBPP)
dc.subject.authorSzegö-Hessenberg matrixen_US
dc.subject.authorcompanion matrixen_US
dc.subject.authoreigenvalue problemen_US
dc.subject.authorcontinuation methoden_US
dc.subject.authorparallel computationen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record