Wintersemester 2012/2013
Prof. Franz Winkler
Dr. Günter Landsmann
Computeralgebra (326.989/326.990)
| Time: |
Tue 15:30 - 18:00 |
| Place: |
HS 13 |
| First Unit: |
Tue 09.10.2012, HS 13 |
The course consists of lectures and exercises.
Participants are expected to be acquainted with the basic notions in algebra and algorithm theory.
| Lectures: | VO 326.989, Tuesday 16:30 - 18:00 |
| In the lecture we will introduce the theoretical concept.
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) |
| |
| Klausur: |
am 29.1.2013, 16:30 - 18:00 in HS 4 |
|
ohne Unterlagen / no books. |
| Klausurergebnisse: |
kl-erg-noname.pdf |
| Exercises: | UE 326.990 Tuesday 15:30 - 16:15 |
|
The exercises consist of homework exercises and projects.
Each week you will find exercise sheets for next week's session here.
A project comprises a theme, problems, solutions, examples and an algorithm.
On October 9 possible themes for projects will be introduced. During the semester
students should congregate to small groups (4 to 6 members) and as a group choose one subject
to be treated as a project topic.
The members of each group are expected to work out the subject, 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.
The last three units (January 15th, 22nd, 29th 2013)
will be devoted to presenting this work in a 15 minutes' talk by a group member.
|
