Pages that link to "Item:Q1421215"
From MaRDI portal
The following pages link to Efficient isolation of polynomial's real roots. (Q1421215):
Displaying 50 items.
- ISOLATE (Q19758) (← links)
- Continuous amortization and extensions: with applications to bisection-based root isolation (Q277222) (← links)
- A certified numerical algorithm for the topology of resultant and discriminant curves (Q346543) (← links)
- Improved bounds for the CF algorithm (Q385006) (← links)
- Exact symbolic-numeric computation of planar algebraic curves (Q387800) (← links)
- On the computing time of the continued fractions method (Q438690) (← links)
- A generic position based method for real root isolation of zero-dimensional polynomial systems (Q480656) (← links)
- Root refinement for real polynomials using quadratic interval refinement (Q484890) (← links)
- Computing real roots of real polynomials (Q491245) (← links)
- Solving a sparse system using linear algebra (Q491257) (← links)
- On the maximum computing time of the bisection method for real root isolation (Q507151) (← links)
- Bound the number of limit cycles bifurcating from center of polynomial Hamiltonian system via interval analysis (Q508217) (← links)
- Real solution isolation with multiplicity of zero-dimensional triangular systems (Q543162) (← links)
- Topics in computational algebraic number theory (Q558179) (← links)
- The first rational Chebyshev knots (Q607058) (← links)
- A deterministic algorithm for isolating real roots of a real polynomial (Q607163) (← links)
- Fast approach for computing roots of polynomials using cubic clipping (Q625270) (← links)
- On the topology of real algebraic plane curves (Q626980) (← links)
- An algorithm for addressing the real interval eigenvalue problem (Q629549) (← links)
- Efficient and accurate computation of upper bounds of approximation errors (Q633637) (← links)
- A general approach to isolating roots of a bitstream polynomial (Q655157) (← links)
- SqFreeEVAL: An (almost) optimal real-root isolation algorithm (Q655566) (← links)
- A quadratic clipping step with superquadratic convergence for bivariate polynomial systems (Q691650) (← links)
- On the computation of an arrangement of quadrics in 3D (Q705551) (← links)
- Certified approximation of parametric space curves with cubic \(B\)-spline curves (Q714496) (← links)
- On multiple roots in Descartes' rule and their distance to roots of higher derivatives (Q859884) (← links)
- Involutions of polynomially parametrized surfaces (Q893108) (← links)
- Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm (Q954969) (← links)
- Thirty years of polynomial system solving, and now? (Q1006651) (← links)
- Complete numerical isolation of real roots in zero-dimensional triangular systems (Q1025386) (← links)
- Isolating the real roots of the piecewise algebraic variety (Q1029844) (← links)
- Trees and jumps and real roots. (Q1421216) (← links)
- A rational cubic clipping method for computing real roots of a polynomial (Q1632370) (← links)
- Revisiting the problem of zeros of univariate scalar Béziers (Q1632405) (← 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)
- Univariate real root isolation in an extension field and applications (Q1757003) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- Certified non-conservative tests for the structural stability of discrete multidimensional systems (Q2002386) (← links)
- On the topology and isotopic meshing of plane algebraic curves (Q2179658) (← links)
- How to count the number of zeros that a polynomial has on the unit circle? (Q2222071) (← links)
- Complexity in iteration of polynomials (Q2273627) (← links)
- From fixation probabilities to \(d\)-player games: an inverse problem in evolutionary dynamics (Q2283911) (← links)
- Logcf: an efficient tool for real root isolation (Q2287381) (← links)
- Real algebraic numbers and polynomial systems of small degree (Q2378492) (← links)
- Guaranteed collision detection with toleranced motions (Q2396310) (← links)
- On the complexity of the Descartes method when using approximate arithmetic (Q2447639) (← links)
- Vincent's theorem of 1836: overview and future research (Q2452926) (← links)
- New bounds for the Descartes method (Q2457314) (← links)
- On the complexity of real root isolation using continued fractions (Q2476019) (← links)
