**Wintersemester 2010/2011**

**Prof. Franz Winkler**

**Dr. Günter Landsmann**

**Computeralgebra (326.017)**

Time: |
Tue 15:30 - 18:00 | ||

Place: |
HS 13 | ||

First Lecture: |
Tue 05.10.2010, | HS 13 | |

Exam: |
Tue 25.01.2011, | 16:00 - 17:30 | in HS 17 |

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

Time schedule: | Date | - | Type |
- | Topics |

05.10. | VO | Kap.1 What is Computer Algebra ? | |||

Kap.2.1 introduction to Gröbner bases | |||||

Kap.2.2 Gröbner bases in Robotics | |||||

12.10 | UE | 1. Exercise sheet, Project organisation | |||

19.10. | VO | Gröbner bases, Kap.2.3 | |||

09.11. | VO | Gröbner bases, Kap.2.3 | |||

16.11. | VO | Gröbner bases, Kap.2.3 | |||

23.11. | VO | Gröbner bases, Kap.2.4 | |||

30.11. | UE | 2. Exercise sheet | |||

07.12. | VO | GCD, Kap.3 | |||

14.12. | VO | GCD, Kap.3 | |||

11.01. | VO | Resultants, Kap.4 | |||

18.01. | UE | Project presentations | |||

25.01. | VO | EXAM (KLAUSUR) 16:00 - 17:30 in HS 17 |
|||

ohne Unterlagen / no books | |||||

Klausur-25012011-angaben.pdf | |||||

Klausur-25012011-ergebnis.pdf |

Project abstracts: | CA-Projects.pdf | ||||

Diploma thesis: | DA-Thema-Schreiner.pdf |