Pages that link to "Item:Q2447639"
From MaRDI portal
The following pages link to On the complexity of the Descartes method when using approximate arithmetic (Q2447639):
Displaying 8 items.
- Continuous amortization and extensions: with applications to bisection-based root isolation (Q277222) (← links)
- Improved bounds for the CF algorithm (Q385006) (← links)
- Root refinement for real polynomials using quadratic interval refinement (Q484890) (← links)
- Computing real roots of real polynomials (Q491245) (← links)
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
- Virtuous smoothing for global optimization (Q1683327) (← links)
- A symbolic-numerical algorithm for isolating real roots of certain radical expressions (Q2656085) (← links)
- Counting and Testing Dominant Polynomials (Q2813821) (← links)
