Enclosing clusters of zeros of polynomials
From MaRDI portal
Publication:1398713
DOI10.1016/S0377-0427(03)00380-7zbMath1029.65050MaRDI QIDQ1398713
Publication date: 7 August 2003
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
eigenvalue problemcircular arithmeticRouché's theoreminterval arithmeticpolynomial zerosmultiple rootsGerschgorin diskroot cluster
Interval and finite arithmetic (65G30) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)
Related Items
A verified method for bounding clusters of zeros of analytic functions, Constraint propagation on quadratic constraints, Ten methods to bound multiple roots of polynomials, Computing Enclosures for the Matrix Exponential, Some coefficient sequences related to the descent polynomial, On new higher order families of simultaneous methods for finding polynomial zeros, A family of root-finding methods with accelerated convergence, 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, Descent polynomials, Generalizations of Gershgorin disks and polynomial zeros, An efficient higher order family of root finders, A higher order family for the simultaneous inclusion of multiple zeros of polynomials, Sigmoid-like functions and root finding methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inclusion of the roots of a polynomial based on Gerschgorin's theorem
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- An iteration formula for the simultaneous determination of the zeros of a polynomial
- Rank-one modification of the symmetric eigenproblem
- A bibliography on roots of polynomials
- Detection and validation of clusters of polynomial zeros
- Point estimation and some applications to iterative methods
- Ten methods to bound multiple roots of polynomials
- Improvement of convergence of an iterative method for finding polynomial factors of analytic functions
- Iterative methods for simultaneous inclusion of polynomial zeros
- On locating clusters of zeros of analytic functions
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
- Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
- Direkte Verfahren zur Berechnung der Nullstellen von Polynomen
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Circular arithmetic and the determination of polynomial zeros
- Simultaneous inclusion of the zeros of a polynomial
- A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem
- Über die Falksche ECP-Transformation und Verallgemeinerungen
- An Existence Test for Root Clusters and Multiple Roots
- Algorithm 493: Zeros of a Real Polynomial [C2]
- A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
- Gershgorin's Theorem and the Zeros of Polynomials
- Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
- Some Modified Matrix Eigenvalue Problems
- Mathematische Deutung des ‘Flat Facet Models’ zur Bildverarbeitung
