Working list of lectures (continuously under construction)
Algorithms for exact symbolic computation with integers of arbitrary size, polynomials, matrices, fields of quotients, and modular domains. Key algorithmic problmes: GCD, factorization, and solution of equations. Key techniques: Chinese remaindering, Hensel lifting, and transforms (FFT).
The Art of Computer Programming
Volume 2, Seminumeric Algorithms (3rd Edition),
D. E. Knuth, Addison Wesley, 1998
Saclib Users' Guide George Collins, et.al. and papers from the literature.
Systems of polynomial equations and inequalities arise in all scientific and engineering disciplines. In computer science itself, for example, the areas of theorem proving and robot motion planning particularly involve modelling of problems as quantified polynomial systems. Algorithms for the solution of many kinds of problems involving such systems will be the core subject of this course.
Among the tools used are algorithms for manipulating mathematical objects such as arbitrary length integers, univariate and multivariate polynomials, rational functions, and matrices. We will discuss correctness issues, analyze algorithm costs, and consider implentation issues.
Implementations of these algorithms are the core components of computer algebra systems such as Axiom, the 3 M's (Macsyma, Maple, Mathematica), Reduce, and Saclib. With these systems computer science has changed the nature of computational science. Computer algebra systems have revolutionized the working environments of scientists and engineers everywhere.
Required Background: Consent of instructor.
Restrictions: Offered in alternate years.
Helpful Background: Courses in linear or abstract algebra (eg. Math 650), or in analysis of algorithms (eg. CISC 621), or in computer algebra (eg. CISC 623).
Collins and Saunders[Fall 98],
Saunders [Fall 95 and Fall 93 as CISC 821, Spring 90 as CISC 829]
Lakshman [Spring 91 as CISC 829]
To CIS Home Page