Prof. Franz Winkler
Dr. Günter Landsmann
|| Tue 15:30 - 18:00
|| HS 13
|| Tue 06.10.2009,
|| HS 13
|| Tue 26.01.2010
|| 16:00 - 18:00,
|| HS 10
A theoretical and practical introduction into the area of computer algebra will be presented.
In particular we deal with the constructive symbolic solution of systems of algebraic (i.e. polynomial)
equations. We will cover the theory of Gröbner bases, Euclid's algorithm for GDCs of polynomials, and the method of resultants.
The course will follow the appropriate chapters in:
|| F. Winkler: Polynomial Algorithms in Computer Algebra,
|| Springer-Verlag Wien New York, 1996
|| (ISBN 3-211-82759-5)
Participants are expected to be acquainted with the basic notions in
algebra and algorithm theory.
The course is a combination (KV) of lectures
The exercises (UE)
consist of homework exercises and projects.
There will be 3 exercise sheets
which can be found below in pdf-format.
comprises a theme, problems, solutions, examples and an algorithm.
On October 20th, after discussing the first bunch of exercises, the projects
will be allocated to groups of students, one project a group. The members of
each group are expected to work out the theme, compile the theory behind,
discuss examples and develop an algorithm capable of solving the corresponding
problems. All this should be summarized in a paper of 5 to 8 pages to be presented on
19th of October in a 15 minutes' talk by a group member.
|6.10.||VO||Kap.1 What is Computer Algebra ?|
| || ||Kap.2.1 introduction to Gröbner bases|
| || ||Kap.2.2 Gröbner bases in Robotics|
|13.10.||VO||Gröbner bases, Kap.2.3|
1. Exercise sheet, Project organisation|
|27.10.||VO||Gröbner bases, Kap.2.3|
|03.11.||VO||Gröbner bases, Kap.2.3|
2. Exercise sheet |
|17.11.||VO||Gröbner bases, Kap.2.4|
|24.11.||VO||Gröbner bases, Kap.2.4|
3. Exercise sheet |
|26.01.||VO||KLAUSUR 16:00 - 17:30, in HS 10
|ohne Unterlagen / no books|