CS 680501 Computer Algebra II Syllabus
 Course Description
This course continues the survey of fundamental ideas in symbolic
mathematical computation. Topics typically covered include: padic
lifting, polynomial factorization, solution of systems of polynomial
equations, Grobner bases. Additional topics may include: polynomial
real and complex zero isolation, the CAD algorithm and its application
to quantifier elimination, algorithms for symbolic integration.
 Course Objective
To obtain an understanding of the design, implementation, and
analysis of computer algebra algorithms. More specifically students
will become familiar with the underlying mathematics and algorithm
design, implementation and analysis of algorithms for the exact
solution of polynomial equations. Students
should be able to use, implement and analyze the fundamental algorithms
for polynomial factorization, root isolation and refinement, and the
exact solution of systems of polynomial equations using Groebner bases
and resultant techniques.
The course will require several computational assignments utilizing
Maple, and several programming assignments using both Maple and C
or C++.
 Prerequisites
 Computer Algebra I.

Instructor

Jeremy Johnson
Office: 271 Korman Center
phone: 8952893
email: jjohnson@mcs.drexel.edu
office hours: MW 13 and T 46, additional hours by appointment.

Meeting Time
 W 6:009:00 in Commonwealth 306

Textbook

Keith Geddes, Stephen Czapor, and George Labahn
Algorithms for Computer Algebra.
Kluwer Academic Publishers, 1992.
Topics
 Interpolation and Hensel Lifting
 Polynomial factorization
 Root Isolation and Refinement
 Solving Systems of Equations
 Resultants
 Groebner Bases
 Quantifier Elimination
Grading
 Homework assignments (five) 50% (10% each)
 Programming project 50%
Created: 3/27/00 by jjohnson@mcs.drexel.edu