17 citations · 115 across the 43 of their papers we have counts for
4 papers · 1 filter
Computing localizations iteratively
Francisco-Jesús Castro-Jiménez, Anton Leykin
Let $R=\bC[\bfx]$ be a polynomial ring with complex coefficients and $\Dx = \bC<bfx,\bfp>$ be the Weyl algebra. Describing the localization for nonzero a…
Multidegree for bifiltered -modules and hypergeometric systems
Rémi Arcadias
In that paper, we recall the notion of the multidegree for -modules, as exposed in a previous paper, with a slight simplification. A particular emphasis is given on hypergeometr…
A search for an optimal start system for numerical homotopy continuation
Anton Leykin
We use our recent implementation of a certified homotopy tracking algorithm to search for start systems that minimize the average complexity of finding all roots of a regular syste…
Robust certified numerical homotopy tracking
Carlos Beltrán, Anton Leykin
We describe, for the first time, a completely rigorous homotopy (path--following) algorithm (in the Turing machine model) to find approximate zeros of systems of polynomial equatio…