Pages that link to "Item:Q2541996"

The following pages link to Upperbounds for roots of polynomials (Q2541996):

Displaying 16 items.

• Improvements of Lagrange's bound for polynomial roots (Q512362) (← links)
• A property of the nearly optimal root-bound (Q596173) (← links)
• Bounds on absolute positiveness of multivariate polynomials (Q972843) (← links)
• Bounds for positive roots of polynomials (Q1082776) (← links)
• A parallel Wilf algorithm for complex zeros of a polynomial (Q1156457) (← links)
• Bounds for the zeros of polynomials from eigenvalues and singular values of some companion matrices (Q1379083) (← links)
• Ten methods to bound multiple roots of polynomials (Q1398714) (← links)
• Modified Newton method in circular interval arithmetic (Q1904962) (← links)
• Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
• From approximate factorization to root isolation with application to cylindrical algebraic decomposition (Q2252120) (← links)
• Real polynomial root-finding by means of matrix and polynomial iterations (Q2357365) (← links)
• On the complexity of real root isolation using continued fractions (Q2476019) (← links)
• On truncated Taylor series and the position of their spurious zeros (Q2581573) (← links)
• A Lower Bound for Computing Lagrange’s Real Root Bound (Q2830020) (← links)
• Exact algorithms for the implementation of cauchy's rule (Q3938431) (← links)
• Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation (Q4610020) (← links)