Upperbounds for roots of polynomials
From MaRDI portal
Publication:2541996
DOI10.1007/BF02168974zbMath0204.48205OpenAlexW2019599627MaRDI QIDQ2541996
Publication date: 1970
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131989
Related Items
Bounds for positive roots of polynomials, Modified Newton method in circular interval arithmetic, A property of the nearly optimal root-bound, Bounds for the zeros of polynomials from eigenvalues and singular values of some companion matrices, Optimal and nearly optimal algorithms for approximating polynomial zeros, Ten methods to bound multiple roots of polynomials, A parallel Wilf algorithm for complex zeros of a polynomial, Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation, Improvements of Lagrange's bound for polynomial roots, On the complexity of real root isolation using continued fractions, From approximate factorization to root isolation with application to cylindrical algebraic decomposition, Bounds on absolute positiveness of multivariate polynomials, A Lower Bound for Computing Lagrange’s Real Root Bound, Exact algorithms for the implementation of cauchy's rule, On truncated Taylor series and the position of their spurious zeros, Real polynomial root-finding by means of matrix and polynomial iterations
Cites Work
