Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence

DOI10.1155/2012/167927zbMath1251.65070OpenAlexW2099163837WikidataQ58905801 ScholiaQ58905801MaRDI QIDQ1760574

Nor'aini Aris, Ali Abd Rahman, Saeid Saidanlu

Publication date: 15 November 2012

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/167927

zbMATH Keywords

initial approximationsNewbery's matrix constructionpolynomial zerofinding

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items

The polynomial pivots as initial values for a new root-finding iterative method

Uses Software

• MultRoot

Cites Work

• Unnamed Item
• Unnamed Item
• A real symmetric tridiagonal matrix with a given characteristic polynomial
• Polynomial zerofinding iterative matrix algorithms
• Method for finding multiple roots of polynomials
• A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
• Expressing a polynomial as the characteristic polynomial of a symmetric matrix
• Generalizations of Laguerre’s Method: Higher Order Methods
• Some modifications of Laguerre's method
• The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence
• Computing multiple roots of inexact polynomials
• A family of test matrices