Pages that link to "Item:Q5255832"
From MaRDI portal
The following pages link to Quadratic interval refinement for real roots (Q5255832):
Displaying 13 items.
- Exact symbolic-numeric computation of planar algebraic curves (Q387800) (← links)
- Computing real roots of real polynomials (Q491245) (← links)
- A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics (Q629354) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- On the asymptotic and practical complexity of solving bivariate systems over the reals (Q1025391) (← links)
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
- A new trigonometrical algorithm for computing real root of non-linear transcendental equations (Q1738746) (← links)
- Accelerated subdivision for clustering roots of polynomials given by evaluation oracles (Q2109981) (← links)
- Near optimal subdivision algorithms for real root isolation (Q2628307) (← links)
- Quadric Arrangement in Classifying Rigid Motions of a 3D Digital Image (Q2830019) (← links)
- Koszul Algebras and Computations (Q2974695) (← links)
- (Q4984904) (← links)
- msolve. A library for solving polynomial systems (Q6666519) (← links)
