Polyhedral Computation: Theory, Practice and Applications in Engineering and Science

Autumn  2012                 Prof. David Avis                          Thursday  8:45 - 10:15

Description: Convex polyhedra form a fundamental modeling tool in many areas of engineering, science and applied mathematics. Applications arise in such diverse fields as molecular biology, materials science, game theory, embedded systems, robotics and even quantum computation. In dealing with polyhedral models, various challenging computational problems arise. Among these problems are vertex enumeration, redundancy removal, volume computation, polyhedral intersection, computation of a Voronoi diagram, etc.

The first part of this course will involve a study of the best available algorithms for solving these problems. For this part of the course, linear algebra and a basic knowledge of linear programming will be assumed. Students will obtain hands-on experience with state-of-the-art software for these problems. The second part of the course will consist of a study of various applications of polyhedral computation in engineering and science. The topics will be chosen according to the background and interests of students. Students with limited background in linear programming are advised first to take "Computational Intractability: NP-completeness and  Integer Programming, with Scheduling Applications."

* Course Outline 
* Lecture summaries and links
*Announcements

               Previous year's web pages

Send comments/questions to avis@i.kyoto-u.ac.jp

October 11, 2012