RISC JKU

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.

Lecture notes:
0-Title.pdf
1-What-Is.pdf
2-1-Groebner-Intro.pdf
2-2-Groebner-Rob.pdf
2-3-Groebner-Theory.pdf
2-4-Groebner-Application.pdf
3-GCD.pdf
4-Resultants.pdf
5-Factorize.pdf
References.pdf
Time schedule:Date-Type
11.10.VO
18.10.VO
25.10.VO
08.11.UE ue1-08112011.pdf + Project organisation
15.11.VO
22.11.VO
29.11.UE ue2-29112011.pdf
06.12.VO
13.12.UE ue3-13122011.pdf
10.01.VO
17.01.VO
24.01.UE
31.01.VOEXAM (KLAUSUR) 15:00 -- 16:30 in HS 4
ohne Unterlagen / no books
klausur.pdf
noten.pdf
Project abstracts:
CA-Projects.pdf