MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Solving systems of multivariate polynomial equations and its application to distance computation between quadratic complexes.

Christian Lennerz
Max-Planck-Institut für Informatik - AG 1
AG1 Mittagsseminar (own work)
AG 1, AG 4  
MPI Audience
English

Date, Time and Location

Thursday, 7 June 2001
13:30
45 Minutes
MPI
024
Saarbrücken

Abstract

We will introduce the problem of computing the distance between

quadratic complexes. They can be considered as a generalization of
polyhedra with faces embedded on quadratic surfaces and bounded by
quadratic curves.
The problem can be reduced to the problem of finding the common roots
of two bivariate polynomials.
We will present different methods for solving systems of multivariate
polynomial equations and the results of applying them to our problem instances.
The methods, we will present in detail, are based on resultants
and are reducing the orignal problem to solving an univariate polynomial equation
or computing the eigenvalues of a matrix respectively.

Contact

Christian Lennerz
--email hidden
passcode not visible
logged in users only