Simultaneous inclusion of the zeros of a polynomial
From MaRDI portal
Publication:2562684
DOI10.1007/BF01436301zbMath0267.65036OpenAlexW2075068708MaRDI QIDQ2562684
Dietrich Braess, Karl Peter Hadeler
Publication date: 1973
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132221
Related Items (28)
Some improved inclusion methods for polynomial roots with Weierstrass' corrections ⋮ Error-bounds for zeroes of polynomials using complex circular arithmetic ⋮ On the convergence of the sequences of Gerschgorin-like disks ⋮ Modified Newton method in circular interval arithmetic ⋮ Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros ⋮ On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros ⋮ Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros ⋮ Polynomial root finding by means of continuation ⋮ Construction of zero-finding methods by Weierstrass functions ⋮ On some simultaneous methods based on Weierstrass' correction ⋮ Enclosing clusters of zeros of polynomials ⋮ Ten methods to bound multiple roots of polynomials ⋮ Relationships between different types of initial conditions for simultaneous root finding methods ⋮ The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. II: Round-off error analysis by use of interval arithmetic ⋮ On an iterative method for simultaneous inclusion of polynomial complex zeros ⋮ Numerical computation of polynomial zeros by means of Aberth's method ⋮ Börsch-supan-like methods: point estimation and parallel implementation ⋮ 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 ⋮ An algorithm for the total, or partial, factorization of a polynomial ⋮ Some modifications of Laguerre's method ⋮ The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. I: Correction methods ⋮ 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 ⋮ A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem ⋮ Improvement of a convergence condition for Durand-Kerner iteration ⋮ On some interval methods for algebraic, exponential and trigonometric polynomials ⋮ Locating multiple zeros interactively ⋮ Comments on some recent methods for the simultaneous determination of polynomial zeros
Cites Work
- A posteriori error bounds for the zeros of polynomials
- Fehlerabschätzungen bei Polynomgleichungen mit dem Fixpunktsatz von Brouwer
- On smallest isolated Gerschgorin disks for eigenvalues. II
- Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- A posteriori error bounds for the zeros of a polynomial
- Maßnahmen zur globalen Konvergenzerzwingung beim Newtonschen Verfahren für spezielle nichtlineare Gleichungssysteme
- Minimale Gerschgorin‐Kreise
- Über Eigenwerteinschließungen mit Hilfe von <scp>Gerschgorin</scp>‐Kreisen
- Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
- On smallest isolated Gerschgorin disks for eigenvalues
- On smallest isolated Gerschgorin disks for eigenvalues
This page was built for publication: Simultaneous inclusion of the zeros of a polynomial
