Pages that link to "Item:Q2985841"
From MaRDI portal
The following pages link to Computing Real Roots of Real Polynomials ... and now For Real! (Q2985841):
Displaying 15 items.
- 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)
- Clustering complex zeros of triangular systems of polynomials (Q2035625) (← links)
- Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting (Q2079218) (← 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)
- Logcf: an efficient tool for real root isolation (Q2287381) (← links)
- On the resolution of certain discrete univariate max-min problems (Q2401027) (← links)
- A symbolic-numerical algorithm for isolating real roots of certain radical expressions (Q2656085) (← links)
- Ising model on random triangulations of the disk: phase transition (Q2698687) (← links)
- A Symbolic Computation Approach Towards the Asymptotic Stability Analysis of Differential Systems with Commensurate Delays (Q3297392) (← links)
- Evaluation of Chebyshev Polynomials on Intervals and Application to Root Finding (Q5014660) (← links)
- New Practical Advances in Polynomial Root Clustering (Q5014669) (← links)
- Computing totally real hyperplane sections and linear series on algebraic curves (Q5101849) (← links)
- SLV (Q5270205) (← links)
