Numerically computing real points on algebraic sets

Details Numerically computing real points on algebraic sets Numerically computing real points on algebraic sets

2011-05-31

arxiv.org/abs/1105.6266v2

Mathematics

Algebraic Geometry

Scientific paper

Given a polynomial system f, a fundamental question is to determine if f has real roots. Many algorithms involving the use of infinitesimal deformations have been proposed to answer this question. In this article, we transform an approach of Rouillier, Roy, and Safey El Din, which is based on a classical optimization approach of Seidenberg, to develop a homotopy based approach for computing at least one point on each connected component of a real algebraic set. Examples are presented demonstrating the effectiveness of this parallelizable homotopy based approach.

Affiliated with

Also associated with

No associations

Rating

Numerically computing real points on algebraic sets 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 Numerically computing real points on algebraic sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Numerically computing real points on algebraic sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-338227