Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems

DOI10.1145/321607.321615zbMath0215.27305OpenAlexW1998796062MaRDI QIDQ5618200

Brian T. Smith

Publication date: 1970

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321607.321615

Mathematics Subject Classification ID

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05)

Related Items (37)

Quasiseparable Hessenberg reduction of real diagonal plus low rank matrices and applications ⋮ On a class of matrix pencils and \(\ell\)-ifications equivalent to a given matrix polynomial ⋮ A precise estimation method for locations in an inverse logarithmic potential problem for point mass models ⋮ Some parallel methods for polynomial root-finding ⋮ Error-bounds for zeroes of polynomials using complex circular arithmetic ⋮ Determination of locations of point-like masses in an inverse source problem of the Poisson equation ⋮ On the convergence of the sequences of Gerschgorin-like disks ⋮ A comparison of methods for terminating polynomial iterations ⋮ Nonexistence results for tight block designs ⋮ Analytic continuation and Riemann surface determination of algebraic functions by computer ⋮ On some simultaneous methods based on Weierstrass' correction ⋮ Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method ⋮ Iteration Methods for Finding all Zeros of a Polynomial Simultaneously ⋮ Enclosing clusters of zeros of polynomials ⋮ Ten methods to bound multiple roots of polynomials ⋮ An existence and nonexistence theorem for solutions of nonlinear systems and its application to algebraic equations ⋮ A method for finding the zeros of polynomials using a companion matrix. ⋮ A general approach to isolating roots of a bitstream polynomial ⋮ Tighter bounds of errors of numerical roots ⋮ Numerical computation of polynomial zeros by means of Aberth's method ⋮ A new and novel method for computing an upper bound on the distance of an approximate zero from an exact zero of a univariate polynomial ⋮ Perturbation bounds for polynomials ⋮ An iterated eigenvalue algorithm for approximating roots of univariate polynomials ⋮ A new simultaneous method of fourth order for finding complex zeros in circular interval arithmetic ⋮ Generalizzazione del metodo di Laguerre ⋮ Durand-Kerner method for the real roots ⋮ A Spectral Method for a Nonpreemptive PriorityBMAP/G/1 QUEUE ⋮ Linear construction of companion matrices ⋮ A posteriori error bounds for the zeros of a polynomial ⋮ Some higher-order methods for the simultaneous approximation of multiple polynomial zeros ⋮ The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros ⋮ Simultaneous inclusion of the zeros of a polynomial ⋮ A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem ⋮ Improvement of a convergence condition for Durand-Kerner iteration ⋮ A generalized companion matrix of a polynomial and some applications ⋮ Inclusion of the roots of a polynomial based on Gerschgorin's theorem ⋮ A numerical realization of the conditions of Max Nöther's residual intersection theorem

This page was built for publication: Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems