Wintersemester 2011/2012
Prof. Franz Winkler
Dr. Günter Landsmann
Computeralgebra (326.017)
| Time: |
Tue 15:30 - 18:00 |
| Place: |
HS 13 |
| First Lecture: |
Tue 11.10.2011, |
HS 13 |
| Exam: |
Tue 31.01.2012, |
15:30 - 17:00, |
HS 4. |
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, and factorization of polynomials.
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.
Lecture mode:
The course is a combination (KV) of
lectures (VO) and
exercises (UE).
The
exercises consist of homework exercises and projects.
A
project comprises a theme, problems, solutions, examples and an algorithm.
On November 8, 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
January 24 in a 15 minutes' talk by a group member.
