A posteriori error bounds for the zeros of polynomials
From MaRDI portal
Publication:2395673
DOI10.1007/BF01385904zbMath0133.08401OpenAlexW2076634712MaRDI QIDQ2395673
Publication date: 1963
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131579
Numerical computation of roots of polynomial equations (65H04) Error analysis and interval analysis (65G99)
Related Items (34)
ON HIGHLY EFFICIENT SIMULTANEOUS SCHEMES FOR FINDING ALL POLYNOMIAL ROOTS ⋮ Scaled parallel iterative method for finding real roots of nonlinear equations ⋮ Point estimation of simultaneous methods for solving polynomial equations: A survey. II. ⋮ Error-bounds for zeroes of polynomials using complex circular arithmetic ⋮ On the convergence of the sequences of Gerschgorin-like disks ⋮ On nonlinear SOR-like methods. I: Applications to simultaneous methods for polynomial zeros ⋮ On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros ⋮ On some methods for the simultaneous determination of polynomial zeros ⋮ Construction of zero-finding methods by Weierstrass functions ⋮ Point estimation and some applications to iterative methods ⋮ A general method to generate parallel iterations for finding all zeros of polynomial simultaneously ⋮ Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method ⋮ On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots ⋮ On an iterative method for simultaneous inclusion of polynomial complex zeros ⋮ A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial ⋮ On the convergence order of a modified method for simultaneous finding polynomial zeros ⋮ Stability of stationary solutions of a one-dimensional parabolic equation with homogeneous Neumann boundary conditions ⋮ Numerical computation of polynomial zeros by means of Aberth's method ⋮ Point estimation of simultaneous methods for solving polynomial equations: A survey ⋮ An algorithm for the total, or partial, factorization of a polynomial ⋮ Computational efficiency of some combined methods for polynomial equations ⋮ Fehlerabschätzungen bei Polynomgleichungen mit dem Fixpunktsatz von Brouwer ⋮ Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation ⋮ Fehlerschranken zu Näherungswerten von Polynomwurzeln ⋮ A posteriori error bounds for the zeros of a polynomial ⋮ Some higher-order methods for the simultaneous approximation of multiple polynomial zeros ⋮ The self-validated method for polynomial zeros of high efficiency ⋮ Simultaneous inclusion of the zeros of a polynomial ⋮ On a family of parallel root-finding methods for generalized polynomials ⋮ A note on some improvements of the simultaneous methods for determination of polynomial zeros ⋮ An effective implementation of a modified Laguerre method for the roots of a polynomial ⋮ A family of simultaneous methods for the determination of polynomial complex zeros ⋮ An improvement of Gargantini's simultaneous inclusion method for polynomial roots by Schröder's correction ⋮ Coefficient-free adaptations of polynomial root-finders
Cites Work
This page was built for publication: A posteriori error bounds for the zeros of polynomials
