In this paper we propose a unified methodology for computing the set V K (I) of complex (K = ℂ) or real (K = ℝ) roots of an ideal R[x], assuming Vk (I ) is finite. We show how moment matrices, defined in terms of a given set of generators of the ideall, can be used to (numerically) find not only the real variety V R (I), as shown in the Authors’ previous work, but also the complex variety V c (I), thus leading to a. unified treatment of the algebraic and real algebraic problem. In contrast to the real algebraic version of the algorithm, the complex analogue only uses basic numerical linear algebra because it does not require positive semidefiniteness of the moment matrix and so avoids semidefinite programming techniques. The links between these algorithms and other numerical algebraic methods arc outlined and their stopping criteria are related.
CITATION STYLE
Lasserre, J. B., Laurent, M., & Rostalskl, P. (2009). A Unified Approach to Computing Real and Complex Zeros of Zero-Dimensional Ideals (pp. 125–155). https://doi.org/10.1007/978-0-387-09686-5_6
Mendeley helps you to discover research relevant for your work.