ISOLATE
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Thirty years of polynomial system solving, and now?
- Complete numerical isolation of real roots in zero-dimensional triangular systems
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- A prolongation-projection algorithm for computing the finite real variety of an ideal
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Isolating the real roots of the piecewise algebraic variety
- ACETAF
- CHABIS
- Solving zero-dimensional systems through the rational univariate representation
- Epsilon
- FGb
- intpakX
- Kronecker
- LEDA
- Mathemagix
- MPFI
- NTL
- PHCpack
- Projective Noether
- QEPCAD
- PTOPO
- RAGlib
- RegularChains
- RFSFNS
- SARAG
- SingSurf
- SYNAPS
- ZEBEC
- POLSYS_PLP
- Trees and jumps and real roots.
- Fast algorithms for zero-dimensional polynomial systems using duality
- LOOK
- EXACUS
- Resolvent representation for regular differential ideals
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- A simplified rational representation for positive-dimensional polynomial systems and SHEPWM equations solving
- A rational cubic clipping method for computing real roots of a polynomial
- Revisiting the problem of zeros of univariate scalar Béziers
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- Computing Chebyshev knot diagrams
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- Sparse FGLM algorithms
- MAPC
- MPSolve
- Univariate real root isolation in an extension field and applications
- Improved algorithms for computing determinants and resultants
- Solving polynomial equations. Foundations, algorithms, and applications
- PNM
- On the Bézout construction of the resultant
- logcf
- Axel
- Real solving for positive dimensional systems.
- Xcas
- Bertini
- Complexity results for triangular sets
- modpn
- Juno-2
- On the complexity of computing with zero-dimensional triangular sets
- alphaCertified
- Affine solution sets of sparse polynomial systems
- Moment matrices, border bases and real radical computation
- SqFreeEVAL
- DISCOVERER
- REACH
- Homotopy techniques for solving sparse column support determinantal polynomial systems
- New nonarithmetic complex hyperbolic lattices. II
- Multilinear polynomial systems: root isolation and bit complexity
- Certified non-conservative tests for the structural stability of discrete multidimensional systems
- Deterministic normal position transformation and its applications
- Solving the equality-constrained minimization problem of polynomial functions
- DIFFALG
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
- Bit complexity for computing one point in each connected component of a smooth real algebraic set
- Computing critical points for invariant algebraic systems
- Degröbnerization: a political manifesto
- Effective algorithm for computing Noetherian operators of zero-dimensional ideals
- Solving parametric systems of polynomial equations over the reals through Hermite matrices
- Computing PUR of zero-dimensional ideals of breadth at most one
- An improvement of the rational representation for high-dimensional systems
- INTPAK
- Real root finding for low rank linear matrices
- On the topology and isotopic meshing of plane algebraic curves
- Numerical roadmap of smooth bounded real algebraic surface
- Wsolve
- Bertini_real
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
- How to count the number of zeros that a polynomial has on the unit circle?
- Solving determinantal systems using homotopy techniques
- Algebraic analysis of stability and bifurcation of a self-assembling micelle system
- Complexity of solving parametric polynomial systems
- On the minimum of a positive polynomial over the standard simplex
- Complexity in iteration of polynomials
- From fixation probabilities to \(d\)-player games: an inverse problem in evolutionary dynamics
- Block-Krylov techniques in the context of sparse-FGLM algorithms
- A symbolic algorithm to compute immersions of polynomial systems into linear ones up to an output injection
- On types of degenerate critical points of real polynomial functions
- Logcf: an efficient tool for real root isolation
- A conflict-driven solving procedure for poly-power constraints
- Computing and using minimal polynomials
- Algebraic kernel
This page was built for software: ISOLATE
