swMATH7741MaRDI QIDQ19758FDOQ19758
Author name not available (Why is that?)
Official website: http://www.maplesoft.com/support/help/Maple/view.aspx?path=RootFinding/Isolate
Cited In (only showing first 100 items - show all)
- A deterministic algorithm for isolating real roots of a real polynomial
- A general approach to isolating roots of a bitstream polynomial
- Parallel computation of real solving bivariate polynomial systems by zero-matching method
- Sparse FGLM algorithms
- Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using abelian lifts
- Real Schubert Calculus: Polynomial Systems and a Conjecture of Shapiro and Shapiro
- Complexity results for triangular sets
- Fast arithmetics in Artin-Schreier towers over finite fields
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- Resolvent representation for regular differential ideals
- Motivations for an arbitrary precision interval arithmetic and the MPFI library
- Exact, efficient, and complete arrangement computation for cubic curves
- Intersecting quadrics: an efficient and exact implementation
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
- Fast and exact geometric analysis of real algebraic plane curves
- Isolating the real roots of the piecewise algebraic variety
- Fast approach for computing roots of polynomials using cubic clipping
- A new algorithm for computing certified numerical approximations of the roots of a zero-dimensional system
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- On the computing time of the continued fractions method
- Complete numerical isolation of real roots in zero-dimensional triangular systems
- A new method for real root isolation of univariate polynomials
- Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
- On the time-space complexity of geometric elimination procedures
- On the complexity of real root isolation using continued fractions
- Affine solution sets of sparse polynomial systems
- Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials
- Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
- Improved explicit estimates on the number of solutions of equations over a finite field
- Computer Algebra in Scientific Computing
- Khovanskii-Rolle continuation for real solutions
- Certified approximation of parametric space curves with cubic \(B\)-spline curves
- Title not available (Why is that?)
- Finding at least one point in each connected component of a real algebraic set defined by a single equation
- Separating linear forms and rational univariate representations of bivariate systems
- Root refinement for real polynomials using quadratic interval refinement
- Computing real roots of real polynomials
- Design of Marx generators as a structured eigenvalue assignment
- On the topology and isotopic meshing of plane algebraic curves
- Real solving for positive dimensional systems.
- On sign conditions over real multivariate polynomials
- A generic position based method for real root isolation of zero-dimensional polynomial systems
- Relaxed Hensel lifting of triangular sets
- Moments and sums of squares for polynomial optimization and related problems
- Implicit Curves and Surfaces: Mathematics, Data Structures and Algorithms
- Testing sign conditions on a multivariate polynomial and applications
- Efficient and accurate computation of upper bounds of approximation errors
- On polynomial feedback Nash equilibria for two-player scalar differential games
- Gröbner bases and wavelet design
- A certified numerical algorithm for the topology of resultant and discriminant curves
- On the geometry of parametrized bicubic surfaces
- Solving a sparse system using linear algebra
- Fast algorithms for zero-dimensional polynomial systems using duality
- On the topology of real algebraic plane curves
- On multiple roots in Descartes' rule and their distance to roots of higher derivatives
- From an approximate to an exact absolute polynomial factorization
- On the computation of matrices of traces and radicals of ideals
- Thirty years of polynomial system solving, and now?
- Bound the number of limit cycles bifurcating from center of polynomial Hamiltonian system via interval analysis
- On the Bézout construction of the resultant
- On the complexity of real solving bivariate systems
- An efficient algorithm for factoring polynomials over algebraic extension field
- Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm
- Ambient Isotopic Meshing for Implicit Algebraic Surfaces with Singularities
- A prolongation-projection algorithm for computing the finite real variety of an ideal
- On the minimum of a positive polynomial over the standard simplex
- Title not available (Why is that?)
- Improved bounds for the CF algorithm
- Exact symbolic-numeric computation of planar algebraic curves
- Advances on the Continued Fractions Method Using Better Estimations of Positive Root Bounds
- Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
- Stable normal forms for polynomial system solving
- Pivoting in extended rings for computing approximate Gröbner bases
- A comparative study of two real root isolation methods
- A unified approach to computing real and complex zeros of zero-dimensional ideals
- Logcf: an efficient tool for real root isolation
- A concise proof of the Kronecker polynomial system solver from scratch
- Multiplicities of tensor eigenvalues
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- Solving bivariate systems using rational univariate representations
- Modular composition modulo triangular sets and applications
- Genus 2 point counting over prime fields
- Algebraic approaches to stability analysis of biological systems
- Root isolation for bivariate polynomial systems with local generic position method
- Continuous amortization and extensions: with applications to bisection-based root isolation
- Real Algebraic Numbers: Complexity Analysis and Experimentation
- Bit-size estimates for triangular sets in positive dimension
- A Gröbner free alternative for polynomial system solving
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- On the complexity of isolating real roots and computing with certainty the topological degree
- Introduction to the solution of polynomial systems
- Solving zero-dimensional systems through the rational univariate representation
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Moments, positive polynomials and their applications
- Numerical Software with Result Verification
- Improved projection for cylindrical algebraic decomposition
- On solving systems of bivariate polynomials
- On the complexity of computing with zero-dimensional triangular sets
- An elimination method for solving bivariate polynomial systems: eliminating the usual drawbacks
- tangent Graeffe
This page was built for software: ISOLATE
