RISC-Linz RISC-Linz Research Institute for Symbolic Computation  
about
|
people
|
publications
|
research
|
education
|
industry
|
conferences
|
media
|
projects
internal
  
search:
  

Wintersemester 2007/2008
Prof. Franz Winkler
Dr. Günter Landsmann
Computeralgebra (326.017)

Time: Tue 15:30 - 18:00
Place: T 211
Klausur: 29.1.2008
15:30 - 17:00, HS 15
Books are allowed!
Klausurangaben: kla.pdf klb.pdf
Noten: grades.pdf
Klausureinsicht: Do 14.2., 8:00-10:00
Raum 417, Kopfgebaeude TNF-Turm


A theoretical introduction into the area of computer algebra, especially the constructive solution of systems of polynomial equations, will be presented. Some of the main topics will be algorithms for basic algebraic domains (like integers, polynomials, finite fields, algebraic extension fields), computation by homomorphic images using the Chinese remainder algorithm, greatest common divisors of polynomials, factorization of univariate polynomials over finite fields, and the basic theory of Gröbner bases for polynomial ideals. 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 notes:
ca-intro1.pdf
chap-1-5.pdf
chap-2.pdf
chap-3-1.pdf
chap-4.pdf
chap-5.pdf
chap-6.pdf
chap-8.pdf


The course is a combination of lecture and exercises (KV). The exercise

part will be supervised by Dr. Günter Landsmann.

Each week you can find the exercises for next week's session here.

Exercises:
for 16.10.2007 ue1.pdf
for 30.10.2007 ue2.pdf
for   6.11.2007 ue3.pdf
for 13.11.2007 ue4.pdf
for 20.11.2007 ue5.pdf
for 27.11.2007 ue6.pdf
for   4.12.2007 ue7.pdf
for 11.12.2007 ue8.pdf
for   8.01.2008 ue9.pdf
for 15.01.2008 ue10.pdf
for 22.01.2008 ue11.pdf