Eventos

Complexity of Algorithms for Solving Equations

De 16 a 20 de Abril de 2012

Dates: April 16-20, 2012.

Solving systems of polynomial equations is a classical subject with a
long history. It was one of the motivations in the classical
development of Algebra and Algebraic Geometry. It was one of the main pursuits of early Numerical Analysis. Yet, our actual knowledge is not enough to solve but a small part of the systems that arise from many subjects, such as chemistry, physics, or engineering.

This workshop will focus on the mathematical foundations of the
subject. In particular, we focus on rigorous algorithms for solving
dense or sparse polynomial systems, and related issues in algebra,
algebraic or differential geometry, numerical analysis, and
applications to algebraic differential equations.

Organizing Committee:
Gregorio Malajovich (gregorio.malajovich@gmail.com), UFRJ (chair and local organizer).
Diego Armentano, Universidad de la Republica, Montevideo.
Guillaume Chèze, Université Paul Sabatier.
Jean-Pierre Dedieu, Université Paul Sabatier.
Teresa Krick, Universidad de Buenos Aires.

Preliminary list of participants

Diego Armentano, Universidad de la República.
Paola Boito, Université de Limoges.
Guillaume Chèze, Université Paul Sabatier
Federico Dalmao, Universidad de la República.
Ezequiel Dratman, Universidad Nacional de General Sarmiento.
Teresa Krick, Universidad de Buenos Aires
Santiago Laplagne, Universidad de Buenos Aires.
Gregorio Malajovich, Universidade Federal do Rio de Janeiro.
Mike Shub, CONICET, IMAS, Universidad de Buenos Aires, Argentina, and
CUNY Graduate School, New York NY, USA.
Jean-Claude Yakoubsohn, Université Paul Sabatier

Homepage of the conference:
www.labma.ufrj.br/~gregorio/conferences/complexity2012/

Support: Mathamsud, CAPES, CNPq, UFRJ.

URL: http://www.labma.ufrj.br/~gregorio/conferences/complexity2012/

Uma solução Editora Cubo

Conheça

Categorias

Próximos Eventos (0)

Eventos Anteriores (662)

Eventos

Complexity of Algorithms for Solving Equations