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)

• Automated Deduction in Geometry
• A parametric representation of totally mixed Nash equilibria
• 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
• Title not available (Why is that?)
• 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
• On the time-space complexity of geometric elimination procedures
• Real Root Isolation of Regular Chains
• 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
• On computing absolutely irreducible components of algebraic varieties with parameters
• On the determination of cusp points of 3-RPR parallel manipulators
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms – ESA 2004
• Certified approximation of parametric space curves with cubic \(B\)-spline curves
• Title not available (Why is that?)
• Design of Marx generators as a structured eigenvalue assignment
• Real algebraic numbers and polynomial systems of small degree
• Computing minimum distance between two implicit algebraic surfaces
• On the computation of an arrangement of quadrics in 3D
• 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
• An algorithm for addressing the real interval eigenvalue problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Gröbner bases and wavelet design
• Title not available (Why is that?)
• On the geometry of parametrized bicubic surfaces
• Solving a sparse system using linear algebra
• 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?
• Exact algorithms for the bottleneck Steiner tree problem
• Bound the number of limit cycles bifurcating from center of polynomial Hamiltonian system via interval analysis
• On the Bézout construction of the resultant
• Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm
• Title not available (Why is that?)
• A prolongation-projection algorithm for computing the finite real variety of an ideal
• On the maximum computing time of the bisection method for real root isolation
• On the minimum of a positive polynomial over the standard simplex
• Multiple point compression on elliptic curves
• Certification for polynomial systems via square subsystems
• Advances on the Continued Fractions Method Using Better Estimations of Positive Root Bounds
• 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
• Logcf: an efficient tool for real root isolation
• Title not available (Why is that?)
• A concise proof of the Kronecker polynomial system solver from scratch
• Multiplicities of tensor eigenvalues
• 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
• On Solving Systems of Bivariate Polynomials
• Bit-size estimates for triangular sets in positive dimension
• 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
• Numerical Software with Result Verification
• Improved projection for cylindrical algebraic decomposition

This page was built for software: ISOLATE