Upperbounds for roots of polynomials
From MaRDI portal
Cited in
(17)- Bounds for positive roots of polynomials
- A parallel Wilf algorithm for complex zeros of a polynomial
- Bounds for the zeros of polynomials from eigenvalues and singular values of some companion matrices
- Ten methods to bound multiple roots of polynomials
- Modified Newton method in circular interval arithmetic
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition
- Real polynomial root-finding by means of matrix and polynomial iterations
- On the complexity of real root isolation using continued fractions
- On truncated Taylor series and the position of their spurious zeros
- A Lower Bound for Computing Lagrange’s Real Root Bound
- Exact algorithms for the implementation of cauchy's rule
- Simple and nearly optimal polynomial root-finding by means of root radii approximation
- Improvements of Lagrange's bound for polynomial roots
- A property of the nearly optimal root-bound
- An optimal complexity spectral solver for the Poisson equation
- Bounds on absolute positiveness of multivariate polynomials
This page was built for publication: Upperbounds for roots of polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2541996)
