Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.

  

Semidefinite Characterization and Computation of Real Radical Ideals

Back
Abstract:
In this talk I will discuss a method (joined work with M. Laurent and J.-B. Lasserre) for computing all points on a zero-dimensional semi-algebraic set described by polynomial equalities and inequalities. Moreover we aim for some "nice" polynomial generators for the vanishing ideal, i.e. for the set of all polynomials vanishing on these points. In contrast to exact computational algebraic methods, which are intrinsically computationally demanding, the method we propose uses numerical linear algebra and semidefinite optimization to compute approximate solutions to the problem at hand. Another advantage of the proposed method is the real-algebraic nature of the algorithm preventing the need to deal with complex solutions components. The proposed methods fits well in a relatively new branch of mathematics called "Numerical Polynomial Algebra".

Type of Seminar:
IfA Seminar
Speaker:
Philipp Rostalski
Date/Time:
Dec 07, 2006   11:00
Location:

K25
Contact Person:

Colin Jones
No downloadable files available.
Biographical Sketch: