ISOLATE

swMATH7741MaRDI QIDQ19758FDOQ19758

Author name not available (Why is that?)

Official website: http://www.maplesoft.com/support/help/Maple/view.aspx?path=RootFinding/Isolate

Described by source

• Efficient isolation of polynomial's real roots.

Cited In (only showing first 100 items - show all)

• Automated Deduction in Geometry
• Intersection theory in differential algebraic geometry: generic intersections and the differential Chow form
• A parametric representation of totally mixed Nash equilibria
• A survey on the complexity of solving algebraic systems
• A symbolic-numerical algorithm for isolating real roots of certain radical expressions
• \texttt{PTOPO}: computing the geometry and the topology of parametric curves
• Revisiting the problem of zeros of univariate scalar Béziers
• A quadratic clipping step with superquadratic convergence for bivariate polynomial systems
• A rational cubic clipping method for computing real roots of a polynomial
• Real root isolation of regular chains
• Computation of dominant real roots of polynomials
• Effective computational geometry for curves and surfaces
• Linear and quadratic complexity bounds on the values of the positive roots of polynomials
• Real solution isolation with multiplicity of zero-dimensional triangular systems
• Efficient inversion of rational maps over finite fields
• Approximate radical for clusters: A global approach using Gaussian elimination or SVD
• A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
• Blind algebraic identification of communication channels: symbolic solution algorithms
• Topics in computational algebraic number theory
• Symbolic-numeric methods for solving polynomial equations and applications
• Near optimal subdivision algorithms for real root isolation
• Isolating real roots of real polynomials
• Probabilistic algorithms for computing resolvent representations of regular differential ideals
• Real Root Isolation of Polynomial Equations Based on Hybrid Computation
• Polynomial equation solving by lifting procedures for ramified fibers
• Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping
• The first rational Chebyshev knots
• An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
• On computing absolutely irreducible components of algebraic varieties with parameters
• On the determination of cusp points of 3-RPR parallel manipulators
• Computational algebraic number theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms – ESA 2004
• Real algebraic numbers and polynomial systems of small degree
• Computing minimum distance between two implicit algebraic surfaces
• Using computer algebra to certify the global convergence of a numerical optimization process
• On the computation of an arrangement of quadrics in 3D
• Improved algorithms for computing determinants and resultants
• An algorithm for addressing the real interval eigenvalue problem
• Guaranteed collision detection with toleranced motions
• HELP: a sparse error locator polynomial for BCH codes
• Univariate real root isolation in an extension field and applications
• The approach of moments for polynomial equations
• Exact algorithms for the bottleneck Steiner tree problem
• Real root finding for low rank linear matrices
• Ridges and umbilics of polynomial parametric surfaces
• Title not available (Why is that?)
• Computing roadmaps in smooth real algebraic sets
• On the maximum computing time of the bisection method for real root isolation
• Involutions of polynomially parametrized surfaces
• An algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations
• Multiple point compression on elliptic curves
• Certification for polynomial systems via square subsystems
• Computing Chebyshev knot diagrams
• 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

This page was built for software: ISOLATE