Paper detail

A search for an optimal start system for numerical homotopy continuation

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 system of polynomial equations. While finding optimal start systems is a hard problem, our experiments show that it is possible to find start systems that deliver better average complexity than the ones that are commonly used in the existing homotopy continuation software.

preprint2011arXivOpen access

Signal facts

What is known right now

Open access1 author3 topics

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.