Inclusion of the roots of a polynomial based on Gerschgorin's theorem
From MaRDI portal
(Redirected from Publication:804231)
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
Recommendations
Cites work
- scientific article; zbMATH DE number 3843915 (Why is no real title available?)
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- A generalized companion matrix of a polynomial and some applications
- A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem
- Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
- Matrix Analysis
- On a general \(\rho\)-algorithm
- On smallest isolated Gerschgorin disks for eigenvalues. III
- On the variation of the spectra of matrices
- Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
- Über Eigenwerteinschließungen mit Hilfe von <scp>Gerschgorin</scp>‐Kreisen
- Über die Falksche ECP-Transformation und Verallgemeinerungen
Cited in
(14)- Improvement of a convergence condition for Durand-Kerner iteration
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Inclusion Weierstrass-like root-finders with corrections
- On interpolation by rational functions with prescribed poles with applications to multivariate interpolation
- On simultaneous factoring of a polynomial
- Modified Gershgorin disks for companion matrices
- On the convergence of the sequences of Gerschgorin-like disks
- Numerical computation of polynomial zeros by means of Aberth's method
- Ten methods to bound multiple roots of polynomials
- A posteriori error bound methods for the inclusion of polynomial zeros
- Enclosing clusters of zeros of polynomials
- Solving secular and polynomial equations: a multiprecision algorithm
- 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
- Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros
This page was built for publication: Inclusion of the roots of a polynomial based on Gerschgorin's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804231)
