Polynomial zerofinders based on Szegö polynomials
| dc.contributor.author | Ammar, G.S. | |
| dc.contributor.author | Calvetti, D. | |
| dc.contributor.author | Gragg, W.B. | |
| dc.contributor.author | Reichel, L. | |
| dc.date.accessioned | 2014-05-05T15:53:45Z | |
| dc.date.available | 2014-05-05T15:53:45Z | |
| dc.date.issued | 2014 | |
| dc.identifier.uri | https://hdl.handle.net/10945/41067 | |
| dc.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. | en_US |
| dc.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. | en_US |
| dc.publisher | Monterey, California. Naval Postgraduate School | en_US |
| dc.publisher | Monterey, California. Naval Postgraduate School | en_US |
| dc.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. | en_US |
| dc.title | Polynomial zerofinders based on Szegö polynomials | en_US |
| dc.type | Article | en_US |
| dc.contributor.department | Graduate School of Business and Public Policy (GSBPP) | |
| dc.subject.author | Szegö-Hessenberg matrix | en_US |
| dc.subject.author | companion matrix | en_US |
| dc.subject.author | eigenvalue problem | en_US |
| dc.subject.author | continuation method | en_US |
| dc.subject.author | parallel computation | en_US |
Files in this item
This item appears in the following Collection(s)
Related items
Showing items related by title, author, creator and subject.
-
On optimal parameter of Laguerre’s family of zero-finding methods
(Taylor & Francis, 2017-12-24);A one parameter Laguerre's family of iterative methods for solving nonlinear equations is considered. This family includes the Halley, Ostrowski and Euler methods, most frequently used one-point third-order methods ... -
Exploring fields with shift registers
(Monterey, California. Naval Postgraduate School, 2006-09);The S-Boxes used in the AES algorithm are generated by field extensions of the Galois field over two elements, called GF(2). Therefore, understanding the field extensions provides a method of analysis, potentially efficient ... -
Pascal polynomials over GF(2)
(Monterey, California. Naval Postgraduate School, 2008-06);The Discrete Logarithm Problem (DLP) is a fundamental cryptographic primitive. The DLP is defined for any cyclic group, specifically finite fields, whether the integers modulo a prime p or a polynomial field of characteristic ...
