Pages that link to "Item:Q2562684"
From MaRDI portal
The following pages link to Simultaneous inclusion of the zeros of a polynomial (Q2562684):
Displaying 28 items.
- Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros (Q597271) (← links)
- 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 (Q640522) (← links)
- Numerical computation of polynomial zeros by means of Aberth's method (Q676928) (← links)
- On the convergence of the sequences of Gerschgorin-like disks (Q857652) (← links)
- Construction of zero-finding methods by Weierstrass functions (Q879490) (← links)
- Relationships between different types of initial conditions for simultaneous root finding methods (Q901005) (← links)
- 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 (Q1004685) (← links)
- Locating multiple zeros interactively (Q1067359) (← links)
- Error-bounds for zeroes of polynomials using complex circular arithmetic (Q1094096) (← links)
- Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros (Q1112563) (← links)
- On an iterative method for simultaneous inclusion of polynomial complex zeros (Q1163339) (← links)
- Improvement of a convergence condition for Durand-Kerner iteration (Q1298639) (← links)
- On some interval methods for algebraic, exponential and trigonometric polynomials (Q1313251) (← links)
- Polynomial root finding by means of continuation (Q1377268) (← links)
- Enclosing clusters of zeros of polynomials (Q1398713) (← links)
- Ten methods to bound multiple roots of polynomials (Q1398714) (← links)
- The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros (Q1568729) (← links)
- Comments on some recent methods for the simultaneous determination of polynomial zeros (Q1612422) (← links)
- Modified Newton method in circular interval arithmetic (Q1904962) (← links)
- On some simultaneous methods based on Weierstrass' correction (Q1923458) (← links)
- Some improved inclusion methods for polynomial roots with Weierstrass' corrections (Q2365928) (← links)
- A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem (Q2562685) (← links)
- An algorithm for the total, or partial, factorization of a polynomial (Q4151651) (← links)
- Some modifications of Laguerre's method (Q4167477) (← links)
- Börsch-supan-like methods: point estimation and parallel implementation (Q4384045) (← links)
- 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 (Q4652860) (← links)
- Some higher-order methods for the simultaneous approximation of multiple polynomial zeros (Q4728106) (← links)
- On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros (Q4831432) (← links)
