Robust certified numerical homotopy tracking

Details Robust certified numerical homotopy tracking Robust certified numerical homotopy tracking

2011-05-30

arxiv.org/abs/1105.5992v1

Mathematics

Algebraic Geometry

44 pages, 3 figures, 2 tables

Scientific paper

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 equations. If the coordinates of the input systems and the initial zero are rational our algorithm involves only rational computations and if the homotopy is well posed an approximate zero with integer coordinates of the target system is obtained. The total bit complexity is linear in the length of the path in the condition metric, and polynomial in the logarithm of the maximum of the condition number along the path, and in the size of the input

Affiliated with

Also associated with

No associations

Rating

Robust certified numerical homotopy tracking does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Robust certified numerical homotopy tracking, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robust certified numerical homotopy tracking will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-678452