A comprehensive perturbation theorem for estimating magnitudes of roots of polynomials

  • M. Pakdemirli
  • , G. Sari

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

A comprehensive new perturbation theorem is posed and proven to estimate the magnitudes of roots of polynomials. The theorem successfully determines the magnitudes of roots for arbitrary degree of polynomial equations with no restrictions on the coefficients. In the previous papers Pakdemirli and Elmas, Appl. Math. Comput. 216 (2010) 1645-1651' and Pakdemirli and Yurtsever, Appl. Math. Comput. 188 (2007) 2025-2028', the given theorems were valid only for some restricted coefficients. The given theorem in this work is a generalization and uni cation of the past theorems and valid for arbitrary coefficients. Numerical applications of the theorem are presented as examples. It is shown that the theorem produces good estimates for the magnitudes of roots of polynomial equations of arbitrary order and unrestricted coefficients.

Original languageEnglish
Pages (from-to)1-8
Number of pages8
JournalLMS Journal of Computation and Mathematics
Volume16
DOIs
StatePublished - Jun 2013

ASJC Scopus subject areas

  • General Mathematics
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'A comprehensive perturbation theorem for estimating magnitudes of roots of polynomials'. Together they form a unique fingerprint.

Cite this