Searching for "Real root-finding." – sorted by Relevance.
-
Polynomial Real Root Finding in Bernstein Form
- .9.1 Algorithms: Psolver2, Psolver3, and Psolver4 :::::::::: 109 6 Polynomial Real Root-Finding Algorithms 116 6
- Cited by 6 (0 self) – Add To MetaCart
-
On the Exact Computation of theTopology of Real Algebraic Curves *
- are algebraic numbers. Various algebraic approaches for this real root finding and counting problem have been
- Add To MetaCart
-
Isolator Polynomials
- of polynomials for real root finding. For this application, the method is efficient for low-degree polynomials
- Add To MetaCart
-
An O(n log³ n) Algorithm for the Real Root and Symmetric Tridiagonal Eigenvalue Problems
- -precision , where b = m + . The real root finding problem is the root finding problem given a polynomial with all
- Add To MetaCart
-
An Efficient Algorithm for the Real Root and Symmetric Tridiagonal Eigenvalue Problems
- + . The real root finding problem is the root finding problem given a polynomial with all real roots. z
- Add To MetaCart
-
Polar Varieties, Real Equation Solving and Data-Structures: The hypersurface case
- system. If we want to use a complex root finding method for a problem over the reals, some previous
- Cited by 8 (5 self) – Add To MetaCart
-
Real-time GPU rendering of piecewise algebraic surfaces
- this to be reported as a complex conjugate pair and be rejected in the real-root-finding process. ● This can occur
- Cited by 14 (0 self) – Add To MetaCart
-
Tracing Algebraic Surfaces
- sort the remaining real roots to find the lowest positive root. We have found that these methods
- Cited by 39 (0 self) – Add To MetaCart
-
Teaching Computational Abstract Algebra
- and Brent algorithms. The Pollard-ae algorithm for factoring integers and its analysis. 4 Real root finding
- Cited by 1 (0 self) – Add To MetaCart
-
J. Symbolic Computation (1996) 11, 1--13
- analysis. 4 Real root finding (1.5 weeks): Sturm's theorem and the bisection method. 5 Complex root
- Add To MetaCart

