Pages that link to "Item:Q2562685"
From MaRDI portal
The following pages link to A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem (Q2562685):
Displayed 18 items.
- Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
- Numerical computation of polynomial zeros by means of Aberth's method (Q676928) (← links)
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials (Q697487) (← links)
- Linear construction of companion matrices (Q753896) (← links)
- Inclusion of the roots of a polynomial based on Gerschgorin's theorem (Q804231) (← links)
- Coefficient-free adaptations of polynomial root-finders (Q814095) (← links)
- On the convergence of the sequences of Gerschgorin-like disks (Q857652) (← 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)
- A generalized companion matrix of a polynomial and some applications (Q1055849) (← links)
- Error-bounds for zeroes of polynomials using complex circular arithmetic (Q1094096) (← links)
- Improvement of a convergence condition for Durand-Kerner iteration (Q1298639) (← links)
- Enclosing clusters of zeros of polynomials (Q1398713) (← links)
- Ten methods to bound multiple roots of polynomials (Q1398714) (← links)
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (Q1433125) (← links)
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations (Q1780608) (← links)
- Tighter bounds of errors of numerical roots (Q2467047) (← 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)
- A new simultaneous method of fourth order for finding complex zeros in circular interval arithmetic (Q5937194) (← links)