A prolongation-projection algorithm for computing the finite real variety of an ideal

Details A prolongation-projection algorithm for computing the finite real variety of an ideal A prolongation-projection algorithm for computing the finite real variety of an ideal

2008-06-24

arxiv.org/abs/0806.3874v2

Mathematics

Algebraic Geometry

revised version

Scientific paper

We provide a real algebraic symbolic-numeric algorithm for computing the real variety $V_R(I)$ of an ideal $I$, assuming it is finite while $V_C(I)$ may not be. Our approach uses sets of linear functionals on $R[X]$, vanishing on a given set of polynomials generating $I$ and their prolongations up to a given degree, as well as on polynomials of the real radical ideal of $I$, obtained from the kernel of a suitably defined moment matrix assumed to be positive semidefinite and of maximum rank. We formulate a condition on the dimensions of projections of these sets of linear functionals, which serves as stopping criterion for our algorithm. This algorithm, based on standard numerical linear algebra routines and semidefinite optimization, combines techniques from previous work of the authors together with an existing algorithm for the complex variety. This results in a unified methodology for the real and complex cases.

Affiliated with

Also associated with

No associations

Rating

A prolongation-projection algorithm for computing the finite real variety of an ideal 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 A prolongation-projection algorithm for computing the finite real variety of an ideal, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A prolongation-projection algorithm for computing the finite real variety of an ideal will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-97672