ISOLATE

swMATH7741MaRDI QIDQ19758FDOQ19758

Author name not available (Why is that?)

Described by source

• Efficient isolation of polynomial's real roots.

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
• Logcf: an efficient tool for real root isolation
• A concise proof of the Kronecker polynomial system solver from scratch
• Multiplicities of tensor eigenvalues
• Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using abelian lifts
• Real Schubert Calculus: Polynomial Systems and a Conjecture of Shapiro and Shapiro
• A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
• An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
• Complexity results for triangular sets
• Solving bivariate systems using rational univariate representations
• Modular composition modulo triangular sets and applications
• Genus 2 point counting over prime fields
• Fast arithmetics in Artin-Schreier towers over finite fields
• Root isolation of zero-dimensional polynomial systems with linear univariate representation
• Algebraic approaches to stability analysis of biological systems
• Root isolation for bivariate polynomial systems with local generic position method
• Resolvent representation for regular differential ideals
• Continuous amortization and extensions: with applications to bisection-based root isolation
• Motivations for an arbitrary precision interval arithmetic and the MPFI library
• Real Algebraic Numbers: Complexity Analysis and Experimentation
• Bit-size estimates for triangular sets in positive dimension
• Fast and exact geometric analysis of real algebraic plane curves
• Isolating the real roots of the piecewise algebraic variety
• 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
• Complete numerical isolation of real roots in zero-dimensional triangular systems
• 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 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
• On solving systems of bivariate polynomials
• On the complexity of computing with zero-dimensional triangular sets
• Improved explicit estimates on the number of solutions of equations over a finite field
• Complexity of solving parametric polynomial systems
• Computer Algebra in Scientific Computing
• Khovanskii-Rolle continuation for real solutions
• 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
• Moment matrices, border bases and real radical computation
• On the topology and isotopic meshing of plane algebraic curves
• Solving the equality-constrained minimization problem of polynomial functions
• Algorithms – ESA 2005
• 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
• SqFreeEVAL: An (almost) optimal real-root isolation algorithm
• Efficient and accurate computation of upper bounds of approximation errors
• On polynomial feedback Nash equilibria for two-player scalar differential games
• A certified numerical algorithm for the topology of resultant and discriminant curves
• On the complexity of the Descartes method when using approximate arithmetic
• New bounds for the Descartes method
• Vincent's theorem of 1836: overview and future research
• Representations of fundamental groups of 3-manifolds into \(\mathrm{PGL}(3,\mathbb C)\): exact computations in low complexity
• Computer Algebra in Scientific Computing
• Fast algorithms for zero-dimensional polynomial systems using duality
• Solving polynomial equations. Foundations, algorithms, and applications
• On the topology of real algebraic plane curves
• On the complexity of real solving bivariate systems
• An efficient algorithm for factoring polynomials over algebraic extension field
• Design, analysis, and implementation of a multiprecision polynomial rootfinder
• Ambient Isotopic Meshing for Implicit Algebraic Surfaces with Singularities
• Fast computation of special resultants
• The SARAG library: some algorithms in real algebraic geometry
• Title not available (Why is that?)
• Improved bounds for the CF algorithm
• Exact symbolic-numeric computation of planar algebraic curves
• 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
• Automated Deduction in Geometry
• A parametric representation of totally mixed Nash equilibria
• A survey on the complexity of solving algebraic systems
• Parallel computation of real solving bivariate polynomial systems by zero-matching method
• Sparse FGLM algorithms
• Effective computational geometry for curves and surfaces
• Real solution isolation with multiplicity of zero-dimensional triangular systems
• 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
• Approximate radical for clusters: A global approach using Gaussian elimination or SVD
• Topics in computational algebraic number theory
• 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
• A new method for real root isolation of univariate polynomials
• Near optimal subdivision algorithms for real root isolation
• Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
• Isolating real roots of real polynomials

This page was built for software: ISOLATE