Simultaneous inclusion of the zeros of a polynomial
From MaRDI portal
Publication:2562684
Cites work
- A posteriori error bounds for the zeros of a polynomial
- A posteriori error bounds for the zeros of polynomials
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
- Fehlerabschätzungen bei Polynomgleichungen mit dem Fixpunktsatz von Brouwer
- Maßnahmen zur globalen Konvergenzerzwingung beim Newtonschen Verfahren für spezielle nichtlineare Gleichungssysteme
- Minimale Gerschgorin‐Kreise
- On smallest isolated Gerschgorin disks for eigenvalues
- On smallest isolated Gerschgorin disks for eigenvalues
- On smallest isolated Gerschgorin disks for eigenvalues. II
- Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
- Über Eigenwerteinschließungen mit Hilfe von <scp>Gerschgorin</scp>‐Kreisen
Cited in
(28)- 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
- Locating multiple zeros interactively
- Error-bounds for zeroes of polynomials using complex circular arithmetic
- Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros
- On an iterative method for simultaneous inclusion of polynomial complex zeros
- Improvement of a convergence condition for Durand-Kerner iteration
- On some interval methods for algebraic, exponential and trigonometric polynomials
- Polynomial root finding by means of continuation
- Enclosing clusters of zeros of polynomials
- Ten methods to bound multiple roots of polynomials
- The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros
- Comments on some recent methods for the simultaneous determination of polynomial zeros
- Modified Newton method in circular interval arithmetic
- On some simultaneous methods based on Weierstrass' correction
- Some improved inclusion methods for polynomial roots with Weierstrass' corrections
- A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem
- An algorithm for the total, or partial, factorization of a polynomial
- Some modifications of Laguerre'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
- Some higher-order methods for the simultaneous approximation of multiple 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
- 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
- Numerical computation of polynomial zeros by means of Aberth's method
- On the convergence of the sequences of Gerschgorin-like disks
- Construction of zero-finding methods by Weierstrass functions
- Relationships between different types of initial conditions for simultaneous root finding methods
This page was built for publication: Simultaneous inclusion of the zeros of a polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2562684)
