Pages that link to "Item:Q491245"

The following pages link to Computing real roots of real polynomials (Q491245):

Displaying 20 items.

• Solving bivariate systems using rational univariate representations (Q325154) (← links)
• Root radii and subdivision for polynomial root-finding (Q831975) (← links)
• A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
• Computing Chebyshev knot diagrams (Q1680160) (← links)
• A new trigonometrical algorithm for computing real root of non-linear transcendental equations (Q1738746) (← links)
• Representing rational curve segments and surface patches using semi-algebraic sets (Q2010339) (← links)
• Accelerated subdivision for clustering roots of polynomials given by evaluation oracles (Q2109981) (← links)
• Bounds for polynomials on algebraic numbers and application to curve topology (Q2118214) (← links)
• Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems (Q2211202) (← links)
• How to count the number of zeros that a polynomial has on the unit circle? (Q2222071) (← links)
• Real polynomial root-finding by means of matrix and polynomial iterations (Q2357365) (← links)
• Positive root isolation for poly-powers by exclusion and differentiation (Q2409014) (← links)
• Near optimal subdivision algorithms for real root isolation (Q2628307) (← links)
• Condition numbers for the cube. I: Univariate polynomials and hypersurfaces (Q2674002) (← links)
• Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane (Q2806816) (← links)
• First Study for Ramp Secret Sharing Schemes Through Greatest Common Divisor of Polynomials (Q3300516) (← links)
• (Q4984904) (← links)
• New Practical Advances in Polynomial Root Clustering (Q5014669) (← links)
• A New Root–Finding Algorithm Using Exponential Series (Q5125231) (← links)
• Zero counting for a class of univariate Pfaffian functions (Q5964515) (← links)