Algebraic Solvers for Polynomial Systems
Session Organizers:
Session Abstract:
Polynomial systems are ubiquitous in problem modeling coming from many
scientific domains: Computer Science and Mathematics but also Biology,
Chemistry, Physics, Robotics. Algebraic methods for polynomial system solving
allow one to compute an exact representation of the solutions of the system.
In general, such methods rely on elimination theory, we can cite the
geometric resolution, lexicographic Gröbner bases, regular chains or
multivariate resultants.
As these methods allow the user to compute all the solutions of the system and
since their algorithmic does not depend on the base field, they proved
to be successful in many contexts and applications. In particular,
they are well-suited when one needs to perform computations in
positive characteristic and most computer algebra systems provide solvers based
on them.
This ICMS session is dedicated to these algebraic methods and their
implementations, such as, but not limited to, in a low-level language or in a
CAS.
Session Talks:
tba