Modifications of Newton's method for even-grade palindromic polynomials and other twined polynomials

DOI10.1007/s11075-012-9618-2zbMath1263.65045OpenAlexW2030356588MaRDI QIDQ695611

Vanni Noferini, Luca Gemignani

Publication date: 21 December 2012

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-012-9618-2

zbMATH Keywords

algorithmnumerical resultsNewton's methodaccuracypalindromic polynomialpolynomial root-findingsymmetric division

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Related Items (3)

SOME ANALYTICAL AND NUMERICAL RESULTS FOR THE ZEROS OF A CLASS OF FIBONACCI-LIKE POLYNOMIALS ⋮ Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method ⋮ On the simultaneous refinement of the zeros of H-palindromic polynomials

Uses Software

• na20

Cites Work

• Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
• Implicit QR algorithms for palindromic and even eigenvalue problems
• General theory of regular matrix polynomials and band Toeplitz operators
• Spectral fractorization of Laurent polynomials
• Design, analysis, and implementation of a multiprecision polynomial rootfinder
• The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis
• Symmetric subresultants and applications
• Smith forms of palindromic matrix polynomials
• The behavior of the complete eigenstructure of a polynomial matrix under a generic rational transformation
• The Derivative of a Determinant
• Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
• Explicit inverses of some tridiagonal matrices

This page was built for publication: Modifications of Newton's method for even-grade palindromic polynomials and other twined polynomials